./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/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_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/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 9a4ddf68ce78594ceb913525b55d91f3f2dce46f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/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_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/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 9a4ddf68ce78594ceb913525b55d91f3f2dce46f .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_27 input size 11 context size 11 output size 11 --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 10:53:37,708 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 10:53:37,709 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 10:53:37,715 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 10:53:37,715 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 10:53:37,716 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 10:53:37,717 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 10:53:37,718 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 10:53:37,719 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 10:53:37,719 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 10:53:37,720 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 10:53:37,720 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 10:53:37,720 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 10:53:37,721 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 10:53:37,722 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 10:53:37,722 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 10:53:37,723 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 10:53:37,724 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 10:53:37,725 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 10:53:37,725 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 10:53:37,726 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 10:53:37,727 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 10:53:37,728 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 10:53:37,728 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 10:53:37,728 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 10:53:37,729 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 10:53:37,729 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 10:53:37,730 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 10:53:37,730 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 10:53:37,731 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 10:53:37,731 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 10:53:37,732 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 10:53:37,732 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 10:53:37,732 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 10:53:37,732 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 10:53:37,733 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 10:53:37,733 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 10:53:37,741 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 10:53:37,741 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 10:53:37,741 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 10:53:37,741 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 10:53:37,742 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 10:53:37,742 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 10:53:37,742 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 10:53:37,742 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 10:53:37,742 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 10:53:37,742 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 10:53:37,742 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 10:53:37,743 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 10:53:37,743 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 10:53:37,743 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 10:53:37,743 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 10:53:37,743 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 10:53:37,744 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 10:53:37,744 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 10:53:37,744 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 10:53:37,744 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 10:53:37,744 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 10:53:37,744 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 10:53:37,744 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 10:53:37,744 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 10:53:37,745 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 10:53:37,745 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 10:53:37,745 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 10:53:37,745 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 10:53:37,745 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 10:53:37,745 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 10:53:37,745 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 10:53:37,745 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 10:53:37,746 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 10:53:37,746 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 10:53:37,746 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 10:53:37,746 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 10:53:37,746 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_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/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 -> 9a4ddf68ce78594ceb913525b55d91f3f2dce46f [2018-12-02 10:53:37,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 10:53:37,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 10:53:37,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 10:53:37,773 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 10:53:37,773 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 10:53:37,774 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-12-02 10:53:37,809 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/data/c32dfc097/e56e26a87d3949759481e079492a9abc/FLAGe955cda9d [2018-12-02 10:53:38,293 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 10:53:38,294 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-12-02 10:53:38,300 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/data/c32dfc097/e56e26a87d3949759481e079492a9abc/FLAGe955cda9d [2018-12-02 10:53:38,308 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/data/c32dfc097/e56e26a87d3949759481e079492a9abc [2018-12-02 10:53:38,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 10:53:38,310 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 10:53:38,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 10:53:38,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 10:53:38,313 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 10:53:38,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:53:38" (1/1) ... [2018-12-02 10:53:38,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3f717e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:53:38, skipping insertion in model container [2018-12-02 10:53:38,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:53:38" (1/1) ... [2018-12-02 10:53:38,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 10:53:38,344 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 10:53:38,502 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 10:53:38,542 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 10:53:38,569 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 10:53:38,591 INFO L195 MainTranslator]: Completed translation [2018-12-02 10:53:38,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:53:38 WrapperNode [2018-12-02 10:53:38,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 10:53:38,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 10:53:38,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 10:53:38,592 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 10:53:38,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:53:38" (1/1) ... [2018-12-02 10:53:38,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:53:38" (1/1) ... [2018-12-02 10:53:38,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 10:53:38,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 10:53:38,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 10:53:38,610 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 10:53:38,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:53:38" (1/1) ... [2018-12-02 10:53:38,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:53:38" (1/1) ... [2018-12-02 10:53:38,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:53:38" (1/1) ... [2018-12-02 10:53:38,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:53:38" (1/1) ... [2018-12-02 10:53:38,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:53:38" (1/1) ... [2018-12-02 10:53:38,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:53:38" (1/1) ... [2018-12-02 10:53:38,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:53:38" (1/1) ... [2018-12-02 10:53:38,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 10:53:38,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 10:53:38,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 10:53:38,634 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 10:53:38,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:53:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 10:53:38,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 10:53:38,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 10:53:38,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 10:53:38,666 INFO L130 BoogieDeclarations]: Found specification of procedure receive [2018-12-02 10:53:38,666 INFO L138 BoogieDeclarations]: Found implementation of procedure receive [2018-12-02 10:53:38,666 INFO L130 BoogieDeclarations]: Found specification of procedure process_prio_queue [2018-12-02 10:53:38,666 INFO L138 BoogieDeclarations]: Found implementation of procedure process_prio_queue [2018-12-02 10:53:38,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 10:53:38,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 10:53:38,666 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2018-12-02 10:53:38,666 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2018-12-02 10:53:38,666 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 10:53:38,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 10:53:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 10:53:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 10:53:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2018-12-02 10:53:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure send [2018-12-02 10:53:38,667 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2018-12-02 10:53:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 10:53:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 10:53:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure process_normal_queue [2018-12-02 10:53:38,667 INFO L138 BoogieDeclarations]: Found implementation of procedure process_normal_queue [2018-12-02 10:53:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-02 10:53:38,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 10:53:38,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 10:53:38,921 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 10:53:38,921 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-02 10:53:38,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:53:38 BoogieIcfgContainer [2018-12-02 10:53:38,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 10:53:38,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 10:53:38,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 10:53:38,924 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 10:53:38,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:53:38" (1/3) ... [2018-12-02 10:53:38,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28091b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:53:38, skipping insertion in model container [2018-12-02 10:53:38,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:53:38" (2/3) ... [2018-12-02 10:53:38,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28091b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:53:38, skipping insertion in model container [2018-12-02 10:53:38,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:53:38" (3/3) ... [2018-12-02 10:53:38,926 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter_true-unreach-call.i [2018-12-02 10:53:38,931 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 10:53:38,936 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-02 10:53:38,944 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-02 10:53:38,961 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 10:53:38,962 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 10:53:38,962 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 10:53:38,962 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 10:53:38,962 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 10:53:38,962 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 10:53:38,962 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 10:53:38,962 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 10:53:38,972 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-12-02 10:53:38,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 10:53:38,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:53:38,976 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:53:38,977 INFO L423 AbstractCegarLoop]: === Iteration 1 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:53:38,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:53:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1336356447, now seen corresponding path program 1 times [2018-12-02 10:53:38,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:53:39,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:53:39,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:53:39,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:53:39,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:53:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:53:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:53:39,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:53:39,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 10:53:39,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:53:39,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 10:53:39,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 10:53:39,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 10:53:39,068 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-12-02 10:53:39,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:53:39,082 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2018-12-02 10:53:39,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 10:53:39,083 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-12-02 10:53:39,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:53:39,088 INFO L225 Difference]: With dead ends: 100 [2018-12-02 10:53:39,089 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 10:53:39,090 INFO L631 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-12-02 10:53:39,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 10:53:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-02 10:53:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 10:53:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-12-02 10:53:39,116 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 14 [2018-12-02 10:53:39,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:53:39,116 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-12-02 10:53:39,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 10:53:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-12-02 10:53:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 10:53:39,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:53:39,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:53:39,117 INFO L423 AbstractCegarLoop]: === Iteration 2 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:53:39,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:53:39,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1073629961, now seen corresponding path program 1 times [2018-12-02 10:53:39,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:53:39,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:53:39,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:53:39,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:53:39,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:53:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:53:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:53:39,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:53:39,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 10:53:39,150 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:53:39,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 10:53:39,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 10:53:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 10:53:39,151 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 3 states. [2018-12-02 10:53:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:53:39,163 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-12-02 10:53:39,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 10:53:39,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-02 10:53:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:53:39,164 INFO L225 Difference]: With dead ends: 60 [2018-12-02 10:53:39,164 INFO L226 Difference]: Without dead ends: 58 [2018-12-02 10:53:39,165 INFO L631 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-12-02 10:53:39,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-02 10:53:39,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-02 10:53:39,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 10:53:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2018-12-02 10:53:39,170 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 15 [2018-12-02 10:53:39,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:53:39,170 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-12-02 10:53:39,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 10:53:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-12-02 10:53:39,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-02 10:53:39,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:53:39,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:53:39,171 INFO L423 AbstractCegarLoop]: === Iteration 3 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:53:39,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:53:39,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1073628039, now seen corresponding path program 1 times [2018-12-02 10:53:39,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:53:39,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:53:39,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:53:39,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:53:39,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:53:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:53:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:53:39,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:53:39,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 10:53:39,233 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:53:39,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:53:39,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:53:39,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:53:39,234 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 6 states. [2018-12-02 10:53:39,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:53:39,322 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2018-12-02 10:53:39,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 10:53:39,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-02 10:53:39,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:53:39,324 INFO L225 Difference]: With dead ends: 95 [2018-12-02 10:53:39,324 INFO L226 Difference]: Without dead ends: 68 [2018-12-02 10:53:39,324 INFO L631 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-12-02 10:53:39,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-02 10:53:39,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-12-02 10:53:39,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 10:53:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-12-02 10:53:39,331 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 15 [2018-12-02 10:53:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:53:39,331 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-12-02 10:53:39,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:53:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-12-02 10:53:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 10:53:39,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:53:39,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:53:39,332 INFO L423 AbstractCegarLoop]: === Iteration 4 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:53:39,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:53:39,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1587868396, now seen corresponding path program 1 times [2018-12-02 10:53:39,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:53:39,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:53:39,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:53:39,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:53:39,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:53:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:53:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:53:39,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:53:39,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 10:53:39,413 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 10:53:39,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 10:53:39,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 10:53:39,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:53:39,414 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 7 states. [2018-12-02 10:53:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:53:39,628 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2018-12-02 10:53:39,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 10:53:39,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-02 10:53:39,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:53:39,629 INFO L225 Difference]: With dead ends: 100 [2018-12-02 10:53:39,629 INFO L226 Difference]: Without dead ends: 78 [2018-12-02 10:53:39,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-02 10:53:39,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-02 10:53:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2018-12-02 10:53:39,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-02 10:53:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-12-02 10:53:39,637 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 21 [2018-12-02 10:53:39,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:53:39,637 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-12-02 10:53:39,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 10:53:39,638 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-12-02 10:53:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 10:53:39,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:53:39,638 INFO L402 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] [2018-12-02 10:53:39,638 INFO L423 AbstractCegarLoop]: === Iteration 5 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:53:39,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:53:39,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1982739994, now seen corresponding path program 1 times [2018-12-02 10:53:39,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 10:53:39,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:53:39,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:53:39,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 10:53:39,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 10:53:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:53:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:53:39,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 10:53:39,920 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 10:53:39,921 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-02 10:53:39,922 INFO L205 CegarAbsIntRunner]: [0], [3], [7], [8], [9], [17], [22], [26], [27], [43], [48], [51], [53], [55], [77], [79], [83], [89], [90], [130], [131], [138], [142], [143], [144] [2018-12-02 10:53:39,943 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 10:53:39,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 10:53:40,045 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 10:53:40,045 INFO L272 AbstractInterpreter]: Visited 25 different actions 25 times. Never merged. Never widened. Performed 218 root evaluator evaluations with a maximum evaluation depth of 3. Performed 218 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 29 variables. [2018-12-02 10:53:40,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:53:40,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 10:53:40,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 10:53:40,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 10:53:40,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:53:40,058 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 10:53:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:53:40,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:53:40,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 10:53:40,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 10:53:40,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:40,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:40,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:40,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-12-02 10:53:40,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 10:53:40,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:40,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:40,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2018-12-02 10:53:40,168 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:40,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:40,194 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:40,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:40,213 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:40,216 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:40,228 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:40,231 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:40,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:40,240 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-12-02 10:53:44,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:53:44,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:53:44,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 10:53:44,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-02 10:53:44,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-02 10:53:44,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:53:44,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-02 10:53:44,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:53:44,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:53:44,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:53:44,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-02 10:53:44,340 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,351 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-02 10:53:44,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-02 10:53:44,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:53:44,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-02 10:53:44,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:53:44,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:53:44,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:53:44,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-02 10:53:44,395 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,401 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,407 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,414 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,427 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 11 variables, input treesize:67, output treesize:15 [2018-12-02 10:53:44,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 10:53:44,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 10:53:44,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 10:53:44,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 10:53:44,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-02 10:53:44,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:53:44,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 10:53:44,814 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-12-02 10:53:44,816 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:44,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:44,831 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:44,845 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:44,846 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,859 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:44,861 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:44,874 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:45,217 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:45,227 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:45,228 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:45,237 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:45,238 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:45,248 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:45,249 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:45,258 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:45,564 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:45,577 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:45,578 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:45,591 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:45,592 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:45,602 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:45,874 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:45,890 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:45,891 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:45,903 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:45,904 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:45,918 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:46,239 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,255 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,257 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,267 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,268 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,281 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,282 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,294 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,434 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:46,441 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:46,442 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,452 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,453 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:46,462 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:46,555 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:46,560 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:46,561 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:46,565 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:46,566 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,570 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,571 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:46,575 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:53:46,631 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,635 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,636 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,640 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,641 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,645 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:53:46,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 8 dim-2 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-12-02 10:53:46,694 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 14 variables, input treesize:193, output treesize:158 [2018-12-02 10:53:46,760 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-12-02 10:54:03,518 WARN L180 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 102 [2018-12-02 10:54:03,523 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-12-02 10:54:03,531 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-12-02 10:54:03,665 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2018-12-02 10:54:03,867 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 10:54:03,868 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:217) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-02 10:54:03,873 INFO L168 Benchmark]: Toolchain (without parser) took 25562.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 193.5 MB). Free memory was 954.9 MB in the beginning and 964.9 MB in the end (delta: -10.0 MB). Peak memory consumption was 183.5 MB. Max. memory is 11.5 GB. [2018-12-02 10:54:03,874 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:54:03,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -130.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-02 10:54:03,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-02 10:54:03,876 INFO L168 Benchmark]: Boogie Preprocessor took 23.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:54:03,877 INFO L168 Benchmark]: RCFGBuilder took 287.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. [2018-12-02 10:54:03,877 INFO L168 Benchmark]: TraceAbstraction took 24949.87 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 91.2 MB). Free memory was 1.0 GB in the beginning and 964.9 MB in the end (delta: 76.9 MB). Peak memory consumption was 168.1 MB. Max. memory is 11.5 GB. [2018-12-02 10:54:03,882 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 280.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -130.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.24 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 287.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 36.7 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24949.87 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 91.2 MB). Free memory was 1.0 GB in the beginning and 964.9 MB in the end (delta: 76.9 MB). Peak memory consumption was 168.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 10:54:05,217 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 10:54:05,218 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 10:54:05,224 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 10:54:05,224 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 10:54:05,225 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 10:54:05,225 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 10:54:05,226 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 10:54:05,227 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 10:54:05,227 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 10:54:05,228 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 10:54:05,228 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 10:54:05,228 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 10:54:05,229 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 10:54:05,229 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 10:54:05,229 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 10:54:05,230 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 10:54:05,231 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 10:54:05,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 10:54:05,233 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 10:54:05,234 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 10:54:05,234 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 10:54:05,236 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 10:54:05,236 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 10:54:05,236 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 10:54:05,236 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 10:54:05,237 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 10:54:05,237 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 10:54:05,237 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 10:54:05,238 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 10:54:05,238 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 10:54:05,238 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 10:54:05,238 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 10:54:05,239 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 10:54:05,239 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 10:54:05,239 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 10:54:05,239 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-02 10:54:05,249 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 10:54:05,250 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 10:54:05,250 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 10:54:05,250 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 10:54:05,251 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 10:54:05,251 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 10:54:05,251 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 10:54:05,251 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 10:54:05,251 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 10:54:05,251 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 10:54:05,252 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 10:54:05,252 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 10:54:05,252 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 10:54:05,252 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 10:54:05,253 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 10:54:05,253 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 10:54:05,253 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 10:54:05,253 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 10:54:05,253 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 10:54:05,253 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 10:54:05,254 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 10:54:05,254 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 10:54:05,254 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 10:54:05,254 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 10:54:05,254 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 10:54:05,254 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 10:54:05,254 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 10:54:05,255 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 10:54:05,255 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 10:54:05,255 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 10:54:05,255 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 10:54:05,255 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 10:54:05,255 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 10:54:05,256 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 10:54:05,256 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 10:54:05,256 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_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/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 -> 9a4ddf68ce78594ceb913525b55d91f3f2dce46f [2018-12-02 10:54:05,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 10:54:05,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 10:54:05,288 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 10:54:05,289 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 10:54:05,289 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 10:54:05,289 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-12-02 10:54:05,323 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/data/41bfa8d9d/35cc205d303542c5aa4ca353c59cbbd6/FLAG0675280d3 [2018-12-02 10:54:05,735 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 10:54:05,736 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-12-02 10:54:05,742 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/data/41bfa8d9d/35cc205d303542c5aa4ca353c59cbbd6/FLAG0675280d3 [2018-12-02 10:54:05,750 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/data/41bfa8d9d/35cc205d303542c5aa4ca353c59cbbd6 [2018-12-02 10:54:05,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 10:54:05,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 10:54:05,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 10:54:05,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 10:54:05,756 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 10:54:05,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:54:05" (1/1) ... [2018-12-02 10:54:05,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c3d0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:54:05, skipping insertion in model container [2018-12-02 10:54:05,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:54:05" (1/1) ... [2018-12-02 10:54:05,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 10:54:05,781 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 10:54:05,938 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 10:54:05,945 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 10:54:06,013 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 10:54:06,036 INFO L195 MainTranslator]: Completed translation [2018-12-02 10:54:06,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:54:06 WrapperNode [2018-12-02 10:54:06,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 10:54:06,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 10:54:06,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 10:54:06,038 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 10:54:06,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:54:06" (1/1) ... [2018-12-02 10:54:06,052 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:54:06" (1/1) ... [2018-12-02 10:54:06,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 10:54:06,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 10:54:06,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 10:54:06,057 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 10:54:06,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:54:06" (1/1) ... [2018-12-02 10:54:06,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:54:06" (1/1) ... [2018-12-02 10:54:06,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:54:06" (1/1) ... [2018-12-02 10:54:06,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:54:06" (1/1) ... [2018-12-02 10:54:06,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:54:06" (1/1) ... [2018-12-02 10:54:06,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:54:06" (1/1) ... [2018-12-02 10:54:06,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:54:06" (1/1) ... [2018-12-02 10:54:06,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 10:54:06,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 10:54:06,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 10:54:06,083 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 10:54:06,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:54:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 10:54:06,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 10:54:06,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-02 10:54:06,114 INFO L130 BoogieDeclarations]: Found specification of procedure receive [2018-12-02 10:54:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure receive [2018-12-02 10:54:06,114 INFO L130 BoogieDeclarations]: Found specification of procedure process_prio_queue [2018-12-02 10:54:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure process_prio_queue [2018-12-02 10:54:06,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 10:54:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 10:54:06,114 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2018-12-02 10:54:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2018-12-02 10:54:06,114 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 10:54:06,114 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 10:54:06,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 10:54:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 10:54:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2018-12-02 10:54:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure send [2018-12-02 10:54:06,115 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2018-12-02 10:54:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 10:54:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-02 10:54:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 10:54:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-12-02 10:54:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure process_normal_queue [2018-12-02 10:54:06,115 INFO L138 BoogieDeclarations]: Found implementation of procedure process_normal_queue [2018-12-02 10:54:06,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 10:54:06,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 10:54:08,430 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 10:54:08,430 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-02 10:54:08,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:54:08 BoogieIcfgContainer [2018-12-02 10:54:08,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 10:54:08,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 10:54:08,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 10:54:08,433 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 10:54:08,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:54:05" (1/3) ... [2018-12-02 10:54:08,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70daf4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:54:08, skipping insertion in model container [2018-12-02 10:54:08,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:54:06" (2/3) ... [2018-12-02 10:54:08,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70daf4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:54:08, skipping insertion in model container [2018-12-02 10:54:08,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:54:08" (3/3) ... [2018-12-02 10:54:08,436 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter_true-unreach-call.i [2018-12-02 10:54:08,441 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 10:54:08,446 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-02 10:54:08,454 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-02 10:54:08,472 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 10:54:08,472 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 10:54:08,472 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 10:54:08,472 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 10:54:08,473 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 10:54:08,473 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 10:54:08,473 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 10:54:08,473 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 10:54:08,473 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 10:54:08,483 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-12-02 10:54:08,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 10:54:08,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:54:08,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:54:08,488 INFO L423 AbstractCegarLoop]: === Iteration 1 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:54:08,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:54:08,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1331955837, now seen corresponding path program 1 times [2018-12-02 10:54:08,494 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:54:08,494 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:54:08,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:54:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:54:08,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:54:08,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-12-02 10:54:08,566 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 10:54:08,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:54:08,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 10:54:08,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 10:54:08,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 10:54:08,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 10:54:08,581 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2018-12-02 10:54:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:54:08,597 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2018-12-02 10:54:08,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 10:54:08,598 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-12-02 10:54:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:54:08,604 INFO L225 Difference]: With dead ends: 99 [2018-12-02 10:54:08,604 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 10:54:08,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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-12-02 10:54:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 10:54:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-02 10:54:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 10:54:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2018-12-02 10:54:08,633 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 14 [2018-12-02 10:54:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:54:08,633 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-12-02 10:54:08,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 10:54:08,633 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-12-02 10:54:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 10:54:08,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:54:08,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:54:08,634 INFO L423 AbstractCegarLoop]: === Iteration 2 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:54:08,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:54:08,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2076658335, now seen corresponding path program 1 times [2018-12-02 10:54:08,635 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:54:08,635 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:54:08,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:54:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:54:08,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:54:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:54:08,681 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 10:54:08,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:54:08,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 10:54:08,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 10:54:08,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 10:54:08,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 10:54:08,684 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 3 states. [2018-12-02 10:54:08,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:54:08,695 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-12-02 10:54:08,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 10:54:08,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-02 10:54:08,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:54:08,697 INFO L225 Difference]: With dead ends: 59 [2018-12-02 10:54:08,697 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 10:54:08,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-12-02 10:54:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 10:54:08,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-02 10:54:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 10:54:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-12-02 10:54:08,702 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 14 [2018-12-02 10:54:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:54:08,702 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-12-02 10:54:08,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 10:54:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-12-02 10:54:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 10:54:08,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:54:08,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:54:08,703 INFO L423 AbstractCegarLoop]: === Iteration 3 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:54:08,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:54:08,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2076656413, now seen corresponding path program 1 times [2018-12-02 10:54:08,704 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:54:08,704 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:54:08,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:54:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:54:08,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:54:08,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 10:54:08,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 10:54:08,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:08,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:08,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 10:54:08,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 10:54:08,792 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:08,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:08,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:08,797 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-02 10:54:08,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-12-02 10:54:08,823 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 10:54:08,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:54:08,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 10:54:08,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 10:54:08,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 10:54:08,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 10:54:08,825 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 6 states. [2018-12-02 10:54:10,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:54:10,998 INFO L93 Difference]: Finished difference Result 93 states and 111 transitions. [2018-12-02 10:54:10,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 10:54:10,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-02 10:54:10,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:54:11,001 INFO L225 Difference]: With dead ends: 93 [2018-12-02 10:54:11,001 INFO L226 Difference]: Without dead ends: 66 [2018-12-02 10:54:11,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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-12-02 10:54:11,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-02 10:54:11,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-12-02 10:54:11,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-02 10:54:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-12-02 10:54:11,007 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 14 [2018-12-02 10:54:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:54:11,008 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-12-02 10:54:11,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 10:54:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-12-02 10:54:11,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 10:54:11,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:54:11,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:54:11,008 INFO L423 AbstractCegarLoop]: === Iteration 4 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:54:11,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:54:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash 644197206, now seen corresponding path program 1 times [2018-12-02 10:54:11,009 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:54:11,009 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:54:11,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:54:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:54:11,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:54:11,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 10:54:11,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 10:54:11,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:11,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:11,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 10:54:11,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 10:54:11,095 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:11,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:11,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:11,100 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-02 10:54:11,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:54:11,134 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 10:54:11,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:54:11,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 10:54:11,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 10:54:11,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 10:54:11,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 10:54:11,137 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 7 states. [2018-12-02 10:54:13,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:54:13,725 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2018-12-02 10:54:13,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 10:54:13,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-02 10:54:13,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:54:13,726 INFO L225 Difference]: With dead ends: 98 [2018-12-02 10:54:13,726 INFO L226 Difference]: Without dead ends: 76 [2018-12-02 10:54:13,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-02 10:54:13,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-02 10:54:13,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 58. [2018-12-02 10:54:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 10:54:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2018-12-02 10:54:13,731 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 20 [2018-12-02 10:54:13,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:54:13,732 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-12-02 10:54:13,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 10:54:13,732 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-12-02 10:54:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 10:54:13,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:54:13,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:54:13,733 INFO L423 AbstractCegarLoop]: === Iteration 5 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:54:13,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:54:13,733 INFO L82 PathProgramCache]: Analyzing trace with hash -309506550, now seen corresponding path program 1 times [2018-12-02 10:54:13,733 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:54:13,733 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:54:13,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:54:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:54:13,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:54:13,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:13,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 10:54:13,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 10:54:13,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:13,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:13,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:13,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-12-02 10:54:13,907 INFO L478 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 21 treesize of output 20 [2018-12-02 10:54:13,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:13,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:13,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-12-02 10:54:13,976 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:14,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:14,188 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:14,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:14,320 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:14,335 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:14,406 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:14,416 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:14,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:14,453 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-12-02 10:54:16,465 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_receive_~#packet~0.base_4| (_ BitVec 32)) (v_DerPreprocessor_2 (_ 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)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse0 (bvadd |v_receive_~#packet~0.offset_4| (_ bv4 32))) (.cse1 (bvadd |v_receive_~#packet~0.offset_4| (_ bv8 32)))) (and (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_2) .cse0 v_DerPreprocessor_4) .cse1 |v_receive_#t~ret5.offset_4|)) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| |v_receive_~#packet~0.base_4|)) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_8) .cse0 v_DerPreprocessor_6) .cse1 |v_receive_#t~ret5.base_4|)) |c_#memory_$Pointer$.base|)))) is different from true [2018-12-02 10:54:16,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:16,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:16,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:16,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-02 10:54:16,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:16,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-02 10:54:16,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-02 10:54:16,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:16,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-02 10:54:16,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:16,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:16,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:16,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-02 10:54:16,686 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:16,724 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:16,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:16,778 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:16,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-02 10:54:16,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-02 10:54:16,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:16,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-02 10:54:16,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:16,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:16,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:16,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-02 10:54:16,931 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:16,958 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:16,979 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:17,009 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:17,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:17,113 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:78, output treesize:15 [2018-12-02 10:54:17,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 10:54:17,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 10:54:17,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:17,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:17,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 10:54:17,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 10:54:17,153 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:17,155 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:17,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:17,159 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-02 10:54:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:54:17,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 10:54:17,653 WARN L180 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-02 10:54:18,058 WARN L180 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-02 10:54:18,748 WARN L180 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-02 10:54:19,273 WARN L180 SmtUtils]: Spent 524.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 10:54:23,499 WARN L180 SmtUtils]: Spent 4.22 s on a formula simplification that was a NOOP. DAG size: 109 [2018-12-02 10:54:23,502 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:23,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:23,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-12-02 10:54:23,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:23,650 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:23,729 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:23,730 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:23,818 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:30,163 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:30,244 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:30,245 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:30,327 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:30,328 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:30,415 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:34,711 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:34,756 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:34,757 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:34,789 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:34,790 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:34,823 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:37,978 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:38,009 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:38,010 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:38,046 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:38,047 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:38,075 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:38,076 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:38,110 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:39,259 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:39,285 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:39,286 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:39,307 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:39,308 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:39,332 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:40,306 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:40,326 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:40,327 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:40,343 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:40,344 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:40,358 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:40,923 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:40,956 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:40,956 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:40,973 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:40,974 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:40,994 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:41,331 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:41,348 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:41,349 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:41,359 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:41,360 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:41,373 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:41,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 8 dim-2 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2018-12-02 10:54:41,618 INFO L202 ElimStorePlain]: Needed 53 recursive calls to eliminate 14 variables, input treesize:193, output treesize:131 [2018-12-02 10:54:51,314 WARN L180 SmtUtils]: Spent 9.62 s on a formula simplification. DAG size of input: 88 DAG size of output: 47 [2018-12-02 10:54:51,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 10:54:51,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 10:54:51,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:54:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:54:51,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:54:51,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:51,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-12-02 10:54:51,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-12-02 10:54:51,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:51,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:51,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:51,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-12-02 10:54:51,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:51,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:51,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:51,415 INFO L478 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-12-02 10:54:51,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:51,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:51,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:46 [2018-12-02 10:54:51,488 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:51,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:51,787 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:51,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:51,930 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:51,943 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:52,024 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:52,035 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:52,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-02 10:54:52,078 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-12-02 10:54:54,090 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_receive_~#packet~0.base_11| (_ BitVec 32)) (v_DerPreprocessor_64 (_ BitVec 32)) (|v_receive_#t~ret5.base_11| (_ BitVec 32)) (|v_receive_~#packet~0.offset_11| (_ BitVec 32)) (v_DerPreprocessor_62 (_ BitVec 32)) (v_DerPreprocessor_68 (_ BitVec 32)) (|v_receive_#t~ret5.offset_11| (_ BitVec 32)) (v_DerPreprocessor_66 (_ BitVec 32))) (let ((.cse0 (bvadd |v_receive_~#packet~0.offset_11| (_ bv4 32))) (.cse1 (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 (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_11|) |v_receive_~#packet~0.offset_11| v_DerPreprocessor_66) .cse0 v_DerPreprocessor_68) .cse1 |v_receive_#t~ret5.offset_11|)) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_11| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_11|) |v_receive_~#packet~0.offset_11| v_DerPreprocessor_62) .cse0 v_DerPreprocessor_64) .cse1 |v_receive_#t~ret5.base_11|)) |c_#memory_$Pointer$.base|)))) is different from true [2018-12-02 10:54:54,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:54,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:54,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:54,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:54,121 INFO L478 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 25 treesize of output 25 [2018-12-02 10:54:54,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:54,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-02 10:54:54,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-02 10:54:54,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:54,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-02 10:54:54,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:54,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:54,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:54,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-02 10:54:54,343 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:54,387 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:54,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:54,449 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:54,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-02 10:54:54,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-02 10:54:54,581 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:54,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-02 10:54:54,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:54,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:54,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:54:54,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-02 10:54:54,615 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:54,643 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:54,667 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:54,699 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:54,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:54,781 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:93, output treesize:15 [2018-12-02 10:54:54,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 10:54:54,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 10:54:54,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:54,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:54,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 10:54:54,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 10:54:54,803 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 10:54:54,804 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:54,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:54:54,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-02 10:54:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:54:54,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 10:54:55,383 WARN L180 SmtUtils]: Spent 568.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-02 10:54:55,806 WARN L180 SmtUtils]: Spent 422.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-02 10:54:56,628 WARN L180 SmtUtils]: Spent 820.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-02 10:54:57,278 WARN L180 SmtUtils]: Spent 648.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 10:55:01,140 WARN L180 SmtUtils]: Spent 3.86 s on a formula simplification that was a NOOP. DAG size: 107 [2018-12-02 10:55:01,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:01,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:01,216 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:01,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:01,293 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:01,370 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:01,371 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:01,455 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:04,896 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:04,981 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:04,982 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:05,059 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:05,060 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:05,149 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:08,361 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:08,406 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:08,406 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:08,440 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:08,441 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:08,483 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:10,813 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:10,849 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:10,850 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:10,898 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:10,899 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:10,937 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:11,856 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:11,883 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:11,884 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:11,911 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:11,912 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:11,939 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:13,000 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:13,013 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:13,014 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:13,026 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:13,027 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:13,043 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:13,689 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:13,712 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:13,713 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:13,732 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:13,732 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:13,760 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:14,127 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:14,146 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:14,146 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:14,160 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:14,161 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:14,172 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:14,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 8 dim-2 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2018-12-02 10:55:14,442 INFO L202 ElimStorePlain]: Needed 51 recursive calls to eliminate 14 variables, input treesize:193, output treesize:131 [2018-12-02 10:55:25,550 WARN L180 SmtUtils]: Spent 9.01 s on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2018-12-02 10:55:25,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 10:55:25,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2018-12-02 10:55:25,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 10:55:25,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 10:55:25,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=104, Unknown=3, NotChecked=42, Total=182 [2018-12-02 10:55:25,567 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 12 states. [2018-12-02 10:55:27,981 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((|v_receive_~#packet~0.base_11| (_ BitVec 32)) (v_DerPreprocessor_64 (_ BitVec 32)) (|v_receive_#t~ret5.base_11| (_ BitVec 32)) (|v_receive_~#packet~0.offset_11| (_ BitVec 32)) (v_DerPreprocessor_62 (_ BitVec 32)) (v_DerPreprocessor_68 (_ BitVec 32)) (|v_receive_#t~ret5.offset_11| (_ BitVec 32)) (v_DerPreprocessor_66 (_ BitVec 32))) (let ((.cse0 (bvadd |v_receive_~#packet~0.offset_11| (_ bv4 32))) (.cse1 (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 (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_11|) |v_receive_~#packet~0.offset_11| v_DerPreprocessor_66) .cse0 v_DerPreprocessor_68) .cse1 |v_receive_#t~ret5.offset_11|)) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_11| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_11|) |v_receive_~#packet~0.offset_11| v_DerPreprocessor_62) .cse0 v_DerPreprocessor_64) .cse1 |v_receive_#t~ret5.base_11|)) |c_#memory_$Pointer$.base|)))) (exists ((v_DerPreprocessor_6 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (|v_receive_~#packet~0.base_4| (_ BitVec 32)) (v_DerPreprocessor_2 (_ 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)) (v_DerPreprocessor_8 (_ BitVec 32))) (let ((.cse2 (bvadd |v_receive_~#packet~0.offset_4| (_ bv4 32))) (.cse3 (bvadd |v_receive_~#packet~0.offset_4| (_ bv8 32)))) (and (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_2) .cse2 v_DerPreprocessor_4) .cse3 |v_receive_#t~ret5.offset_4|)) |c_#memory_$Pointer$.offset|) (= (_ bv0 1) (select |c_old(#valid)| |v_receive_~#packet~0.base_4|)) (= (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_4|) |v_receive_~#packet~0.offset_4| v_DerPreprocessor_8) .cse2 v_DerPreprocessor_6) .cse3 |v_receive_#t~ret5.base_4|)) |c_#memory_$Pointer$.base|))))) is different from true [2018-12-02 10:55:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:55:44,122 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2018-12-02 10:55:44,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 10:55:44,123 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-12-02 10:55:44,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:55:44,123 INFO L225 Difference]: With dead ends: 121 [2018-12-02 10:55:44,124 INFO L226 Difference]: Without dead ends: 94 [2018-12-02 10:55:44,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=54, Invalid=194, Unknown=4, NotChecked=90, Total=342 [2018-12-02 10:55:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-02 10:55:44,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 69. [2018-12-02 10:55:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-02 10:55:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2018-12-02 10:55:44,129 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 24 [2018-12-02 10:55:44,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:55:44,130 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2018-12-02 10:55:44,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 10:55:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2018-12-02 10:55:44,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 10:55:44,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:55:44,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:55:44,130 INFO L423 AbstractCegarLoop]: === Iteration 6 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:55:44,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:55:44,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1333878491, now seen corresponding path program 1 times [2018-12-02 10:55:44,131 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:55:44,131 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:55:44,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:55:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:55:44,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:55:44,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-12-02 10:55:44,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 10:55:44,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-02 10:55:44,262 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:44,264 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:44,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:44,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:44,270 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2018-12-02 10:55:44,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-12-02 10:55:44,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-12-02 10:55:44,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:44,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-02 10:55:44,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:44,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 10:55:44,343 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:44,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:44,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:44,348 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-12-02 10:55:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:55:44,355 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 10:55:44,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 10:55:44,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 10:55:44,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 10:55:44,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 10:55:44,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 10:55:44,357 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 9 states. [2018-12-02 10:55:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:55:46,671 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions. [2018-12-02 10:55:46,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 10:55:46,674 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-12-02 10:55:46,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:55:46,675 INFO L225 Difference]: With dead ends: 133 [2018-12-02 10:55:46,675 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 10:55:46,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-02 10:55:46,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 10:55:46,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-12-02 10:55:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-02 10:55:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2018-12-02 10:55:46,683 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 30 [2018-12-02 10:55:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:55:46,683 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2018-12-02 10:55:46,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 10:55:46,684 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2018-12-02 10:55:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 10:55:46,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:55:46,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:55:46,685 INFO L423 AbstractCegarLoop]: === Iteration 7 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:55:46,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:55:46,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1218673859, now seen corresponding path program 1 times [2018-12-02 10:55:46,685 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:55:46,685 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:55:46,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:55:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:55:46,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:55:46,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 10:55:46,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 10:55:46,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:46,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:46,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:46,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-12-02 10:55:46,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:55:46,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:55:46,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 10:55:46,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:46,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:46,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2018-12-02 10:55:46,911 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:46,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:47,203 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:47,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:47,348 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:47,365 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:47,420 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:47,430 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:47,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-02 10:55:47,468 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-12-02 10:55:49,477 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_122 (_ BitVec 32)) (|v_receive_#t~ret5.offset_18| (_ BitVec 32)) (v_DerPreprocessor_124 (_ BitVec 32)) (v_DerPreprocessor_126 (_ BitVec 32)) (|v_receive_#t~ret5.base_18| (_ BitVec 32)) (|v_receive_~#packet~0.base_19| (_ BitVec 32)) (|v_receive_~#packet~0.offset_19| (_ BitVec 32)) (v_DerPreprocessor_120 (_ BitVec 32))) (let ((.cse0 (bvadd |v_receive_~#packet~0.offset_19| (_ bv4 32))) (.cse1 (bvadd |v_receive_~#packet~0.offset_19| (_ bv8 32)))) (and (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_19| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_19|) |v_receive_~#packet~0.offset_19| v_DerPreprocessor_120) .cse0 v_DerPreprocessor_124) .cse1 |v_receive_#t~ret5.offset_18|)) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_19|) (_ bv0 1)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_19| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_19|) |v_receive_~#packet~0.offset_19| v_DerPreprocessor_122) .cse0 v_DerPreprocessor_126) .cse1 |v_receive_#t~ret5.base_18|)))))) is different from true [2018-12-02 10:55:49,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:55:49,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:55:49,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:55:49,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-02 10:55:49,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:49,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-02 10:55:49,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-02 10:55:49,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:55:49,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-02 10:55:49,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:55:49,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:55:49,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:55:49,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-02 10:55:49,664 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:49,695 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:49,717 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:49,748 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:49,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-02 10:55:49,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-02 10:55:49,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:55:49,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-02 10:55:49,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:55:49,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:55:49,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:55:49,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-02 10:55:49,870 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:49,895 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:49,917 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:49,950 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:50,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:50,013 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:78, output treesize:15 [2018-12-02 10:55:50,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 10:55:50,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 10:55:50,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:50,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:50,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 10:55:50,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 10:55:50,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 10:55:50,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:50,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:55:50,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-02 10:55:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:55:50,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 10:55:52,703 WARN L180 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-02 10:55:53,196 WARN L180 SmtUtils]: Spent 492.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-02 10:55:54,217 WARN L180 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 61 [2018-12-02 10:55:54,866 WARN L180 SmtUtils]: Spent 647.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 10:56:00,599 WARN L180 SmtUtils]: Spent 5.73 s on a formula simplification that was a NOOP. DAG size: 109 [2018-12-02 10:56:00,600 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:00,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:00,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:00,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:00,765 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:00,836 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:00,837 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:00,929 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:06,244 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:06,297 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:06,298 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:06,345 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:06,345 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:06,384 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:06,385 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:06,429 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:11,071 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:11,108 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:11,109 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:11,149 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:11,150 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:11,172 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:11,173 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:11,197 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:15,259 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:15,278 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:15,279 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:15,290 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:15,291 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:15,311 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:15,311 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:15,320 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:17,387 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:17,458 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:17,459 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:17,538 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:17,539 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:17,612 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:18,874 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:18,911 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:18,912 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:18,959 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:18,959 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:19,005 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:19,826 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:19,850 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:19,851 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:19,879 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:19,879 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:19,904 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:20,461 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:20,479 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:20,480 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:20,491 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:20,492 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:20,502 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:20,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 8 dim-2 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-12-02 10:56:20,861 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 14 variables, input treesize:193, output treesize:158 [2018-12-02 10:56:23,513 WARN L180 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 105 DAG size of output: 47 [2018-12-02 10:56:23,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 10:56:23,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 10:56:23,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:56:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:56:23,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:56:23,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 10:56:23,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 10:56:23,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:23,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:23,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:23,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-12-02 10:56:23,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:56:23,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:56:23,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 10:56:23,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:23,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:23,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2018-12-02 10:56:23,589 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:23,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:23,866 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:23,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:24,012 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:24,028 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:24,107 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:24,120 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:24,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:24,159 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-12-02 10:56:26,171 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_188 (_ BitVec 32)) (|v_receive_~#packet~0.offset_26| (_ BitVec 32)) (|v_receive_#t~ret5.base_25| (_ BitVec 32)) (|v_receive_~#packet~0.base_26| (_ BitVec 32)) (v_DerPreprocessor_190 (_ BitVec 32)) (v_DerPreprocessor_184 (_ BitVec 32)) (|v_receive_#t~ret5.offset_25| (_ BitVec 32)) (v_DerPreprocessor_186 (_ BitVec 32))) (let ((.cse0 (bvadd |v_receive_~#packet~0.offset_26| (_ bv4 32))) (.cse1 (bvadd |v_receive_~#packet~0.offset_26| (_ bv8 32)))) (and (= (select |c_old(#valid)| |v_receive_~#packet~0.base_26|) (_ bv0 1)) (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_26| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_26|) |v_receive_~#packet~0.offset_26| v_DerPreprocessor_184) .cse0 v_DerPreprocessor_186) .cse1 |v_receive_#t~ret5.offset_25|)) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_26| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_26|) |v_receive_~#packet~0.offset_26| v_DerPreprocessor_190) .cse0 v_DerPreprocessor_188) .cse1 |v_receive_#t~ret5.base_25|)))))) is different from true [2018-12-02 10:56:26,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:56:26,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:56:26,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:56:26,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-02 10:56:26,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:26,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-02 10:56:26,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-02 10:56:26,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:56:26,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-02 10:56:26,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:56:26,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:56:26,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:56:26,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-02 10:56:26,375 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:26,405 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:26,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:26,453 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:26,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-02 10:56:26,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-02 10:56:26,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:56:26,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2018-12-02 10:56:26,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:56:26,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:56:26,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:56:26,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-12-02 10:56:26,576 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:26,601 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:26,618 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:26,641 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:26,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:26,698 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:78, output treesize:15 [2018-12-02 10:56:26,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 10:56:26,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 10:56:26,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:26,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:26,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 10:56:26,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 10:56:26,713 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:26,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:26,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:26,719 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-02 10:56:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 10:56:26,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 10:56:29,396 WARN L180 SmtUtils]: Spent 613.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-02 10:56:29,959 WARN L180 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-02 10:56:30,769 WARN L180 SmtUtils]: Spent 808.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-02 10:56:31,487 WARN L180 SmtUtils]: Spent 717.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-02 10:56:35,221 WARN L180 SmtUtils]: Spent 3.73 s on a formula simplification that was a NOOP. DAG size: 108 [2018-12-02 10:56:35,222 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:35,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:35,304 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:35,385 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:35,385 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:35,478 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:35,479 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:35,559 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:42,990 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:43,043 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:43,043 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:43,096 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:43,097 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:43,150 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:43,150 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:43,195 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:47,954 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:47,991 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:47,992 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:48,023 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:48,023 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:48,061 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:48,062 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:48,089 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:51,818 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:51,894 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:51,894 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:51,969 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:51,969 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:52,033 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:54,618 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:54,629 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:54,629 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:54,648 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:54,648 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:54,665 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:54,666 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:54,675 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:55,965 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:56,008 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:56,008 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:56,052 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:56,053 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:56,093 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:56,917 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:56,940 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:56,940 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:56,966 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:56,967 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:56,993 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:57,517 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:57,535 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:57,536 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:57,545 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:56:57,545 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-02 10:56:57,556 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:56:57,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 8 dim-2 vars, End of recursive call: 20 dim-0 vars, and 6 xjuncts. [2018-12-02 10:56:57,859 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 14 variables, input treesize:193, output treesize:158 [2018-12-02 10:57:02,753 WARN L180 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 104 DAG size of output: 47 [2018-12-02 10:57:02,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 10:57:02,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-02 10:57:02,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 10:57:02,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 10:57:02,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=146, Unknown=4, NotChecked=50, Total=240 [2018-12-02 10:57:02,769 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 13 states. [2018-12-02 10:57:05,319 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_DerPreprocessor_122 (_ BitVec 32)) (|v_receive_#t~ret5.offset_18| (_ BitVec 32)) (v_DerPreprocessor_124 (_ BitVec 32)) (v_DerPreprocessor_126 (_ BitVec 32)) (|v_receive_#t~ret5.base_18| (_ BitVec 32)) (|v_receive_~#packet~0.base_19| (_ BitVec 32)) (|v_receive_~#packet~0.offset_19| (_ BitVec 32)) (v_DerPreprocessor_120 (_ BitVec 32))) (let ((.cse0 (bvadd |v_receive_~#packet~0.offset_19| (_ bv4 32))) (.cse1 (bvadd |v_receive_~#packet~0.offset_19| (_ bv8 32)))) (and (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_19| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_19|) |v_receive_~#packet~0.offset_19| v_DerPreprocessor_120) .cse0 v_DerPreprocessor_124) .cse1 |v_receive_#t~ret5.offset_18|)) |c_#memory_$Pointer$.offset|) (= (select |c_old(#valid)| |v_receive_~#packet~0.base_19|) (_ bv0 1)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_19| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_19|) |v_receive_~#packet~0.offset_19| v_DerPreprocessor_122) .cse0 v_DerPreprocessor_126) .cse1 |v_receive_#t~ret5.base_18|)))))) (exists ((v_DerPreprocessor_188 (_ BitVec 32)) (|v_receive_~#packet~0.offset_26| (_ BitVec 32)) (|v_receive_#t~ret5.base_25| (_ BitVec 32)) (|v_receive_~#packet~0.base_26| (_ BitVec 32)) (v_DerPreprocessor_190 (_ BitVec 32)) (v_DerPreprocessor_184 (_ BitVec 32)) (|v_receive_#t~ret5.offset_25| (_ BitVec 32)) (v_DerPreprocessor_186 (_ BitVec 32))) (let ((.cse2 (bvadd |v_receive_~#packet~0.offset_26| (_ bv4 32))) (.cse3 (bvadd |v_receive_~#packet~0.offset_26| (_ bv8 32)))) (and (= (select |c_old(#valid)| |v_receive_~#packet~0.base_26|) (_ bv0 1)) (= (store |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_26| (store (store (store (select |c_old(#memory_$Pointer$.offset)| |v_receive_~#packet~0.base_26|) |v_receive_~#packet~0.offset_26| v_DerPreprocessor_184) .cse2 v_DerPreprocessor_186) .cse3 |v_receive_#t~ret5.offset_25|)) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_26| (store (store (store (select |c_old(#memory_$Pointer$.base)| |v_receive_~#packet~0.base_26|) |v_receive_~#packet~0.offset_26| v_DerPreprocessor_190) .cse2 v_DerPreprocessor_188) .cse3 |v_receive_#t~ret5.base_25|))))))) is different from true [2018-12-02 10:57:08,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 10:57:08,446 INFO L93 Difference]: Finished difference Result 117 states and 147 transitions. [2018-12-02 10:57:08,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 10:57:08,447 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-12-02 10:57:08,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 10:57:08,447 INFO L225 Difference]: With dead ends: 117 [2018-12-02 10:57:08,448 INFO L226 Difference]: Without dead ends: 95 [2018-12-02 10:57:08,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=69, Invalid=244, Unknown=5, NotChecked=102, Total=420 [2018-12-02 10:57:08,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-02 10:57:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 71. [2018-12-02 10:57:08,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-02 10:57:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2018-12-02 10:57:08,453 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 30 [2018-12-02 10:57:08,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 10:57:08,453 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2018-12-02 10:57:08,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 10:57:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2018-12-02 10:57:08,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 10:57:08,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 10:57:08,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 10:57:08,454 INFO L423 AbstractCegarLoop]: === Iteration 8 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 10:57:08,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 10:57:08,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1756580317, now seen corresponding path program 1 times [2018-12-02 10:57:08,454 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 10:57:08,454 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c7b9ea56-e66a-4fd5-983d-11ddd3a34649/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:57:08,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 10:57:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 10:57:08,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 10:57:08,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-02 10:57:08,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-12-02 10:57:08,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 10:57:08,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:57:08,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:57:08,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:9 [2018-12-02 10:57:28,275 WARN L180 SmtUtils]: Spent 19.63 s on a formula simplification. DAG size of input: 118 DAG size of output: 93 [2018-12-02 10:57:28,276 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:57:28,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:57:36,569 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:57:37,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:57:44,394 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:57:44,737 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 10:57:50,472 INFO L303 Elim1Store]: Index analysis took 715 ms [2018-12-02 10:57:50,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2018-12-02 10:57:50,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 10:57:50,657 INFO L303 Elim1Store]: Index analysis took 147 ms [2018-12-02 10:57:50,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-12-02 10:57:50,658 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 10:57:51,173 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:57:52,733 INFO L303 Elim1Store]: Index analysis took 848 ms [2018-12-02 10:57:52,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-12-02 10:57:52,862 INFO L303 Elim1Store]: Index analysis took 128 ms [2018-12-02 10:57:52,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-12-02 10:57:52,863 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 10:57:53,080 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:57:53,637 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:57:54,050 INFO L303 Elim1Store]: Index analysis took 411 ms [2018-12-02 10:57:54,050 INFO L478 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-12-02 10:57:54,298 INFO L303 Elim1Store]: Index analysis took 247 ms [2018-12-02 10:57:54,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 47 [2018-12-02 10:57:54,327 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 10:57:56,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-12-02 10:57:56,606 INFO L303 Elim1Store]: Index analysis took 318 ms [2018-12-02 10:57:56,608 INFO L478 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 30 treesize of output 33 [2018-12-02 10:57:56,609 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 10:57:56,885 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 10:57:56,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-12-02 10:57:57,153 INFO L303 Elim1Store]: Index analysis took 247 ms [2018-12-02 10:57:57,153 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2018-12-02 10:57:57,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 10:57:57,329 INFO L303 Elim1Store]: Index analysis took 175 ms [2018-12-02 10:57:57,330 INFO L478 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 0 case distinctions, treesize of input 22 treesize of output 21 [2018-12-02 10:57:57,598 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 10:57:57,600 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_arrayElimArr_27 input size 11 context size 11 output size 11 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.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:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-02 10:57:57,606 INFO L168 Benchmark]: Toolchain (without parser) took 231853.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 939.4 MB in the beginning and 1.0 GB in the end (delta: -86.8 MB). Peak memory consumption was 103.0 MB. Max. memory is 11.5 GB. [2018-12-02 10:57:57,607 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:57:57,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-02 10:57:57,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 10:57:57,608 INFO L168 Benchmark]: Boogie Preprocessor took 25.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 10:57:57,608 INFO L168 Benchmark]: RCFGBuilder took 2347.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2018-12-02 10:57:57,609 INFO L168 Benchmark]: TraceAbstraction took 229173.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.1 MB). Peak memory consumption was 90.8 MB. Max. memory is 11.5 GB. [2018-12-02 10:57:57,610 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 283.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.71 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 2347.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 229173.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 46.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 44.1 MB). Peak memory consumption was 90.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_27 input size 11 context size 11 output size 11 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_27 input size 11 context size 11 output size 11: 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...