./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/heap-data/packet_filter_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_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/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 2ec1c4691200cd1b12315d54c84be55eae1c29c8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/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 2ec1c4691200cd1b12315d54c84be55eae1c29c8 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_56 term size 26 --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:34:31,191 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:34:31,192 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:34:31,200 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:34:31,200 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:34:31,201 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:34:31,202 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:34:31,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:34:31,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:34:31,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:34:31,206 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:34:31,206 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:34:31,207 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:34:31,207 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:34:31,208 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:34:31,209 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:34:31,210 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:34:31,211 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:34:31,212 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:34:31,214 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:34:31,215 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:34:31,216 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:34:31,218 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:34:31,218 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:34:31,219 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:34:31,220 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:34:31,220 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:34:31,221 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:34:31,222 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:34:31,223 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:34:31,223 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:34:31,224 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:34:31,224 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:34:31,224 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:34:31,225 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:34:31,225 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:34:31,226 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 15:34:31,237 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:34:31,237 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:34:31,237 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:34:31,238 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 15:34:31,238 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 15:34:31,238 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 15:34:31,238 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 15:34:31,238 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 15:34:31,238 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 15:34:31,238 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 15:34:31,238 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 15:34:31,239 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 15:34:31,239 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 15:34:31,239 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:34:31,239 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:34:31,239 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:34:31,240 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:34:31,240 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:34:31,240 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:34:31,240 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:34:31,240 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:34:31,240 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:34:31,240 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:34:31,241 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:34:31,241 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:34:31,241 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:34:31,241 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:34:31,241 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:34:31,241 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:34:31,241 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:34:31,242 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:34:31,242 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:34:31,242 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:34:31,242 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 15:34:31,242 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:34:31,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 15:34:31,242 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 15:34:31,243 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_459663ea-0320-4ab6-8989-2ff55fdabbca/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 -> 2ec1c4691200cd1b12315d54c84be55eae1c29c8 [2018-11-18 15:34:31,265 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:34:31,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:34:31,276 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:34:31,277 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:34:31,277 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:34:31,278 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-11-18 15:34:31,315 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/data/454f27daa/68037ae7871d4af194a675a01eb99d79/FLAG3a21923fc [2018-11-18 15:34:31,759 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:34:31,759 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-11-18 15:34:31,767 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/data/454f27daa/68037ae7871d4af194a675a01eb99d79/FLAG3a21923fc [2018-11-18 15:34:31,776 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/data/454f27daa/68037ae7871d4af194a675a01eb99d79 [2018-11-18 15:34:31,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:34:31,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:34:31,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:34:31,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:34:31,783 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:34:31,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:34:31" (1/1) ... [2018-11-18 15:34:31,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e9d0273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:34:31, skipping insertion in model container [2018-11-18 15:34:31,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:34:31" (1/1) ... [2018-11-18 15:34:31,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:34:31,823 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:34:32,032 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:34:32,041 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:34:32,120 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:34:32,156 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:34:32,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:34:32 WrapperNode [2018-11-18 15:34:32,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:34:32,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:34:32,157 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:34:32,157 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:34:32,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:34:32" (1/1) ... [2018-11-18 15:34:32,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:34:32" (1/1) ... [2018-11-18 15:34:32,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:34:32,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:34:32,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:34:32,184 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:34:32,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:34:32" (1/1) ... [2018-11-18 15:34:32,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:34:32" (1/1) ... [2018-11-18 15:34:32,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:34:32" (1/1) ... [2018-11-18 15:34:32,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:34:32" (1/1) ... [2018-11-18 15:34:32,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:34:32" (1/1) ... [2018-11-18 15:34:32,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:34:32" (1/1) ... [2018-11-18 15:34:32,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:34:32" (1/1) ... [2018-11-18 15:34:32,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:34:32,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:34:32,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:34:32,220 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:34:32,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:34:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/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 15:34:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 15:34:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:34:32,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:34:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:34:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure receive [2018-11-18 15:34:32,262 INFO L138 BoogieDeclarations]: Found implementation of procedure receive [2018-11-18 15:34:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure process_prio_queue [2018-11-18 15:34:32,262 INFO L138 BoogieDeclarations]: Found implementation of procedure process_prio_queue [2018-11-18 15:34:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:34:32,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:34:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2018-11-18 15:34:32,262 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2018-11-18 15:34:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:34:32,262 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:34:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 15:34:32,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 15:34:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2018-11-18 15:34:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure send [2018-11-18 15:34:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:34:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure process_normal_queue [2018-11-18 15:34:32,263 INFO L138 BoogieDeclarations]: Found implementation of procedure process_normal_queue [2018-11-18 15:34:32,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:34:32,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:34:32,654 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:34:32,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:34:32 BoogieIcfgContainer [2018-11-18 15:34:32,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:34:32,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:34:32,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:34:32,658 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:34:32,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:34:31" (1/3) ... [2018-11-18 15:34:32,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7644489c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:34:32, skipping insertion in model container [2018-11-18 15:34:32,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:34:32" (2/3) ... [2018-11-18 15:34:32,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7644489c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:34:32, skipping insertion in model container [2018-11-18 15:34:32,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:34:32" (3/3) ... [2018-11-18 15:34:32,662 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter_true-unreach-call.i [2018-11-18 15:34:32,668 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:34:32,674 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-18 15:34:32,683 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-18 15:34:32,705 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:34:32,705 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:34:32,705 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:34:32,705 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:34:32,705 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:34:32,705 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:34:32,705 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:34:32,706 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:34:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-18 15:34:32,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 15:34:32,723 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:34:32,723 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:34:32,726 INFO L423 AbstractCegarLoop]: === Iteration 1 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:34:32,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:34:32,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1920556085, now seen corresponding path program 1 times [2018-11-18 15:34:32,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:34:32,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:34:32,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:34:32,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:34:32,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:34:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:34:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:34:32,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:34:32,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:34:32,825 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:34:32,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 15:34:32,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 15:34:32,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:34:32,838 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-11-18 15:34:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:34:32,857 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2018-11-18 15:34:32,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:34:32,858 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-18 15:34:32,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:34:32,865 INFO L225 Difference]: With dead ends: 91 [2018-11-18 15:34:32,865 INFO L226 Difference]: Without dead ends: 53 [2018-11-18 15:34:32,868 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 15:34:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-18 15:34:32,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-18 15:34:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 15:34:32,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-11-18 15:34:32,898 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 15 [2018-11-18 15:34:32,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:34:32,898 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-18 15:34:32,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 15:34:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-11-18 15:34:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 15:34:32,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:34:32,899 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:34:32,899 INFO L423 AbstractCegarLoop]: === Iteration 2 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:34:32,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:34:32,900 INFO L82 PathProgramCache]: Analyzing trace with hash -899375573, now seen corresponding path program 1 times [2018-11-18 15:34:32,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:34:32,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:34:32,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:34:32,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:34:32,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:34:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:34:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:34:32,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:34:32,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:34:32,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:34:32,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:34:32,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:34:32,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:34:32,954 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 3 states. [2018-11-18 15:34:32,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:34:32,975 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-18 15:34:32,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:34:32,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 15:34:32,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:34:32,977 INFO L225 Difference]: With dead ends: 56 [2018-11-18 15:34:32,977 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 15:34:32,978 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 15:34:32,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 15:34:32,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-18 15:34:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 15:34:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-11-18 15:34:32,985 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 17 [2018-11-18 15:34:32,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:34:32,985 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-11-18 15:34:32,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:34:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-11-18 15:34:32,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 15:34:32,986 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:34:32,986 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:34:32,986 INFO L423 AbstractCegarLoop]: === Iteration 3 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:34:32,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:34:32,986 INFO L82 PathProgramCache]: Analyzing trace with hash -899373651, now seen corresponding path program 1 times [2018-11-18 15:34:32,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:34:32,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:34:32,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:34:32,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:34:32,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:34:33,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:34:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:34:33,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:34:33,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:34:33,095 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:34:33,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:34:33,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:34:33,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:34:33,096 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 6 states. [2018-11-18 15:34:33,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:34:33,217 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2018-11-18 15:34:33,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:34:33,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-18 15:34:33,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:34:33,221 INFO L225 Difference]: With dead ends: 89 [2018-11-18 15:34:33,222 INFO L226 Difference]: Without dead ends: 67 [2018-11-18 15:34:33,222 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:34:33,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-18 15:34:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-11-18 15:34:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-18 15:34:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-11-18 15:34:33,231 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 17 [2018-11-18 15:34:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:34:33,232 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-11-18 15:34:33,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:34:33,232 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-11-18 15:34:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 15:34:33,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:34:33,233 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:34:33,233 INFO L423 AbstractCegarLoop]: === Iteration 4 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:34:33,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:34:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1843112862, now seen corresponding path program 1 times [2018-11-18 15:34:33,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:34:33,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:34:33,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:34:33,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:34:33,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:34:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:34:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:34:33,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:34:33,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:34:33,333 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:34:33,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:34:33,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:34:33,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:34:33,334 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 6 states. [2018-11-18 15:34:33,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:34:33,420 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2018-11-18 15:34:33,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:34:33,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-18 15:34:33,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:34:33,422 INFO L225 Difference]: With dead ends: 78 [2018-11-18 15:34:33,422 INFO L226 Difference]: Without dead ends: 58 [2018-11-18 15:34:33,422 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:34:33,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-18 15:34:33,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-18 15:34:33,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-18 15:34:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2018-11-18 15:34:33,428 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 24 [2018-11-18 15:34:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:34:33,428 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2018-11-18 15:34:33,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:34:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-18 15:34:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 15:34:33,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:34:33,429 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:34:33,429 INFO L423 AbstractCegarLoop]: === Iteration 5 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:34:33,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:34:33,430 INFO L82 PathProgramCache]: Analyzing trace with hash 468377316, now seen corresponding path program 1 times [2018-11-18 15:34:33,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:34:33,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:34:33,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:34:33,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:34:33,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:34:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:34:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:34:33,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:34:33,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:34:33,714 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-18 15:34:33,715 INFO L202 CegarAbsIntRunner]: [0], [3], [7], [8], [9], [13], [18], [23], [27], [28], [42], [46], [48], [51], [53], [55], [77], [79], [83], [89], [90], [125], [126], [133], [137], [138], [139] [2018-11-18 15:34:33,745 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:34:33,745 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:34:33,886 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:34:33,887 INFO L272 AbstractInterpreter]: Visited 27 different actions 27 times. Never merged. Never widened. Performed 216 root evaluator evaluations with a maximum evaluation depth of 4. Performed 216 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-11-18 15:34:33,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:34:33,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:34:33,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:34:33,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:34:33,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:34:33,902 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:34:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:34:33,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:34:34,002 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:34:34,006 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-18 15:34:34,009 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 23 treesize of output 15 [2018-11-18 15:34:34,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:34,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:34:34,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:34:34,037 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 15:34:34,038 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:34,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 15:34:34,055 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 15:34:34,056 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:34,063 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:34:34,071 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:34:34,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:34:34,087 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 15:34:34,087 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:34,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 15:34:34,098 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 15:34:34,098 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:34,102 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:34:34,106 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:34:34,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:34:34,115 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:43 [2018-11-18 15:34:34,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:34:34,171 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:34:34,174 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:34:34,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-18 15:34:34,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:34,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-18 15:34:34,212 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 15:34:34,212 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:34,230 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:34:34,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-18 15:34:34,283 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 15:34:34,283 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:34,294 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:34:34,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:34:34,312 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:80, output treesize:74 [2018-11-18 15:34:36,415 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:34:36,416 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:34:36,417 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:34:36,418 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:34:36,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-18 15:34:36,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:36,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-11-18 15:34:36,457 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 15:34:36,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:36,468 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:34:36,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-11-18 15:34:36,504 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 15:34:36,504 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:36,516 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:34:36,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:34:36,539 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:105, output treesize:59 [2018-11-18 15:34:36,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-11-18 15:34:36,587 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 9 [2018-11-18 15:34:36,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:36,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:34:36,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-11-18 15:34:36,644 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 9 [2018-11-18 15:34:36,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:36,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:34:36,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:34:36,680 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:85, output treesize:33 [2018-11-18 15:34:36,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 15:34:36,720 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 15:34:36,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:36,725 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 15:34:36,725 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:36,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:34:36,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 15:34:36,737 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 15:34:36,737 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:36,771 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 15:34:36,772 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:34:36,773 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:34:36,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:34:36,780 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:47, output treesize:7 [2018-11-18 15:34:36,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:34:36,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:34:37,542 WARN L180 SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-18 15:34:37,547 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-18 15:34:37,553 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:34:39,560 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((|v_main_~#prio_queue~0.offset_BEFORE_CALL_2| Int) (|v_main_~#new_packet~0.offset_BEFORE_CALL_2| Int) (|v_main_~#new_packet~0.base_BEFORE_CALL_2| Int) (|v_main_~#prio_queue~0.base_BEFORE_CALL_2| Int)) (or (exists ((|v_v_receive_#t~ret5.base_3_4| Int) (v_prenex_2 Int) (v_prenex_1 Int) (|main_#t~ret29.payload.base| Int)) (and (not (= 0 (select (select (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| v_prenex_1 (store (select |c_old(#memory_$Pointer$.base)| v_prenex_1) (+ v_prenex_2 8) |v_v_receive_#t~ret5.base_3_4|)))) (store .cse0 |v_main_~#new_packet~0.base_BEFORE_CALL_2| (store (select .cse0 |v_main_~#new_packet~0.base_BEFORE_CALL_2|) (+ |v_main_~#new_packet~0.offset_BEFORE_CALL_2| 8) |main_#t~ret29.payload.base|))) |v_main_~#prio_queue~0.base_BEFORE_CALL_2|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_2|))) (= 0 (select |c_old(#valid)| v_prenex_1)))) (forall ((v_prenex_3 Int)) (= (select (select (store |c_#memory_$Pointer$.base| |v_main_~#new_packet~0.base_BEFORE_CALL_2| (store (select |c_#memory_$Pointer$.base| |v_main_~#new_packet~0.base_BEFORE_CALL_2|) (+ |v_main_~#new_packet~0.offset_BEFORE_CALL_2| 8) v_prenex_3)) |v_main_~#prio_queue~0.base_BEFORE_CALL_2|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_2|) 0)) (exists ((|v_v_receive_#t~ret5.offset_3_4| Int) (|main_#t~ret29.payload.offset| Int) (|v_receive_~#packet~0.base_10| Int) (|v_receive_~#packet~0.offset_10| Int)) (and (not (= 0 (select (select (let ((.cse1 (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_10| (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_10|) (+ |v_receive_~#packet~0.offset_10| 8) |v_v_receive_#t~ret5.offset_3_4|)))) (store .cse1 |v_main_~#new_packet~0.base_BEFORE_CALL_2| (store (select .cse1 |v_main_~#new_packet~0.base_BEFORE_CALL_2|) (+ |v_main_~#new_packet~0.offset_BEFORE_CALL_2| 8) |main_#t~ret29.payload.offset|))) |v_main_~#prio_queue~0.base_BEFORE_CALL_2|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_2|))) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_10|) 0))))) (forall ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_5 Int) (v_prenex_8 Int)) (or (exists ((v_prenex_4 Int) (v_prenex_11 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (and (= (select |c_old(#valid)| v_prenex_13) 0) (not (= 0 (select (select (let ((.cse2 (store |c_old(#memory_$Pointer$.offset)| v_prenex_13 (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_13) (+ v_prenex_14 8) v_prenex_11)))) (store .cse2 v_prenex_8 (store (select .cse2 v_prenex_8) (+ v_prenex_5 8) v_prenex_4))) v_prenex_6) v_prenex_7))))) (exists ((v_prenex_15 Int) (v_prenex_12 Int) (v_prenex_10 Int) (v_prenex_9 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_12)) (not (= 0 (select (select (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| v_prenex_12 (store (select |c_old(#memory_$Pointer$.base)| v_prenex_12) (+ v_prenex_10 8) v_prenex_9)))) (store .cse3 v_prenex_8 (store (select .cse3 v_prenex_8) (+ v_prenex_5 8) v_prenex_15))) v_prenex_6) v_prenex_7))))) (forall ((v_prenex_16 Int)) (= 0 (select (select (store |c_#memory_$Pointer$.offset| v_prenex_8 (store (select |c_#memory_$Pointer$.offset| v_prenex_8) (+ v_prenex_5 8) v_prenex_16)) v_prenex_6) v_prenex_7)))))) is different from false [2018-11-18 15:34:39,568 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-18 15:34:39,574 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:34:39,584 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-18 15:34:39,589 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:34:47,771 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 127 [2018-11-18 15:34:47,777 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-18 15:34:47,782 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:34:47,791 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-18 15:34:47,799 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-11-18 15:34:52,015 WARN L180 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 135 [2018-11-18 15:34:55,127 WARN L180 SmtUtils]: Spent 2.97 s on a formula simplification that was a NOOP. DAG size: 67 [2018-11-18 15:34:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:34:55,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:34:55,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-11-18 15:34:55,178 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:34:55,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 15:34:55,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 15:34:55,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=4, NotChecked=40, Total=506 [2018-11-18 15:34:55,179 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 17 states. [2018-11-18 15:35:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:35:01,779 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2018-11-18 15:35:01,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:35:01,779 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-11-18 15:35:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:35:01,780 INFO L225 Difference]: With dead ends: 101 [2018-11-18 15:35:01,780 INFO L226 Difference]: Without dead ends: 79 [2018-11-18 15:35:01,781 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=4, NotChecked=50, Total=756 [2018-11-18 15:35:01,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-18 15:35:01,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2018-11-18 15:35:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-18 15:35:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2018-11-18 15:35:01,790 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 29 [2018-11-18 15:35:01,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:35:01,790 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2018-11-18 15:35:01,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 15:35:01,790 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2018-11-18 15:35:01,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 15:35:01,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:35:01,791 INFO L375 BasicCegarLoop]: trace histogram [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 15:35:01,792 INFO L423 AbstractCegarLoop]: === Iteration 6 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:35:01,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:35:01,792 INFO L82 PathProgramCache]: Analyzing trace with hash -978719373, now seen corresponding path program 1 times [2018-11-18 15:35:01,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:35:01,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:35:01,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:35:01,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:35:01,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:35:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:35:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:35:01,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:35:01,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:35:01,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:35:01,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:35:01,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:35:01,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:35:01,886 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand 7 states. [2018-11-18 15:35:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:35:01,956 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2018-11-18 15:35:01,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:35:01,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-18 15:35:01,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:35:01,957 INFO L225 Difference]: With dead ends: 132 [2018-11-18 15:35:01,957 INFO L226 Difference]: Without dead ends: 84 [2018-11-18 15:35:01,958 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:35:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-18 15:35:01,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 79. [2018-11-18 15:35:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-18 15:35:01,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2018-11-18 15:35:01,966 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 35 [2018-11-18 15:35:01,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:35:01,966 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2018-11-18 15:35:01,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:35:01,966 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2018-11-18 15:35:01,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 15:35:01,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:35:01,967 INFO L375 BasicCegarLoop]: trace histogram [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 15:35:01,967 INFO L423 AbstractCegarLoop]: === Iteration 7 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:35:01,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:35:01,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1112732879, now seen corresponding path program 1 times [2018-11-18 15:35:01,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:35:01,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:35:01,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:35:01,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:35:01,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:35:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:35:02,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:35:02,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:35:02,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 15:35:02,164 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:35:02,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 15:35:02,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 15:35:02,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:35:02,165 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand 13 states. [2018-11-18 15:35:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:35:02,557 INFO L93 Difference]: Finished difference Result 134 states and 161 transitions. [2018-11-18 15:35:02,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 15:35:02,557 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-11-18 15:35:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:35:02,558 INFO L225 Difference]: With dead ends: 134 [2018-11-18 15:35:02,558 INFO L226 Difference]: Without dead ends: 112 [2018-11-18 15:35:02,559 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-11-18 15:35:02,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-18 15:35:02,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2018-11-18 15:35:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-18 15:35:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2018-11-18 15:35:02,567 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 35 [2018-11-18 15:35:02,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:35:02,568 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2018-11-18 15:35:02,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 15:35:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2018-11-18 15:35:02,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 15:35:02,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:35:02,569 INFO L375 BasicCegarLoop]: trace histogram [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 15:35:02,569 INFO L423 AbstractCegarLoop]: === Iteration 8 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:35:02,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:35:02,569 INFO L82 PathProgramCache]: Analyzing trace with hash -266705778, now seen corresponding path program 1 times [2018-11-18 15:35:02,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:35:02,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:35:02,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:35:02,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:35:02,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:35:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:35:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:35:02,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:35:02,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 15:35:02,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:35:02,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:35:02,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:35:02,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:35:02,742 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand 11 states. [2018-11-18 15:35:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:35:03,048 INFO L93 Difference]: Finished difference Result 129 states and 155 transitions. [2018-11-18 15:35:03,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 15:35:03,048 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-11-18 15:35:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:35:03,049 INFO L225 Difference]: With dead ends: 129 [2018-11-18 15:35:03,049 INFO L226 Difference]: Without dead ends: 127 [2018-11-18 15:35:03,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-11-18 15:35:03,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-18 15:35:03,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2018-11-18 15:35:03,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-18 15:35:03,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2018-11-18 15:35:03,062 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 144 transitions. Word has length 36 [2018-11-18 15:35:03,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:35:03,062 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 144 transitions. [2018-11-18 15:35:03,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:35:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2018-11-18 15:35:03,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 15:35:03,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:35:03,063 INFO L375 BasicCegarLoop]: trace histogram [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 15:35:03,064 INFO L423 AbstractCegarLoop]: === Iteration 9 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:35:03,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:35:03,064 INFO L82 PathProgramCache]: Analyzing trace with hash 561862222, now seen corresponding path program 1 times [2018-11-18 15:35:03,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:35:03,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:35:03,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:35:03,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:35:03,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:35:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:35:03,498 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-18 15:35:03,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:35:03,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:35:03,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:35:03,573 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-18 15:35:03,573 INFO L202 CegarAbsIntRunner]: [0], [3], [7], [8], [9], [13], [18], [23], [27], [28], [40], [41], [42], [46], [48], [51], [53], [55], [58], [65], [72], [74], [79], [83], [89], [90], [125], [126], [131], [132], [133], [137], [138], [139] [2018-11-18 15:35:03,575 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:35:03,575 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:35:03,638 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:35:03,638 INFO L272 AbstractInterpreter]: Visited 34 different actions 34 times. Never merged. Never widened. Performed 301 root evaluator evaluations with a maximum evaluation depth of 5. Performed 301 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 34 variables. [2018-11-18 15:35:03,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:35:03,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:35:03,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:35:03,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:35:03,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:35:03,671 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:35:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:35:03,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:35:03,732 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:03,732 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-18 15:35:03,738 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 23 treesize of output 15 [2018-11-18 15:35:03,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:03,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:35:03,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:35:03,762 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 15:35:03,762 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:03,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 15:35:03,774 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 15:35:03,774 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:03,779 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:35:03,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:35:03,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:35:03,797 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 15:35:03,797 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:03,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 15:35:03,809 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 15:35:03,810 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:03,815 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:35:03,821 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:35:03,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:35:03,830 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:43 [2018-11-18 15:35:03,860 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:03,861 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:03,862 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:03,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-18 15:35:03,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:03,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-18 15:35:03,906 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 15:35:03,907 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:03,935 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:35:03,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-18 15:35:03,962 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 15:35:03,963 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:03,969 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:35:03,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:35:03,983 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:80, output treesize:74 [2018-11-18 15:35:08,095 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,097 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,098 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,099 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2018-11-18 15:35:08,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:08,132 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,134 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-11-18 15:35:08,148 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 15:35:08,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:08,160 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:35:08,185 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,189 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-11-18 15:35:08,206 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 15:35:08,206 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:08,221 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:35:08,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:35:08,251 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:111, output treesize:79 [2018-11-18 15:35:08,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-11-18 15:35:08,313 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 9 [2018-11-18 15:35:08,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:08,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:35:08,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-11-18 15:35:08,355 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 9 [2018-11-18 15:35:08,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:08,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:35:08,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 15:35:08,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:105, output treesize:61 [2018-11-18 15:35:08,645 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-11-18 15:35:08,654 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,659 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,665 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,673 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,677 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,683 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,686 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,691 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2018-11-18 15:35:08,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:08,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 104 [2018-11-18 15:35:08,924 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2018-11-18 15:35:08,927 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 15:35:08,928 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:08,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 76 [2018-11-18 15:35:08,990 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-18 15:35:08,994 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:08,997 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 22 treesize of output 31 [2018-11-18 15:35:08,998 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:09,008 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:35:09,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 72 [2018-11-18 15:35:09,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 33 [2018-11-18 15:35:09,072 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-11-18 15:35:09,109 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:35:09,142 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:35:09,177 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:35:09,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 104 [2018-11-18 15:35:09,364 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2018-11-18 15:35:09,368 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 15:35:09,368 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:09,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 76 [2018-11-18 15:35:09,407 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-18 15:35:09,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:09,412 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 22 treesize of output 31 [2018-11-18 15:35:09,413 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:09,419 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:35:09,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 72 [2018-11-18 15:35:09,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 33 [2018-11-18 15:35:09,466 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-11-18 15:35:09,509 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:35:09,529 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:35:09,550 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:35:09,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-11-18 15:35:09,612 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 13 variables, input treesize:340, output treesize:239 [2018-11-18 15:35:27,453 WARN L180 SmtUtils]: Spent 9.26 s on a formula simplification that was a NOOP. DAG size: 92 [2018-11-18 15:35:27,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 122 [2018-11-18 15:35:27,515 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 15:35:27,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:27,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:27,542 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 25 treesize of output 16 [2018-11-18 15:35:27,542 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:27,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-11-18 15:35:27,571 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:35:27,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:35:27,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 58 [2018-11-18 15:35:27,627 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 15:35:27,627 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:27,641 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:35:27,642 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 21 treesize of output 12 [2018-11-18 15:35:27,642 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:27,663 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:35:27,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 108 [2018-11-18 15:35:27,702 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 15:35:27,702 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:27,721 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 1 [2018-11-18 15:35:27,722 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:27,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-11-18 15:35:27,740 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:35:27,765 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:35:27,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2018-11-18 15:35:27,794 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 15:35:27,794 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:27,806 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 1 [2018-11-18 15:35:27,806 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:27,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 15:35:27,816 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 15:35:27,832 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:35:27,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:35:27,849 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 15 variables, input treesize:267, output treesize:7 [2018-11-18 15:35:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:35:27,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:35:29,039 WARN L180 SmtUtils]: Spent 815.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-18 15:35:29,045 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:35:31,058 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_33 Int) (v_prenex_32 Int)) (or (exists ((v_prenex_38 Int) (v_prenex_37 Int) (v_prenex_35 Int) (v_prenex_41 Int) (v_prenex_40 Int)) (and (= 0 (select (store |c_old(#valid)| v_prenex_37 1) v_prenex_40)) (= (select |c_old(#valid)| v_prenex_37) 0) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| v_prenex_37 (store (select |c_old(#memory_$Pointer$.base)| v_prenex_37) 8 v_prenex_41)))) (store .cse1 v_prenex_40 (let ((.cse2 (store (select .cse1 v_prenex_40) (+ v_prenex_38 8) v_prenex_41))) (store .cse2 (+ v_prenex_38 12) (select (select (store .cse1 v_prenex_40 .cse2) |c_append_to_queue_#in~q.base|) v_prenex_35))))))) (store .cse0 |c_append_to_queue_#in~q.base| (store (select .cse0 |c_append_to_queue_#in~q.base|) v_prenex_35 v_prenex_40))) v_prenex_32) v_prenex_33) 0)))) (exists ((v_prenex_39 Int) (v_prenex_34 Int) (v_prenex_36 Int) (v_prenex_43 Int) (v_prenex_42 Int)) (and (= (select (store |c_old(#valid)| v_prenex_34 1) v_prenex_43) 0) (= (select |c_old(#valid)| v_prenex_34) 0) (not (= (select (select (let ((.cse3 (let ((.cse4 (store |c_old(#memory_$Pointer$.offset)| v_prenex_34 (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_34) 8 v_prenex_39)))) (store .cse4 v_prenex_43 (let ((.cse5 (store (select .cse4 v_prenex_43) (+ v_prenex_42 8) v_prenex_39))) (store .cse5 (+ v_prenex_42 12) (select (select (store .cse4 v_prenex_43 .cse5) |c_append_to_queue_#in~q.base|) v_prenex_36))))))) (store .cse3 |c_append_to_queue_#in~q.base| (store (select .cse3 |c_append_to_queue_#in~q.base|) v_prenex_36 v_prenex_42))) v_prenex_32) v_prenex_33) 0)))) (= 0 (select (select |c_#memory_$Pointer$.offset| v_prenex_32) v_prenex_33)))) (forall ((|v_main_~#prio_queue~0.base_BEFORE_CALL_5| Int) (|v_main_~#prio_queue~0.offset_BEFORE_CALL_5| Int)) (or (= (select (select |c_#memory_$Pointer$.base| |v_main_~#prio_queue~0.base_BEFORE_CALL_5|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_5|) 0) (exists ((|v_v_append_to_queue_~#p.base_3_4| Int) (v_append_to_queue_~q.offset_4 Int) (|v_append_to_queue_#in~p.payload.offset_4| Int) (v_append_to_queue_~node~0.offset_4 Int) (|v_append_to_queue_#t~malloc9.base_4| Int)) (and (= (select (store |c_old(#valid)| |v_v_append_to_queue_~#p.base_3_4| 1) |v_append_to_queue_#t~malloc9.base_4|) 0) (not (= (select (select (let ((.cse6 (let ((.cse7 (store |c_old(#memory_$Pointer$.offset)| |v_v_append_to_queue_~#p.base_3_4| (store (select |c_old(#memory_$Pointer$.offset)| |v_v_append_to_queue_~#p.base_3_4|) 8 |v_append_to_queue_#in~p.payload.offset_4|)))) (store .cse7 |v_append_to_queue_#t~malloc9.base_4| (let ((.cse8 (store (select .cse7 |v_append_to_queue_#t~malloc9.base_4|) (+ v_append_to_queue_~node~0.offset_4 8) |v_append_to_queue_#in~p.payload.offset_4|))) (store .cse8 (+ v_append_to_queue_~node~0.offset_4 12) (select (select (store .cse7 |v_append_to_queue_#t~malloc9.base_4| .cse8) |c_append_to_queue_#in~q.base|) v_append_to_queue_~q.offset_4))))))) (store .cse6 |c_append_to_queue_#in~q.base| (store (select .cse6 |c_append_to_queue_#in~q.base|) v_append_to_queue_~q.offset_4 v_append_to_queue_~node~0.offset_4))) |v_main_~#prio_queue~0.base_BEFORE_CALL_5|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_5|) 0)) (= (select |c_old(#valid)| |v_v_append_to_queue_~#p.base_3_4|) 0))) (exists ((v_prenex_29 Int) (v_prenex_28 Int) (|v_append_to_queue_#in~p.payload.base_4| Int) (v_prenex_30 Int) (v_prenex_31 Int)) (and (not (= (select (select (let ((.cse9 (let ((.cse10 (store |c_old(#memory_$Pointer$.base)| v_prenex_28 (store (select |c_old(#memory_$Pointer$.base)| v_prenex_28) 8 |v_append_to_queue_#in~p.payload.base_4|)))) (store .cse10 v_prenex_31 (let ((.cse11 (store (select .cse10 v_prenex_31) (+ v_prenex_30 8) |v_append_to_queue_#in~p.payload.base_4|))) (store .cse11 (+ v_prenex_30 12) (select (select (store .cse10 v_prenex_31 .cse11) |c_append_to_queue_#in~q.base|) v_prenex_29))))))) (store .cse9 |c_append_to_queue_#in~q.base| (store (select .cse9 |c_append_to_queue_#in~q.base|) v_prenex_29 v_prenex_31))) |v_main_~#prio_queue~0.base_BEFORE_CALL_5|) |v_main_~#prio_queue~0.offset_BEFORE_CALL_5|) 0)) (= 0 (select (store |c_old(#valid)| v_prenex_28 1) v_prenex_31)) (= (select |c_old(#valid)| v_prenex_28) 0)))))) is different from false [2018-11-18 15:35:31,066 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:35:31,074 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-11-18 15:35:47,379 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 204 [2018-11-18 15:36:04,348 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 108 [2018-11-18 15:36:04,356 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 32 [2018-11-18 15:36:04,519 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 9129 conjuctions. This might take some time... [2018-11-18 15:36:04,555 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 15 conjuctions. [2018-11-18 15:36:04,559 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-18 15:36:32,907 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 277 [2018-11-18 15:36:32,914 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 32 [2018-11-18 15:36:33,047 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 9129 conjuctions. This might take some time... [2018-11-18 15:36:33,080 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 15 conjuctions. [2018-11-18 15:36:33,084 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-18 15:36:33,093 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 32 [2018-11-18 15:36:33,220 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 11247 conjuctions. This might take some time... [2018-11-18 15:36:33,263 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 15 conjuctions. [2018-11-18 15:36:33,267 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-18 15:36:55,734 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification that was a NOOP. DAG size: 291 [2018-11-18 15:36:55,740 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 32 [2018-11-18 15:36:55,877 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 11247 conjuctions. This might take some time... [2018-11-18 15:36:55,915 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 15 conjuctions. [2018-11-18 15:36:55,919 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-11-18 15:36:55,928 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 32 [2018-11-18 15:36:56,143 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 18523 conjuctions. This might take some time... [2018-11-18 15:36:56,262 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 24 conjuctions. [2018-11-18 15:36:56,267 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2018-11-18 15:37:30,702 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 299 [2018-11-18 15:37:49,243 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 125 [2018-11-18 15:37:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:37:49,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:37:49,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 30 [2018-11-18 15:37:49,302 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:37:49,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 15:37:49,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 15:37:49,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=645, Unknown=62, NotChecked=54, Total=870 [2018-11-18 15:37:49,303 INFO L87 Difference]: Start difference. First operand 117 states and 144 transitions. Second operand 21 states. [2018-11-18 15:38:49,374 WARN L180 SmtUtils]: Spent 6.88 s on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2018-11-18 15:39:13,458 WARN L180 SmtUtils]: Spent 9.62 s on a formula simplification that was a NOOP. DAG size: 97 [2018-11-18 15:39:31,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:39:31,331 INFO L93 Difference]: Finished difference Result 188 states and 242 transitions. [2018-11-18 15:39:31,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 15:39:31,331 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2018-11-18 15:39:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:39:31,332 INFO L225 Difference]: With dead ends: 188 [2018-11-18 15:39:31,332 INFO L226 Difference]: Without dead ends: 166 [2018-11-18 15:39:31,333 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 203.8s TimeCoverageRelationStatistics Valid=166, Invalid=1096, Unknown=74, NotChecked=70, Total=1406 [2018-11-18 15:39:31,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-18 15:39:31,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 126. [2018-11-18 15:39:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-18 15:39:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 157 transitions. [2018-11-18 15:39:31,345 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 157 transitions. Word has length 36 [2018-11-18 15:39:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:39:31,346 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 157 transitions. [2018-11-18 15:39:31,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 15:39:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 157 transitions. [2018-11-18 15:39:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 15:39:31,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:39:31,347 INFO L375 BasicCegarLoop]: trace histogram [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 15:39:31,347 INFO L423 AbstractCegarLoop]: === Iteration 10 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:39:31,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:31,347 INFO L82 PathProgramCache]: Analyzing trace with hash 305962827, now seen corresponding path program 1 times [2018-11-18 15:39:31,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:39:31,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:31,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:31,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:39:31,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:39:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:39:31,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:39:31,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:39:31,602 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-18 15:39:31,602 INFO L202 CegarAbsIntRunner]: [0], [3], [7], [8], [9], [13], [16], [39], [42], [46], [48], [51], [53], [55], [77], [79], [83], [85], [89], [90], [94], [98], [103], [106], [112], [113], [125], [126], [133], [134], [135], [137], [138], [139] [2018-11-18 15:39:31,604 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:39:31,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:39:31,652 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:39:31,652 INFO L272 AbstractInterpreter]: Visited 34 different actions 34 times. Never merged. Never widened. Performed 252 root evaluator evaluations with a maximum evaluation depth of 4. Performed 252 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-11-18 15:39:31,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:39:31,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:39:31,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:39:31,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:39:31,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:39:31,673 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:39:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:39:31,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:39:31,702 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-18 15:39:31,707 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 12 treesize of output 11 [2018-11-18 15:39:31,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,752 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:39:31,755 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 15:39:31,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-18 15:39:31,782 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 17 treesize of output 18 [2018-11-18 15:39:31,783 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,801 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 16 treesize of output 15 [2018-11-18 15:39:31,801 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,811 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,834 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:39:31,836 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 15:39:31,836 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-18 15:39:31,867 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 20 treesize of output 19 [2018-11-18 15:39:31,867 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,904 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,908 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:39:31,917 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:64, output treesize:39 [2018-11-18 15:39:31,927 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:39:31,928 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:39:31,929 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 17 treesize of output 21 [2018-11-18 15:39:31,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 15:39:31,948 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 15:39:31,949 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,953 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 15:39:31,967 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 15:39:31,967 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,972 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:39:31,979 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:57, output treesize:47 [2018-11-18 15:39:34,032 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:39:34,033 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:39:34,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:39:34,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 15:39:34,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:39:34,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-11-18 15:39:34,063 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 15:39:34,063 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:39:34,073 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:39:34,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-11-18 15:39:34,095 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 15:39:34,095 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:39:34,103 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:39:34,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:39:34,115 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:78, output treesize:37 [2018-11-18 15:39:34,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-18 15:39:34,140 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 9 [2018-11-18 15:39:34,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:39:34,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:39:34,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-18 15:39:34,158 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 9 [2018-11-18 15:39:34,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:39:34,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:39:34,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:39:34,168 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:63, output treesize:15 [2018-11-18 15:39:34,198 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 15:39:34,199 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 15:39:34,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:39:34,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:39:34,205 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 15:39:34,207 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 15:39:34,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:39:34,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:39:34,210 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 15:39:34,210 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-18 15:39:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:39:34,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:39:34,417 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-18 15:39:34,420 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:39:36,439 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_96 Int) (v_prenex_95 Int) (v_prenex_98 Int) (v_prenex_97 Int) (v_prenex_94 Int)) (or (= 0 (select (select (store |c_#memory_$Pointer$.base| v_prenex_97 (store (select |c_#memory_$Pointer$.base| v_prenex_97) (+ v_prenex_96 8) v_prenex_98)) v_prenex_94) v_prenex_95)) (exists ((v_prenex_104 Int) (v_prenex_102 Int) (v_prenex_100 Int) (v_prenex_92 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_102)) (not (= 0 (select (select (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| v_prenex_102 (store (select |c_old(#memory_$Pointer$.base)| v_prenex_102) (+ v_prenex_100 8) v_prenex_104)))) (store .cse0 v_prenex_97 (store (select .cse0 v_prenex_97) (+ v_prenex_96 8) v_prenex_92))) v_prenex_94) v_prenex_95))))) (exists ((v_prenex_105 Int) (v_prenex_103 Int) (v_prenex_101 Int) (v_prenex_99 Int)) (and (= 0 (select |c_old(#valid)| v_prenex_101)) (not (= 0 (select (select (let ((.cse1 (store |c_old(#memory_$Pointer$.offset)| v_prenex_101 (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_101) (+ v_prenex_103 8) v_prenex_105)))) (store .cse1 v_prenex_97 (store (select .cse1 v_prenex_97) (+ v_prenex_96 8) v_prenex_99))) v_prenex_94) v_prenex_95))))))) (forall ((|v_main_~#new_packet~0.base_BEFORE_CALL_6| Int) (|v_main_~#normal_queue~0.base_BEFORE_CALL_8| Int) (|v_main_~#normal_queue~0.offset_BEFORE_CALL_4| Int) (|v_main_~#new_packet~0.offset_BEFORE_CALL_6| Int)) (or (exists ((|v_receive_~#packet~0.base_27| Int) (|v_receive_~#packet~0.offset_28| Int) (|main_#t~ret29.payload.offset| Int) (|v_v_receive_#t~ret5.offset_3_12| Int)) (and (= 0 (select |c_old(#valid)| |v_receive_~#packet~0.base_27|)) (not (= 0 (select (select (let ((.cse2 (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_27| (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_27|) (+ |v_receive_~#packet~0.offset_28| 8) |v_v_receive_#t~ret5.offset_3_12|)))) (store .cse2 |v_main_~#new_packet~0.base_BEFORE_CALL_6| (store (select .cse2 |v_main_~#new_packet~0.base_BEFORE_CALL_6|) (+ |v_main_~#new_packet~0.offset_BEFORE_CALL_6| 8) |main_#t~ret29.payload.offset|))) |v_main_~#normal_queue~0.base_BEFORE_CALL_8|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_4|))))) (forall ((v_prenex_93 Int)) (= (select (select (store |c_#memory_$Pointer$.offset| |v_main_~#new_packet~0.base_BEFORE_CALL_6| (store (select |c_#memory_$Pointer$.offset| |v_main_~#new_packet~0.base_BEFORE_CALL_6|) (+ |v_main_~#new_packet~0.offset_BEFORE_CALL_6| 8) v_prenex_93)) |v_main_~#normal_queue~0.base_BEFORE_CALL_8|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_4|) 0)) (exists ((v_prenex_90 Int) (|v_v_receive_#t~ret5.base_3_12| Int) (v_prenex_91 Int) (|main_#t~ret29.payload.base| Int)) (and (= 0 (select |c_old(#valid)| v_prenex_90)) (not (= 0 (select (select (let ((.cse3 (store |c_old(#memory_$Pointer$.base)| v_prenex_90 (store (select |c_old(#memory_$Pointer$.base)| v_prenex_90) (+ v_prenex_91 8) |v_v_receive_#t~ret5.base_3_12|)))) (store .cse3 |v_main_~#new_packet~0.base_BEFORE_CALL_6| (store (select .cse3 |v_main_~#new_packet~0.base_BEFORE_CALL_6|) (+ |v_main_~#new_packet~0.offset_BEFORE_CALL_6| 8) |main_#t~ret29.payload.base|))) |v_main_~#normal_queue~0.base_BEFORE_CALL_8|) |v_main_~#normal_queue~0.offset_BEFORE_CALL_4|)))))))) is different from false [2018-11-18 15:39:36,446 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-18 15:39:36,450 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:39:36,456 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-18 15:39:36,459 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:39:46,671 WARN L180 SmtUtils]: Spent 8.05 s on a formula simplification that was a NOOP. DAG size: 126 [2018-11-18 15:39:46,673 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-18 15:39:46,675 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:39:46,678 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-18 15:39:46,680 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-11-18 15:39:52,895 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 134 [2018-11-18 15:39:57,220 WARN L180 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 67 [2018-11-18 15:39:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:39:57,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:39:57,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 22 [2018-11-18 15:39:57,251 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:39:57,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 15:39:57,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 15:39:57,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=4, NotChecked=38, Total=462 [2018-11-18 15:39:57,252 INFO L87 Difference]: Start difference. First operand 126 states and 157 transitions. Second operand 16 states. [2018-11-18 15:40:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:05,771 INFO L93 Difference]: Finished difference Result 163 states and 207 transitions. [2018-11-18 15:40:05,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 15:40:05,771 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-11-18 15:40:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:40:05,772 INFO L225 Difference]: With dead ends: 163 [2018-11-18 15:40:05,772 INFO L226 Difference]: Without dead ends: 143 [2018-11-18 15:40:05,773 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 56 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=110, Invalid=536, Unknown=8, NotChecked=48, Total=702 [2018-11-18 15:40:05,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-18 15:40:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135. [2018-11-18 15:40:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-18 15:40:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 170 transitions. [2018-11-18 15:40:05,780 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 170 transitions. Word has length 36 [2018-11-18 15:40:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:40:05,780 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 170 transitions. [2018-11-18 15:40:05,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 15:40:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 170 transitions. [2018-11-18 15:40:05,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 15:40:05,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:40:05,781 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:40:05,781 INFO L423 AbstractCegarLoop]: === Iteration 11 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:40:05,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:05,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1152086622, now seen corresponding path program 1 times [2018-11-18 15:40:05,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:40:05,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:05,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:05,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:05,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:40:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:40:05,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:40:05,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:40:05,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:40:05,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:40:05,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:40:05,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:40:05,835 INFO L87 Difference]: Start difference. First operand 135 states and 170 transitions. Second operand 7 states. [2018-11-18 15:40:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:40:05,934 INFO L93 Difference]: Finished difference Result 169 states and 207 transitions. [2018-11-18 15:40:05,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:40:05,935 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-11-18 15:40:05,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:40:05,936 INFO L225 Difference]: With dead ends: 169 [2018-11-18 15:40:05,936 INFO L226 Difference]: Without dead ends: 154 [2018-11-18 15:40:05,936 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:40:05,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-18 15:40:05,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 135. [2018-11-18 15:40:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-18 15:40:05,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 168 transitions. [2018-11-18 15:40:05,946 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 168 transitions. Word has length 42 [2018-11-18 15:40:05,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:40:05,946 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 168 transitions. [2018-11-18 15:40:05,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:40:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 168 transitions. [2018-11-18 15:40:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 15:40:05,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:40:05,947 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:40:05,947 INFO L423 AbstractCegarLoop]: === Iteration 12 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:40:05,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:05,947 INFO L82 PathProgramCache]: Analyzing trace with hash -931235872, now seen corresponding path program 1 times [2018-11-18 15:40:05,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:40:05,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:05,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:05,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:40:05,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:40:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:06,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:40:06,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:40:06,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:40:06,245 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-11-18 15:40:06,245 INFO L202 CegarAbsIntRunner]: [0], [5], [7], [8], [9], [13], [18], [21], [23], [27], [28], [31], [33], [35], [40], [41], [42], [46], [48], [51], [53], [55], [58], [61], [63], [79], [83], [89], [90], [125], [126], [127], [128], [133], [137], [138], [139] [2018-11-18 15:40:06,247 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:40:06,247 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:40:06,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:40:06,289 INFO L272 AbstractInterpreter]: Visited 37 different actions 39 times. Merged at 1 different actions 1 times. Never widened. Performed 297 root evaluator evaluations with a maximum evaluation depth of 5. Performed 297 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 3 different actions. Largest state had 34 variables. [2018-11-18 15:40:06,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:40:06,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:40:06,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:40:06,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/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 15:40:06,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:40:06,309 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:40:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:40:06,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:40:06,378 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:06,378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-18 15:40:06,381 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 23 treesize of output 15 [2018-11-18 15:40:06,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:06,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:06,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:40:06,417 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 15:40:06,418 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:06,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 15:40:06,432 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 15:40:06,432 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:06,438 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:06,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:06,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:40:06,455 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 15:40:06,455 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:06,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 15:40:06,465 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 15:40:06,465 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:06,468 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:06,471 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:06,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:40:06,479 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:75, output treesize:46 [2018-11-18 15:40:06,505 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:06,505 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:06,506 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:06,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-11-18 15:40:06,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:06,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-18 15:40:06,535 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 15:40:06,535 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:06,541 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:06,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-18 15:40:06,565 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 15:40:06,566 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:06,572 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:06,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:40:06,586 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:83, output treesize:77 [2018-11-18 15:40:11,856 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:11,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:11,858 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:11,859 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:11,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2018-11-18 15:40:11,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:11,893 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:11,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:11,895 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:11,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-11-18 15:40:11,911 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 15:40:11,911 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:11,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:11,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:11,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:11,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:11,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-11-18 15:40:11,974 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 15:40:11,974 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:11,984 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:12,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 15:40:12,003 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:114, output treesize:82 [2018-11-18 15:40:12,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-11-18 15:40:12,051 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 9 [2018-11-18 15:40:12,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:12,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:12,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-11-18 15:40:12,087 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 9 [2018-11-18 15:40:12,087 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:12,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:12,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 15:40:12,109 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:108, output treesize:64 [2018-11-18 15:40:18,658 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-18 15:40:18,667 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:18,675 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:18,678 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:18,681 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:18,683 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:18,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:18,694 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:18,697 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:18,699 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:18,703 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:18,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2018-11-18 15:40:18,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:18,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 92 [2018-11-18 15:40:18,934 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 15:40:18,934 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 72 [2018-11-18 15:40:19,003 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 15:40:19,009 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 19 [2018-11-18 15:40:19,009 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,017 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 68 [2018-11-18 15:40:19,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-18 15:40:19,076 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,095 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,108 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,121 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 92 [2018-11-18 15:40:19,261 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 15:40:19,262 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 72 [2018-11-18 15:40:19,294 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 15:40:19,298 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 19 [2018-11-18 15:40:19,298 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,302 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,323 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:40:19,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 68 [2018-11-18 15:40:19,326 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 23 treesize of output 19 [2018-11-18 15:40:19,326 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,337 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,343 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,350 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 15:40:19,381 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 11 variables, input treesize:319, output treesize:100 [2018-11-18 15:40:19,588 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:19,589 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:40:19,590 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:40:19,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 86 [2018-11-18 15:40:19,601 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 15:40:19,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,616 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:40:19,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 15:40:19,617 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,623 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 21 treesize of output 13 [2018-11-18 15:40:19,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,629 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 15:40:19,629 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2018-11-18 15:40:19,659 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 15:40:19,659 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,670 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:40:19,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 16 [2018-11-18 15:40:19,672 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,678 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 15:40:19,678 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,680 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:40:19,688 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:131, output treesize:7 [2018-11-18 15:40:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:40:19,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:40:20,390 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-18 15:40:21,502 WARN L180 SmtUtils]: Spent 462.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-11-18 15:40:28,223 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-11-18 15:40:51,532 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 249 [2018-11-18 15:40:51,539 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-11-18 15:40:51,549 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-11-18 15:41:10,438 WARN L180 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 263 [2018-11-18 15:41:10,445 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-11-18 15:41:10,460 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-11-18 15:41:38,735 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 271 [2018-11-18 15:41:53,028 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 116 [2018-11-18 15:41:53,064 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:41:53,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:41:53,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 39 [2018-11-18 15:41:53,080 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:41:53,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 15:41:53,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 15:41:53,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1299, Unknown=45, NotChecked=0, Total=1482 [2018-11-18 15:41:53,081 INFO L87 Difference]: Start difference. First operand 135 states and 168 transitions. Second operand 26 states. [2018-11-18 15:42:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:39,273 INFO L93 Difference]: Finished difference Result 255 states and 316 transitions. [2018-11-18 15:42:39,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 15:42:39,273 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 41 [2018-11-18 15:42:39,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:39,274 INFO L225 Difference]: With dead ends: 255 [2018-11-18 15:42:39,274 INFO L226 Difference]: Without dead ends: 224 [2018-11-18 15:42:39,275 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 133.8s TimeCoverageRelationStatistics Valid=240, Invalid=2144, Unknown=66, NotChecked=0, Total=2450 [2018-11-18 15:42:39,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-11-18 15:42:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 173. [2018-11-18 15:42:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-18 15:42:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 211 transitions. [2018-11-18 15:42:39,294 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 211 transitions. Word has length 41 [2018-11-18 15:42:39,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:39,295 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 211 transitions. [2018-11-18 15:42:39,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 15:42:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 211 transitions. [2018-11-18 15:42:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 15:42:39,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:39,296 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:39,296 INFO L423 AbstractCegarLoop]: === Iteration 13 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:39,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:39,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1283269471, now seen corresponding path program 1 times [2018-11-18 15:42:39,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:42:39,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:42:39,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:39,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:42:39,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:42:39,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:42:39,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:42:39,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-18 15:42:39,442 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:42:39,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 15:42:39,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:42:39,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:42:39,443 INFO L87 Difference]: Start difference. First operand 173 states and 211 transitions. Second operand 11 states. [2018-11-18 15:42:39,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:39,761 INFO L93 Difference]: Finished difference Result 203 states and 246 transitions. [2018-11-18 15:42:39,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 15:42:39,762 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-11-18 15:42:39,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:39,764 INFO L225 Difference]: With dead ends: 203 [2018-11-18 15:42:39,764 INFO L226 Difference]: Without dead ends: 201 [2018-11-18 15:42:39,764 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-11-18 15:42:39,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-18 15:42:39,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 188. [2018-11-18 15:42:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-18 15:42:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 230 transitions. [2018-11-18 15:42:39,778 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 230 transitions. Word has length 43 [2018-11-18 15:42:39,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:39,778 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 230 transitions. [2018-11-18 15:42:39,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 15:42:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 230 transitions. [2018-11-18 15:42:39,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 15:42:39,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:39,779 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:39,779 INFO L423 AbstractCegarLoop]: === Iteration 14 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:39,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:39,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1283267549, now seen corresponding path program 1 times [2018-11-18 15:42:39,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:42:39,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:42:39,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:39,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:42:39,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:42:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:42:39,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:42:39,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-18 15:42:39,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:42:39,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 15:42:39,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 15:42:39,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:42:39,919 INFO L87 Difference]: Start difference. First operand 188 states and 230 transitions. Second operand 13 states. [2018-11-18 15:42:40,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:40,173 INFO L93 Difference]: Finished difference Result 236 states and 291 transitions. [2018-11-18 15:42:40,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 15:42:40,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-11-18 15:42:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:40,174 INFO L225 Difference]: With dead ends: 236 [2018-11-18 15:42:40,175 INFO L226 Difference]: Without dead ends: 228 [2018-11-18 15:42:40,175 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-11-18 15:42:40,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-11-18 15:42:40,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 212. [2018-11-18 15:42:40,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-11-18 15:42:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 262 transitions. [2018-11-18 15:42:40,189 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 262 transitions. Word has length 43 [2018-11-18 15:42:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:40,189 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 262 transitions. [2018-11-18 15:42:40,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 15:42:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 262 transitions. [2018-11-18 15:42:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 15:42:40,190 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:40,190 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:40,191 INFO L423 AbstractCegarLoop]: === Iteration 15 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:40,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:40,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1008507935, now seen corresponding path program 1 times [2018-11-18 15:42:40,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:42:40,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:42:40,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:40,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:42:40,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:42:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:42:40,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:42:40,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:42:40,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:42:40,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:42:40,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:42:40,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:42:40,265 INFO L87 Difference]: Start difference. First operand 212 states and 262 transitions. Second operand 7 states. [2018-11-18 15:42:40,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:40,328 INFO L93 Difference]: Finished difference Result 344 states and 418 transitions. [2018-11-18 15:42:40,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:42:40,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2018-11-18 15:42:40,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:40,330 INFO L225 Difference]: With dead ends: 344 [2018-11-18 15:42:40,330 INFO L226 Difference]: Without dead ends: 191 [2018-11-18 15:42:40,331 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:42:40,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-18 15:42:40,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2018-11-18 15:42:40,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-11-18 15:42:40,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 227 transitions. [2018-11-18 15:42:40,343 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 227 transitions. Word has length 43 [2018-11-18 15:42:40,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:40,343 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 227 transitions. [2018-11-18 15:42:40,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:42:40,343 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 227 transitions. [2018-11-18 15:42:40,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 15:42:40,344 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:40,344 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:40,345 INFO L423 AbstractCegarLoop]: === Iteration 16 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:40,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:40,345 INFO L82 PathProgramCache]: Analyzing trace with hash 273882728, now seen corresponding path program 1 times [2018-11-18 15:42:40,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:42:40,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:42:40,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:40,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:42:40,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:42:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:40,918 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-11-18 15:42:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:42:41,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:42:41,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:42:41,091 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-11-18 15:42:41,091 INFO L202 CegarAbsIntRunner]: [0], [3], [5], [7], [8], [9], [13], [18], [23], [27], [28], [40], [41], [42], [46], [48], [51], [53], [55], [58], [61], [63], [77], [79], [83], [89], [90], [125], [126], [127], [128], [133], [137], [138], [139] [2018-11-18 15:42:41,092 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:42:41,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:42:41,127 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:42:41,127 INFO L272 AbstractInterpreter]: Visited 35 different actions 36 times. Merged at 1 different actions 1 times. Never widened. Performed 335 root evaluator evaluations with a maximum evaluation depth of 5. Performed 335 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 3 different actions. Largest state had 34 variables. [2018-11-18 15:42:41,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:41,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:42:41,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:42:41,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:42:41,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:41,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:42:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:41,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:42:41,223 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 21 treesize of output 17 [2018-11-18 15:42:41,224 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 17 treesize of output 5 [2018-11-18 15:42:41,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:41,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:41,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:41,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:9 [2018-11-18 15:42:41,477 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2018-11-18 15:42:41,497 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 66 [2018-11-18 15:42:41,560 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 15:42:41,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:41,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 53 [2018-11-18 15:42:41,709 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2018-11-18 15:42:41,716 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 19 [2018-11-18 15:42:41,716 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:41,739 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:41,876 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-11-18 15:42:41,885 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 19 [2018-11-18 15:42:41,885 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:41,905 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:42,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-11-18 15:42:42,045 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 7 [2018-11-18 15:42:42,045 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:42,057 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:42,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 48 [2018-11-18 15:42:42,201 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-11-18 15:42:42,202 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:42:42,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 44 [2018-11-18 15:42:42,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 40 [2018-11-18 15:42:42,304 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:42,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 43 [2018-11-18 15:42:42,366 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:42,434 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:42:42,543 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-18 15:42:42,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 51 [2018-11-18 15:42:42,771 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 40 treesize of output 30 [2018-11-18 15:42:42,772 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:42,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 45 [2018-11-18 15:42:42,857 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 3 xjuncts. [2018-11-18 15:42:42,935 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 15:42:43,014 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 15:42:43,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 69 [2018-11-18 15:42:43,076 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 60 treesize of output 57 [2018-11-18 15:42:43,076 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:43,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 74 [2018-11-18 15:42:43,314 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 3 xjuncts. [2018-11-18 15:42:43,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-11-18 15:42:43,712 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:42:43,714 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_103 term size 23 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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) [2018-11-18 15:42:43,720 INFO L168 Benchmark]: Toolchain (without parser) took 491941.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.5 MB). Free memory was 951.1 MB in the beginning and 953.8 MB in the end (delta: -2.7 MB). Peak memory consumption was 234.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:42:43,721 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:42:43,721 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -205.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2018-11-18 15:42:43,722 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 15:42:43,722 INFO L168 Benchmark]: Boogie Preprocessor took 35.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:42:43,723 INFO L168 Benchmark]: RCFGBuilder took 435.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:42:43,723 INFO L168 Benchmark]: TraceAbstraction took 491063.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 953.8 MB in the end (delta: 161.1 MB). Peak memory consumption was 226.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:42:43,726 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 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.5 MB). Free memory was 951.1 MB in the beginning and 1.2 GB in the end (delta: -205.9 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 435.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 491063.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 953.8 MB in the end (delta: 161.1 MB). Peak memory consumption was 226.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_103 term size 23 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_103 term size 23: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) 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 15:42:45,078 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:42:45,079 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:42:45,086 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:42:45,086 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:42:45,087 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:42:45,088 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:42:45,089 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:42:45,090 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:42:45,091 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:42:45,091 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:42:45,091 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:42:45,092 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:42:45,093 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:42:45,094 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:42:45,094 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:42:45,095 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:42:45,096 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:42:45,098 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:42:45,099 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:42:45,099 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:42:45,100 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:42:45,102 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:42:45,102 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:42:45,102 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:42:45,103 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:42:45,104 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:42:45,104 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:42:45,105 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:42:45,105 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:42:45,106 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:42:45,106 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:42:45,106 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:42:45,106 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:42:45,107 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:42:45,108 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:42:45,108 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-18 15:42:45,117 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:42:45,118 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:42:45,118 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:42:45,118 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 15:42:45,118 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 15:42:45,119 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 15:42:45,119 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 15:42:45,119 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 15:42:45,119 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 15:42:45,119 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 15:42:45,119 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:42:45,119 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:42:45,120 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:42:45,120 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:42:45,120 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:42:45,120 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:42:45,120 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:42:45,120 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 15:42:45,120 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 15:42:45,121 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:42:45,121 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:42:45,121 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:42:45,121 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:42:45,122 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:42:45,122 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:42:45,122 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:42:45,123 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:42:45,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:42:45,123 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:42:45,123 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:42:45,123 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:42:45,123 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 15:42:45,123 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:42:45,123 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 15:42:45,124 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 15:42:45,124 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_459663ea-0320-4ab6-8989-2ff55fdabbca/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 -> 2ec1c4691200cd1b12315d54c84be55eae1c29c8 [2018-11-18 15:42:45,150 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:42:45,158 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:42:45,160 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:42:45,161 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:42:45,161 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:42:45,162 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-11-18 15:42:45,195 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/data/291b29b6a/3fa7481a18c04565a20399f64d370634/FLAG819f01bb2 [2018-11-18 15:42:45,527 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:42:45,527 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-11-18 15:42:45,536 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/data/291b29b6a/3fa7481a18c04565a20399f64d370634/FLAG819f01bb2 [2018-11-18 15:42:45,544 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/data/291b29b6a/3fa7481a18c04565a20399f64d370634 [2018-11-18 15:42:45,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:42:45,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:42:45,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:42:45,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:42:45,550 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:42:45,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:42:45" (1/1) ... [2018-11-18 15:42:45,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@394b89b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:42:45, skipping insertion in model container [2018-11-18 15:42:45,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:42:45" (1/1) ... [2018-11-18 15:42:45,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:42:45,583 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:42:45,788 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:42:45,796 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:42:45,837 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:42:45,928 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:42:45,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:42:45 WrapperNode [2018-11-18 15:42:45,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:42:45,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:42:45,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:42:45,929 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:42:45,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:42:45" (1/1) ... [2018-11-18 15:42:45,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:42:45" (1/1) ... [2018-11-18 15:42:45,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:42:45,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:42:45,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:42:45,957 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:42:45,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:42:45" (1/1) ... [2018-11-18 15:42:45,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:42:45" (1/1) ... [2018-11-18 15:42:45,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:42:45" (1/1) ... [2018-11-18 15:42:45,967 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:42:45" (1/1) ... [2018-11-18 15:42:45,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:42:45" (1/1) ... [2018-11-18 15:42:45,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:42:45" (1/1) ... [2018-11-18 15:42:45,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:42:45" (1/1) ... [2018-11-18 15:42:45,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:42:45,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:42:45,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:42:45,991 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:42:45,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:42:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/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 15:42:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:42:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 15:42:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 15:42:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure receive [2018-11-18 15:42:46,033 INFO L138 BoogieDeclarations]: Found implementation of procedure receive [2018-11-18 15:42:46,033 INFO L130 BoogieDeclarations]: Found specification of procedure process_prio_queue [2018-11-18 15:42:46,033 INFO L138 BoogieDeclarations]: Found implementation of procedure process_prio_queue [2018-11-18 15:42:46,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:42:46,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:42:46,033 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2018-11-18 15:42:46,033 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2018-11-18 15:42:46,033 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:42:46,033 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:42:46,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 15:42:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 15:42:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2018-11-18 15:42:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure send [2018-11-18 15:42:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 15:42:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 15:42:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure process_normal_queue [2018-11-18 15:42:46,034 INFO L138 BoogieDeclarations]: Found implementation of procedure process_normal_queue [2018-11-18 15:42:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:42:46,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:42:46,722 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:42:46,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:42:46 BoogieIcfgContainer [2018-11-18 15:42:46,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:42:46,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:42:46,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:42:46,724 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:42:46,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:42:45" (1/3) ... [2018-11-18 15:42:46,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0643c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:42:46, skipping insertion in model container [2018-11-18 15:42:46,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:42:45" (2/3) ... [2018-11-18 15:42:46,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0643c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:42:46, skipping insertion in model container [2018-11-18 15:42:46,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:42:46" (3/3) ... [2018-11-18 15:42:46,726 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter_true-unreach-call.i [2018-11-18 15:42:46,731 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:42:46,737 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-18 15:42:46,747 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-18 15:42:46,765 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:42:46,766 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:42:46,766 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:42:46,766 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:42:46,766 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:42:46,766 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:42:46,766 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:42:46,766 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:42:46,766 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:42:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-11-18 15:42:46,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 15:42:46,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:46,779 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:46,781 INFO L423 AbstractCegarLoop]: === Iteration 1 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:46,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1784137175, now seen corresponding path program 1 times [2018-11-18 15:42:46,786 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:42:46,787 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/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 15:42:46,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:46,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:42:46,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:42:46,848 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:42:46,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:42:46,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:42:46,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 15:42:46,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 15:42:46,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:42:46,861 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-11-18 15:42:46,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:46,876 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2018-11-18 15:42:46,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:42:46,877 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-18 15:42:46,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:46,885 INFO L225 Difference]: With dead ends: 90 [2018-11-18 15:42:46,886 INFO L226 Difference]: Without dead ends: 52 [2018-11-18 15:42:46,888 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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 15:42:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-18 15:42:46,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-18 15:42:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 15:42:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-11-18 15:42:46,922 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 15 [2018-11-18 15:42:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:46,923 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-11-18 15:42:46,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 15:42:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-11-18 15:42:46,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 15:42:46,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:46,924 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:46,924 INFO L423 AbstractCegarLoop]: === Iteration 2 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:46,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:46,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1050185151, now seen corresponding path program 1 times [2018-11-18 15:42:46,925 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:42:46,926 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/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 15:42:46,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:46,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:42:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:42:46,965 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:42:46,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:42:46,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:42:46,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 15:42:46,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:42:46,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:42:46,971 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 3 states. [2018-11-18 15:42:46,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:46,984 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-11-18 15:42:46,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:42:46,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 15:42:46,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:46,986 INFO L225 Difference]: With dead ends: 55 [2018-11-18 15:42:46,986 INFO L226 Difference]: Without dead ends: 53 [2018-11-18 15:42:46,987 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 15:42:46,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-18 15:42:46,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-18 15:42:46,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 15:42:46,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-11-18 15:42:46,996 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 16 [2018-11-18 15:42:46,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:46,996 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-18 15:42:46,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 15:42:46,996 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-11-18 15:42:46,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 15:42:46,997 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:46,997 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:46,997 INFO L423 AbstractCegarLoop]: === Iteration 3 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:46,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:46,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1050187073, now seen corresponding path program 1 times [2018-11-18 15:42:46,998 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:42:46,998 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/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 15:42:47,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:47,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:42:47,158 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 15:42:47,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:47,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:42:47,258 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 15:42:47,258 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:47,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 15:42:47,312 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 15:42:47,312 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:47,325 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:47,339 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:47,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:42:47,375 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 15:42:47,375 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:47,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 15:42:47,412 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 15:42:47,413 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:47,425 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:47,433 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:47,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:42:47,448 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:63, output treesize:33 [2018-11-18 15:42:47,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 15:42:47,483 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 15:42:47,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:47,493 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 15:42:47,493 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:47,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:47,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 15:42:47,517 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 15:42:47,517 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:47,525 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 15:42:47,525 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:47,528 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:47,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:47,534 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:47, output treesize:7 [2018-11-18 15:42:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:42:47,566 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:42:47,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:42:47,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:42:47,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 15:42:47,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:42:47,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:42:47,569 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-11-18 15:42:48,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:48,068 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2018-11-18 15:42:48,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:42:48,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-18 15:42:48,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:48,071 INFO L225 Difference]: With dead ends: 87 [2018-11-18 15:42:48,071 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 15:42:48,072 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:42:48,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 15:42:48,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-11-18 15:42:48,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 15:42:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2018-11-18 15:42:48,081 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 16 [2018-11-18 15:42:48,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:48,081 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-11-18 15:42:48,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 15:42:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2018-11-18 15:42:48,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 15:42:48,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:48,082 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:48,083 INFO L423 AbstractCegarLoop]: === Iteration 4 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:48,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:48,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1563150643, now seen corresponding path program 1 times [2018-11-18 15:42:48,083 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:42:48,083 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/cvc4nyu Starting monitored process 5 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 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:42:48,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:48,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:42:48,183 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:42:48,194 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 15:42:48,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:48,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-18 15:42:48,286 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 17 treesize of output 18 [2018-11-18 15:42:48,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:48,352 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 16 treesize of output 15 [2018-11-18 15:42:48,353 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:48,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:48,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:48,438 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:42:48,442 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 15:42:48,442 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:48,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-18 15:42:48,490 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 17 treesize of output 18 [2018-11-18 15:42:48,491 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:48,525 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 16 treesize of output 15 [2018-11-18 15:42:48,525 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:48,550 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:48,555 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:48,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:42:48,564 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2018-11-18 15:42:48,596 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 15:42:48,598 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 15:42:48,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:48,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:48,606 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 15:42:48,608 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 15:42:48,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:48,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:48,613 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 15:42:48,614 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-11-18 15:42:48,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:42:48,640 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:42:48,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:42:48,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:42:48,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:42:48,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:42:48,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:42:48,647 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand 7 states. [2018-11-18 15:42:54,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:42:54,838 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2018-11-18 15:42:54,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:42:54,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-11-18 15:42:54,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:42:54,839 INFO L225 Difference]: With dead ends: 76 [2018-11-18 15:42:54,839 INFO L226 Difference]: Without dead ends: 56 [2018-11-18 15:42:54,840 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-18 15:42:54,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-18 15:42:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-18 15:42:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-18 15:42:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-11-18 15:42:54,845 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 23 [2018-11-18 15:42:54,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:42:54,845 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-11-18 15:42:54,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:42:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-11-18 15:42:54,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 15:42:54,846 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:42:54,846 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:42:54,847 INFO L423 AbstractCegarLoop]: === Iteration 5 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:42:54,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:42:54,847 INFO L82 PathProgramCache]: Analyzing trace with hash 2054790292, now seen corresponding path program 1 times [2018-11-18 15:42:54,847 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:42:54,847 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/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 15:42:54,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:42:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:42:54,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:42:55,036 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-18 15:42:55,051 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:42:55,052 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-18 15:42:55,061 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 23 treesize of output 15 [2018-11-18 15:42:55,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:55,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:55,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:42:55,227 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 15:42:55,227 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:55,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 15:42:55,276 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 15:42:55,276 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:55,289 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:55,300 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:55,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:42:55,341 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 15:42:55,342 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:55,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 15:42:55,360 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 15:42:55,361 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:55,367 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:55,372 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:55,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:42:55,386 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:43 [2018-11-18 15:42:55,413 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:42:55,416 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:42:55,419 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:42:55,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-11-18 15:42:55,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:55,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-18 15:42:55,519 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 15:42:55,519 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:55,538 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:55,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-18 15:42:55,603 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 15:42:55,604 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:55,617 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:55,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:42:55,660 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:84, output treesize:77 [2018-11-18 15:42:57,744 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_receive_~#packet~0.base_4| (_ BitVec 32)) (|v_receive_#t~ret5.base_4| (_ BitVec 32)) (|v_receive_#t~ret5.offset_4| (_ BitVec 32)) (|v_receive_~#packet~0.offset_4| (_ BitVec 32))) (let ((.cse0 (bvadd |v_receive_~#packet~0.offset_4| (_ bv8 32)))) (and (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4| (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4|) .cse0 |v_receive_#t~ret5.offset_4|)) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| |v_receive_~#packet~0.base_4|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4| (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4|) .cse0 |v_receive_#t~ret5.base_4|)))))) is different from true [2018-11-18 15:42:57,762 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:42:57,765 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:42:57,767 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:42:57,768 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:42:57,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-18 15:42:57,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:57,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-11-18 15:42:57,940 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 15:42:57,940 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:57,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:58,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-11-18 15:42:58,095 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 15:42:58,095 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:58,124 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:58,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:42:58,196 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:108, output treesize:59 [2018-11-18 15:42:58,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-11-18 15:42:58,282 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 9 [2018-11-18 15:42:58,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:58,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:58,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-11-18 15:42:58,393 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 9 [2018-11-18 15:42:58,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:58,413 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:58,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:42:58,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:85, output treesize:33 [2018-11-18 15:42:58,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 15:42:58,486 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 15:42:58,486 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:58,495 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 15:42:58,496 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:58,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:58,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 15:42:58,516 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 15:42:58,517 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:58,523 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 15:42:58,523 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:42:58,525 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:58,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:42:58,530 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:47, output treesize:7 [2018-11-18 15:42:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:42:58,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:43:12,605 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification that was a NOOP. DAG size: 50 [2018-11-18 15:43:12,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:43:12,607 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:43:12,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:43:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:43:12,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:43:12,753 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:43:12,753 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-18 15:43:12,762 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 23 treesize of output 15 [2018-11-18 15:43:12,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:12,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:12,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:43:12,938 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 15:43:12,938 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:12,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 15:43:12,991 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 15:43:12,991 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:13,004 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:13,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:13,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:43:13,053 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 15:43:13,054 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:13,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 15:43:13,070 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 15:43:13,070 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:13,076 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:13,082 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:13,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:43:13,099 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:43 [2018-11-18 15:43:13,125 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:43:13,142 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:43:13,147 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:43:13,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2018-11-18 15:43:13,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:13,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-18 15:43:13,277 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 15:43:13,278 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:13,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:13,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-11-18 15:43:13,360 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 15:43:13,360 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:13,376 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:13,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:43:13,413 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:84, output treesize:77 [2018-11-18 15:43:15,434 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_receive_~#packet~0.base_11| (_ BitVec 32)) (|v_receive_#t~ret5.base_11| (_ BitVec 32)) (|v_receive_~#packet~0.offset_11| (_ BitVec 32)) (|v_receive_#t~ret5.offset_11| (_ BitVec 32))) (let ((.cse0 (bvadd |v_receive_~#packet~0.offset_11| (_ bv8 32)))) (and (= (select |c_old(#valid)| |v_receive_~#packet~0.base_11|) (_ bv0 1)) (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_11| (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_11|) .cse0 |v_receive_#t~ret5.offset_11|)) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_11| (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_11|) .cse0 |v_receive_#t~ret5.base_11|)))))) is different from true [2018-11-18 15:43:15,447 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:43:15,450 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:43:15,452 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:43:15,453 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:43:15,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-18 15:43:15,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:15,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-11-18 15:43:15,611 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 15:43:15,611 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:15,643 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:15,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 58 [2018-11-18 15:43:15,758 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 15:43:15,758 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:15,788 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:15,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:43:15,858 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:108, output treesize:59 [2018-11-18 15:43:15,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-11-18 15:43:15,914 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 9 [2018-11-18 15:43:15,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:15,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:16,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-11-18 15:43:16,016 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 9 [2018-11-18 15:43:16,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:16,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:16,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:43:16,073 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:85, output treesize:33 [2018-11-18 15:43:16,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 15:43:16,091 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 15:43:16,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:16,099 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 15:43:16,099 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:16,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:16,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 15:43:16,117 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 15:43:16,117 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:16,123 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 15:43:16,124 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:16,125 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:16,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:16,130 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:47, output treesize:7 [2018-11-18 15:43:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:43:16,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:43:32,123 WARN L180 SmtUtils]: Spent 2.20 s on a formula simplification that was a NOOP. DAG size: 50 [2018-11-18 15:43:32,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:43:32,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 15:43:32,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 15:43:32,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 15:43:32,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=161, Unknown=12, NotChecked=54, Total=272 [2018-11-18 15:43:32,140 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 13 states. [2018-11-18 15:43:34,377 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_receive_~#packet~0.base_11| (_ BitVec 32)) (|v_receive_#t~ret5.base_11| (_ BitVec 32)) (|v_receive_~#packet~0.offset_11| (_ BitVec 32)) (|v_receive_#t~ret5.offset_11| (_ BitVec 32))) (let ((.cse0 (bvadd |v_receive_~#packet~0.offset_11| (_ bv8 32)))) (and (= (select |c_old(#valid)| |v_receive_~#packet~0.base_11|) (_ bv0 1)) (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_11| (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_11|) .cse0 |v_receive_#t~ret5.offset_11|)) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_11| (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_11|) .cse0 |v_receive_#t~ret5.base_11|)))))) (exists ((|v_receive_~#packet~0.base_4| (_ BitVec 32)) (|v_receive_#t~ret5.base_4| (_ BitVec 32)) (|v_receive_#t~ret5.offset_4| (_ BitVec 32)) (|v_receive_~#packet~0.offset_4| (_ BitVec 32))) (let ((.cse1 (bvadd |v_receive_~#packet~0.offset_4| (_ bv8 32)))) (and (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4| (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4|) .cse1 |v_receive_#t~ret5.offset_4|)) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| |v_receive_~#packet~0.base_4|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4| (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4|) .cse1 |v_receive_#t~ret5.base_4|))))))) is different from true [2018-11-18 15:43:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:43:40,094 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2018-11-18 15:43:40,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 15:43:40,094 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-18 15:43:40,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:43:40,095 INFO L225 Difference]: With dead ends: 98 [2018-11-18 15:43:40,095 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 15:43:40,096 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=67, Invalid=274, Unknown=13, NotChecked=108, Total=462 [2018-11-18 15:43:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 15:43:40,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2018-11-18 15:43:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-18 15:43:40,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2018-11-18 15:43:40,105 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 27 [2018-11-18 15:43:40,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:43:40,106 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2018-11-18 15:43:40,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 15:43:40,106 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2018-11-18 15:43:40,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 15:43:40,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:43:40,107 INFO L375 BasicCegarLoop]: trace histogram [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 15:43:40,107 INFO L423 AbstractCegarLoop]: === Iteration 6 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:43:40,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:43:40,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1614085989, now seen corresponding path program 1 times [2018-11-18 15:43:40,107 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:43:40,108 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/bin-2019/utaipan/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:43:40,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:43:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:43:40,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:43:40,198 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 15:43:40,200 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 15:43:40,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:40,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:40,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:43:40,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-18 15:43:40,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 42 [2018-11-18 15:43:40,284 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-11-18 15:43:40,289 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:43:40,293 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 22 treesize of output 29 [2018-11-18 15:43:40,293 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:40,309 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:40,377 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 32 [2018-11-18 15:43:40,382 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:43:40,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 35 [2018-11-18 15:43:40,389 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:40,428 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:43:40,430 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 24 treesize of output 31 [2018-11-18 15:43:40,430 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:40,461 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:43:40,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:43:40,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-18 15:43:40,520 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:32, output treesize:35 [2018-11-18 15:43:40,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2018-11-18 15:43:40,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 30 treesize of output 19 [2018-11-18 15:43:40,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:40,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 3 [2018-11-18 15:43:40,583 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:40,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:40,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:40,589 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:34, output treesize:3 [2018-11-18 15:43:40,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:43:40,598 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 15:43:40,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:43:40,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 15:43:40,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 15:43:40,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:43:40,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:43:40,601 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 7 states. [2018-11-18 15:43:42,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:43:42,178 INFO L93 Difference]: Finished difference Result 128 states and 158 transitions. [2018-11-18 15:43:42,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:43:42,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-18 15:43:42,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:43:42,179 INFO L225 Difference]: With dead ends: 128 [2018-11-18 15:43:42,179 INFO L226 Difference]: Without dead ends: 81 [2018-11-18 15:43:42,180 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:43:42,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-18 15:43:42,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2018-11-18 15:43:42,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-18 15:43:42,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2018-11-18 15:43:42,188 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 33 [2018-11-18 15:43:42,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:43:42,188 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2018-11-18 15:43:42,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 15:43:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2018-11-18 15:43:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 15:43:42,189 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:43:42,189 INFO L375 BasicCegarLoop]: trace histogram [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 15:43:42,189 INFO L423 AbstractCegarLoop]: === Iteration 7 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:43:42,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:43:42,190 INFO L82 PathProgramCache]: Analyzing trace with hash -191352345, now seen corresponding path program 1 times [2018-11-18 15:43:42,190 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 15:43:42,190 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_459663ea-0320-4ab6-8989-2ff55fdabbca/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 15:43:42,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:43:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:43:42,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:43:42,295 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 21 treesize of output 17 [2018-11-18 15:43:42,297 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 17 treesize of output 5 [2018-11-18 15:43:42,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:42,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:42,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:43:42,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:9 [2018-11-18 15:43:49,273 WARN L180 SmtUtils]: Spent 6.96 s on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2018-11-18 15:43:49,705 INFO L303 Elim1Store]: Index analysis took 431 ms [2018-11-18 15:43:49,706 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 66 [2018-11-18 15:43:50,169 WARN L180 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2018-11-18 15:43:50,541 INFO L303 Elim1Store]: Index analysis took 371 ms [2018-11-18 15:43:50,541 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 15:43:50,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:55,567 INFO L303 Elim1Store]: Index analysis took 2324 ms [2018-11-18 15:43:55,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 69 [2018-11-18 15:43:55,718 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 60 treesize of output 57 [2018-11-18 15:43:55,718 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:43:59,776 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 15:43:59,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2018-11-18 15:43:59,778 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:44:04,030 INFO L303 Elim1Store]: Index analysis took 372 ms [2018-11-18 15:44:04,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 54 [2018-11-18 15:44:04,558 WARN L180 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2018-11-18 15:44:04,836 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 15:44:04,836 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_56 term size 26 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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) [2018-11-18 15:44:04,839 INFO L168 Benchmark]: Toolchain (without parser) took 79292.75 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 286.3 MB). Free memory was 943.3 MB in the beginning and 1.2 GB in the end (delta: -306.5 MB). Peak memory consumption was 358.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:44:04,839 INFO L168 Benchmark]: CDTParser took 0.11 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 15:44:04,839 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -192.3 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2018-11-18 15:44:04,840 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:44:04,840 INFO L168 Benchmark]: Boogie Preprocessor took 34.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:44:04,840 INFO L168 Benchmark]: RCFGBuilder took 731.04 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: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:44:04,840 INFO L168 Benchmark]: TraceAbstraction took 78115.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 143.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -156.0 MB). Peak memory consumption was 365.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:44:04,842 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 381.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -192.3 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 731.04 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: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 78115.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 143.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -156.0 MB). Peak memory consumption was 365.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_56 term size 26 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_56 term size 26: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...