./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_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer --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 Automizer --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_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer --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 Automizer --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-08 09:19:15,093 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:19:15,095 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:19:15,103 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:19:15,104 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:19:15,104 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:19:15,105 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:19:15,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:19:15,108 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:19:15,108 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:19:15,109 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:19:15,109 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:19:15,110 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:19:15,111 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:19:15,111 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:19:15,112 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:19:15,113 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:19:15,114 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:19:15,115 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:19:15,116 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:19:15,117 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:19:15,118 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:19:15,119 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:19:15,119 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:19:15,120 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:19:15,120 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:19:15,121 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:19:15,122 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:19:15,122 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:19:15,123 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:19:15,123 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:19:15,123 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:19:15,124 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:19:15,124 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:19:15,124 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:19:15,125 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:19:15,125 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-08 09:19:15,134 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:19:15,135 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:19:15,135 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 09:19:15,135 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 09:19:15,135 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:19:15,136 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:19:15,136 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:19:15,136 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:19:15,136 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 09:19:15,136 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 09:19:15,136 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 09:19:15,136 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:19:15,137 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 09:19:15,137 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 09:19:15,137 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 09:19:15,137 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 09:19:15,137 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:19:15,137 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:19:15,137 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 09:19:15,138 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:19:15,138 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:19:15,138 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 09:19:15,138 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 09:19:15,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:19:15,138 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:19:15,139 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 09:19:15,139 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 09:19:15,139 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 09:19:15,139 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 09:19:15,139 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 09:19:15,139 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_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer 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 -> Automizer 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-08 09:19:15,163 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:19:15,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:19:15,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:19:15,176 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:19:15,177 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:19:15,177 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-12-08 09:19:15,216 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/data/959272d48/1f6003ada32e451eafa9e2091bfc6a41/FLAG78eeef9d6 [2018-12-08 09:19:15,633 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:19:15,634 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-12-08 09:19:15,640 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/data/959272d48/1f6003ada32e451eafa9e2091bfc6a41/FLAG78eeef9d6 [2018-12-08 09:19:15,648 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/data/959272d48/1f6003ada32e451eafa9e2091bfc6a41 [2018-12-08 09:19:15,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:19:15,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:19:15,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:19:15,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:19:15,653 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:19:15,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:19:15" (1/1) ... [2018-12-08 09:19:15,655 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 08.12 09:19:15, skipping insertion in model container [2018-12-08 09:19:15,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:19:15" (1/1) ... [2018-12-08 09:19:15,659 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:19:15,680 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:19:15,828 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:19:15,871 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:19:15,898 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:19:15,921 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:19:15,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:15 WrapperNode [2018-12-08 09:19:15,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:19:15,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:19:15,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:19:15,922 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:19:15,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:15" (1/1) ... [2018-12-08 09:19:15,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:15" (1/1) ... [2018-12-08 09:19:15,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:19:15,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:19:15,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:19:15,941 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:19:15,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:15" (1/1) ... [2018-12-08 09:19:15,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:15" (1/1) ... [2018-12-08 09:19:15,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:15" (1/1) ... [2018-12-08 09:19:15,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:15" (1/1) ... [2018-12-08 09:19:15,957 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:15" (1/1) ... [2018-12-08 09:19:15,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:15" (1/1) ... [2018-12-08 09:19:15,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:15" (1/1) ... [2018-12-08 09:19:15,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:19:15,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:19:15,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:19:15,963 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:19:15,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:19:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 09:19:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 09:19:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 09:19:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure receive [2018-12-08 09:19:15,995 INFO L138 BoogieDeclarations]: Found implementation of procedure receive [2018-12-08 09:19:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure process_prio_queue [2018-12-08 09:19:15,995 INFO L138 BoogieDeclarations]: Found implementation of procedure process_prio_queue [2018-12-08 09:19:15,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 09:19:15,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 09:19:15,996 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2018-12-08 09:19:15,996 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2018-12-08 09:19:15,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 09:19:15,996 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 09:19:15,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 09:19:15,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 09:19:15,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2018-12-08 09:19:15,996 INFO L130 BoogieDeclarations]: Found specification of procedure send [2018-12-08 09:19:15,996 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2018-12-08 09:19:15,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 09:19:15,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 09:19:15,996 INFO L130 BoogieDeclarations]: Found specification of procedure process_normal_queue [2018-12-08 09:19:15,996 INFO L138 BoogieDeclarations]: Found implementation of procedure process_normal_queue [2018-12-08 09:19:15,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-08 09:19:15,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:19:15,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:19:16,241 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:19:16,242 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-08 09:19:16,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:19:16 BoogieIcfgContainer [2018-12-08 09:19:16,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:19:16,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 09:19:16,243 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 09:19:16,244 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 09:19:16,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 09:19:15" (1/3) ... [2018-12-08 09:19:16,245 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 08.12 09:19:16, skipping insertion in model container [2018-12-08 09:19:16,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:19:15" (2/3) ... [2018-12-08 09:19:16,245 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 08.12 09:19:16, skipping insertion in model container [2018-12-08 09:19:16,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:19:16" (3/3) ... [2018-12-08 09:19:16,246 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter_true-unreach-call.i [2018-12-08 09:19:16,252 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 09:19:16,256 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-08 09:19:16,265 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-08 09:19:16,281 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:19:16,281 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 09:19:16,281 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 09:19:16,281 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 09:19:16,282 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:19:16,282 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:19:16,282 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 09:19:16,282 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:19:16,282 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 09:19:16,292 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-12-08 09:19:16,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 09:19:16,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:19:16,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:19:16,297 INFO L423 AbstractCegarLoop]: === Iteration 1 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:19:16,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:16,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1336356447, now seen corresponding path program 1 times [2018-12-08 09:19:16,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:19:16,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:19:16,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:16,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:19:16,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:19:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:19:16,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:19:16,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 09:19:16,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-08 09:19:16,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 09:19:16,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 09:19:16,395 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-12-08 09:19:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:19:16,413 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2018-12-08 09:19:16,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 09:19:16,414 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-12-08 09:19:16,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:19:16,420 INFO L225 Difference]: With dead ends: 100 [2018-12-08 09:19:16,420 INFO L226 Difference]: Without dead ends: 57 [2018-12-08 09:19:16,422 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-08 09:19:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-08 09:19:16,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-08 09:19:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-08 09:19:16,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-12-08 09:19:16,451 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 14 [2018-12-08 09:19:16,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:19:16,452 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-12-08 09:19:16,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-08 09:19:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-12-08 09:19:16,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 09:19:16,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:19:16,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:19:16,453 INFO L423 AbstractCegarLoop]: === Iteration 2 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:19:16,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:16,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1073629961, now seen corresponding path program 1 times [2018-12-08 09:19:16,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:19:16,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:19:16,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:16,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:19:16,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:19:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:19:16,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:19:16,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:19:16,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:19:16,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:19:16,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:19:16,496 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 3 states. [2018-12-08 09:19:16,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:19:16,509 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-12-08 09:19:16,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:19:16,509 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-08 09:19:16,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:19:16,510 INFO L225 Difference]: With dead ends: 60 [2018-12-08 09:19:16,510 INFO L226 Difference]: Without dead ends: 58 [2018-12-08 09:19:16,511 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-08 09:19:16,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-08 09:19:16,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-08 09:19:16,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-08 09:19:16,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2018-12-08 09:19:16,515 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 15 [2018-12-08 09:19:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:19:16,515 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-12-08 09:19:16,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:19:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-12-08 09:19:16,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 09:19:16,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:19:16,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:19:16,516 INFO L423 AbstractCegarLoop]: === Iteration 3 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:19:16,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:16,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1073628039, now seen corresponding path program 1 times [2018-12-08 09:19:16,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:19:16,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:19:16,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:16,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:19:16,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:19:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:19:16,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:19:16,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:19:16,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:19:16,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:19:16,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:19:16,568 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 6 states. [2018-12-08 09:19:16,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:19:16,659 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2018-12-08 09:19:16,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:19:16,659 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-08 09:19:16,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:19:16,660 INFO L225 Difference]: With dead ends: 95 [2018-12-08 09:19:16,661 INFO L226 Difference]: Without dead ends: 68 [2018-12-08 09:19:16,661 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-08 09:19:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-08 09:19:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-12-08 09:19:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-08 09:19:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2018-12-08 09:19:16,667 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 15 [2018-12-08 09:19:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:19:16,667 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2018-12-08 09:19:16,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:19:16,668 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2018-12-08 09:19:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-08 09:19:16,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:19:16,668 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-08 09:19:16,668 INFO L423 AbstractCegarLoop]: === Iteration 4 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:19:16,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:16,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1587868396, now seen corresponding path program 1 times [2018-12-08 09:19:16,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:19:16,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:19:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:16,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:19:16,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:19:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:19:16,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:19:16,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:19:16,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:19:16,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:19:16,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:19:16,734 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand 7 states. [2018-12-08 09:19:16,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:19:16,955 INFO L93 Difference]: Finished difference Result 100 states and 119 transitions. [2018-12-08 09:19:16,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:19:16,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-12-08 09:19:16,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:19:16,956 INFO L225 Difference]: With dead ends: 100 [2018-12-08 09:19:16,956 INFO L226 Difference]: Without dead ends: 78 [2018-12-08 09:19:16,956 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-08 09:19:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-08 09:19:16,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2018-12-08 09:19:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-08 09:19:16,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2018-12-08 09:19:16,962 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 21 [2018-12-08 09:19:16,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:19:16,962 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2018-12-08 09:19:16,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:19:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-12-08 09:19:16,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 09:19:16,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:19:16,963 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-08 09:19:16,963 INFO L423 AbstractCegarLoop]: === Iteration 5 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:19:16,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:16,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1982739994, now seen corresponding path program 1 times [2018-12-08 09:19:16,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:19:16,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:19:16,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:16,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:19:16,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:19:17,196 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-12-08 09:19:17,244 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-08 09:19:17,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:19:17,244 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:19:17,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:19:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:19:17,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:19:17,314 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-08 09:19:17,318 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-08 09:19:17,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:19:17,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:17,327 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-08 09:19:17,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-12-08 09:19:17,337 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-08 09:19:17,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:19:17,343 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-08 09:19:17,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:25 [2018-12-08 09:19:17,372 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:19:17,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:19:17,398 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:19:17,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:19:17,425 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:19:17,428 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:19:17,441 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:19:17,445 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:19:17,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-08 09:19:17,453 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-12-08 09:19:21,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:21,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:21,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 09:19:21,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:19:21,523 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-08 09:19:21,525 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-08 09:19:21,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:21,532 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-08 09:19:21,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:21,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:21,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:21,543 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-08 09:19:21,543 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 09:19:21,558 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:21,565 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:21,572 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:21,590 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-08 09:19:21,592 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-08 09:19:21,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:21,596 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-08 09:19:21,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:21,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:21,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:21,604 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-08 09:19:21,604 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 09:19:21,614 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:21,622 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:21,629 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:21,642 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-08 09:19:21,642 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 11 variables, input treesize:67, output treesize:15 [2018-12-08 09:19:21,652 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-08 09:19:21,654 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-08 09:19:21,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:19:21,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:21,659 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-08 09:19:21,660 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-08 09:19:21,660 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:19:21,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:21,664 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-08 09:19:21,664 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-08 09:19:21,675 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-08 09:19:21,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:19:21,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-12-08 09:19:21,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 09:19:21,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 09:19:21,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=103, Unknown=2, NotChecked=0, Total=132 [2018-12-08 09:19:21,690 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand 12 states. [2018-12-08 09:19:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:19:46,798 INFO L93 Difference]: Finished difference Result 145 states and 180 transitions. [2018-12-08 09:19:46,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 09:19:46,798 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-12-08 09:19:46,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:19:46,799 INFO L225 Difference]: With dead ends: 145 [2018-12-08 09:19:46,799 INFO L226 Difference]: Without dead ends: 118 [2018-12-08 09:19:46,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=60, Invalid=242, Unknown=4, NotChecked=0, Total=306 [2018-12-08 09:19:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-08 09:19:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 72. [2018-12-08 09:19:46,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-08 09:19:46,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2018-12-08 09:19:46,807 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 26 [2018-12-08 09:19:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:19:46,807 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2018-12-08 09:19:46,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 09:19:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2018-12-08 09:19:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 09:19:46,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:19:46,808 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, 1, 1, 1, 1, 1, 1] [2018-12-08 09:19:46,808 INFO L423 AbstractCegarLoop]: === Iteration 6 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:19:46,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:46,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1189855273, now seen corresponding path program 1 times [2018-12-08 09:19:46,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:19:46,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:19:46,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:46,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:19:46,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:19:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:19:46,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:19:46,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:19:46,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:19:46,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:19:46,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:19:46,862 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 7 states. [2018-12-08 09:19:46,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:19:46,928 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2018-12-08 09:19:46,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:19:46,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-12-08 09:19:46,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:19:46,930 INFO L225 Difference]: With dead ends: 137 [2018-12-08 09:19:46,930 INFO L226 Difference]: Without dead ends: 85 [2018-12-08 09:19:46,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-08 09:19:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-08 09:19:46,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2018-12-08 09:19:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-08 09:19:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2018-12-08 09:19:46,936 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 32 [2018-12-08 09:19:46,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:19:46,937 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2018-12-08 09:19:46,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:19:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2018-12-08 09:19:46,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 09:19:46,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:19:46,937 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, 1, 1, 1, 1, 1, 1] [2018-12-08 09:19:46,937 INFO L423 AbstractCegarLoop]: === Iteration 7 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:19:46,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:19:46,937 INFO L82 PathProgramCache]: Analyzing trace with hash -627183667, now seen corresponding path program 1 times [2018-12-08 09:19:46,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:19:46,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:19:46,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:46,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:19:46,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:19:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:19:47,191 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-08 09:19:47,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:19:47,192 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:19:47,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:19:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:19:47,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:19:47,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:47,235 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-08 09:19:47,238 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-08 09:19:47,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:19:47,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:47,249 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-08 09:19:47,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-12-08 09:19:47,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:47,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:47,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:47,277 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 22 treesize of output 34 [2018-12-08 09:19:47,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:19:47,287 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-08 09:19:47,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:42 [2018-12-08 09:19:47,335 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:19:47,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:19:47,362 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:19:47,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:19:47,381 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:19:47,384 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:19:47,394 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:19:47,397 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:19:47,404 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-08 09:19:47,404 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-12-08 09:19:51,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:51,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:51,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:51,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:51,462 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 21 treesize of output 25 [2018-12-08 09:19:51,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:19:51,487 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-08 09:19:51,490 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-08 09:19:51,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:51,497 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-08 09:19:51,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:51,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:51,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:51,505 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-08 09:19:51,505 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 09:19:51,515 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:51,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:51,528 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:51,550 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-08 09:19:51,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-08 09:19:51,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:51,556 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-08 09:19:51,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:51,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:51,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:19:51,563 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-08 09:19:51,563 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 09:19:51,570 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:51,574 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:51,580 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:51,596 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-08 09:19:51,596 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:89, output treesize:15 [2018-12-08 09:19:51,617 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-08 09:19:51,618 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-08 09:19:51,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:19:51,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:51,624 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-08 09:19:51,625 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-08 09:19:51,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:19:51,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:19:51,628 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-08 09:19:51,629 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-08 09:19:51,651 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-08 09:19:51,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:19:51,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2018-12-08 09:19:51,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-08 09:19:51,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-08 09:19:51,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=168, Unknown=2, NotChecked=0, Total=210 [2018-12-08 09:19:51,667 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand 15 states. [2018-12-08 09:20:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:20:10,607 INFO L93 Difference]: Finished difference Result 141 states and 176 transitions. [2018-12-08 09:20:10,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 09:20:10,608 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-12-08 09:20:10,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:20:10,609 INFO L225 Difference]: With dead ends: 141 [2018-12-08 09:20:10,609 INFO L226 Difference]: Without dead ends: 119 [2018-12-08 09:20:10,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=74, Invalid=302, Unknown=4, NotChecked=0, Total=380 [2018-12-08 09:20:10,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-08 09:20:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 74. [2018-12-08 09:20:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-08 09:20:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2018-12-08 09:20:10,615 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 32 [2018-12-08 09:20:10,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:20:10,615 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2018-12-08 09:20:10,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-08 09:20:10,615 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2018-12-08 09:20:10,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 09:20:10,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:20:10,616 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, 1, 1, 1, 1, 1, 1] [2018-12-08 09:20:10,616 INFO L423 AbstractCegarLoop]: === Iteration 8 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:20:10,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:20:10,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1408709991, now seen corresponding path program 1 times [2018-12-08 09:20:10,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:20:10,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:20:10,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:20:10,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:20:10,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:20:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:20:10,757 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-08 09:20:10,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:20:10,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:20:10,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:20:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:20:10,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:20:10,801 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:10,802 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-08 09:20:10,804 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-08 09:20:10,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:10,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:10,812 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-08 09:20:10,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-08 09:20:10,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:10,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:10,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:10,833 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 22 treesize of output 34 [2018-12-08 09:20:10,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:10,841 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-08 09:20:10,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:31 [2018-12-08 09:20:11,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:11,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:11,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:11,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:11,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2018-12-08 09:20:11,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:11,163 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-08 09:20:11,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:36 [2018-12-08 09:20:11,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-08 09:20:11,237 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-08 09:20:11,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:11,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:11,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:11,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:56, output treesize:41 [2018-12-08 09:20:11,952 WARN L180 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 98 [2018-12-08 09:20:11,985 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 21 treesize of output 18 [2018-12-08 09:20:11,994 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-08 09:20:12,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-12-08 09:20:12,046 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 15 [2018-12-08 09:20:12,047 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:12,079 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:12,112 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:12,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:12,367 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-08 09:20:12,371 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-08 09:20:12,378 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-08 09:20:12,378 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:12,390 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:12,429 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-08 09:20:12,435 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-08 09:20:12,436 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:12,446 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:12,462 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:12,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2018-12-08 09:20:12,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-12-08 09:20:12,479 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:12,511 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 29 treesize of output 26 [2018-12-08 09:20:12,512 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:12,535 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 25 treesize of output 19 [2018-12-08 09:20:12,549 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 24 [2018-12-08 09:20:12,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 41 [2018-12-08 09:20:12,583 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 6 xjuncts. [2018-12-08 09:20:12,622 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:20:12,648 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:20:12,724 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:20:12,878 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-08 09:20:12,892 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-08 09:20:12,893 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 09:20:12,930 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 39 treesize of output 36 [2018-12-08 09:20:12,930 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:12,935 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 40 treesize of output 37 [2018-12-08 09:20:12,936 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:12,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-08 09:20:12,964 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 24 [2018-12-08 09:20:12,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 41 [2018-12-08 09:20:12,989 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 6 xjuncts. [2018-12-08 09:20:13,016 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:20:13,034 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:20:13,054 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:20:13,065 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-08 09:20:13,069 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-08 09:20:13,074 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-08 09:20:13,075 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:13,082 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:13,103 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-08 09:20:13,108 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 18 treesize of output 7 [2018-12-08 09:20:13,108 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:13,116 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:13,124 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:13,189 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:13,192 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:13,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:13,255 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 47 treesize of output 48 [2018-12-08 09:20:13,258 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 29 treesize of output 32 [2018-12-08 09:20:13,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2018-12-08 09:20:13,271 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-12-08 09:20:13,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-12-08 09:20:13,281 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:13,287 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:13,292 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:13,298 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:13,306 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:13,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:13,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 80 [2018-12-08 09:20:13,379 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 09:20:13,380 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:13,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2018-12-08 09:20:13,472 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:13,543 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 4 case distinctions, treesize of input 51 treesize of output 55 [2018-12-08 09:20:13,544 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 4 xjuncts. [2018-12-08 09:20:13,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 59 [2018-12-08 09:20:13,618 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 8 xjuncts. [2018-12-08 09:20:13,682 INFO L267 ElimStorePlain]: Start of recursive call 36: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 09:20:13,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: 8 dim-0 vars, and 10 xjuncts. [2018-12-08 09:20:13,770 INFO L202 ElimStorePlain]: Needed 40 recursive calls to eliminate 11 variables, input treesize:203, output treesize:536 [2018-12-08 09:20:14,036 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 69 [2018-12-08 09:20:14,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:14,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:14,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:14,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:14,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:14,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:14,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:14,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 91 [2018-12-08 09:20:14,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:14,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:14,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:14,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:14,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:14,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:14,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:14,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:14,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 106 [2018-12-08 09:20:14,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:14,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 09:20:14,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 23 variables, input treesize:423, output treesize:114 [2018-12-08 09:20:14,281 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 58 treesize of output 50 [2018-12-08 09:20:14,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 25 [2018-12-08 09:20:14,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:14,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:14,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-12-08 09:20:14,309 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-08 09:20:14,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:14,314 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:14,333 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 77 treesize of output 67 [2018-12-08 09:20:14,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2018-12-08 09:20:14,336 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:14,345 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:14,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-12-08 09:20:14,362 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-08 09:20:14,362 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:14,368 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:14,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 09:20:14,382 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:136, output treesize:68 [2018-12-08 09:20:14,516 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-08 09:20:14,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:20:14,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2018-12-08 09:20:14,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-08 09:20:14,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-08 09:20:14,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=683, Unknown=1, NotChecked=0, Total=756 [2018-12-08 09:20:14,532 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand 28 states. [2018-12-08 09:20:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:20:16,336 INFO L93 Difference]: Finished difference Result 206 states and 270 transitions. [2018-12-08 09:20:16,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-08 09:20:16,337 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 32 [2018-12-08 09:20:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:20:16,338 INFO L225 Difference]: With dead ends: 206 [2018-12-08 09:20:16,338 INFO L226 Difference]: Without dead ends: 148 [2018-12-08 09:20:16,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=235, Invalid=2314, Unknown=1, NotChecked=0, Total=2550 [2018-12-08 09:20:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-08 09:20:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 96. [2018-12-08 09:20:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-08 09:20:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 121 transitions. [2018-12-08 09:20:16,352 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 121 transitions. Word has length 32 [2018-12-08 09:20:16,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:20:16,352 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 121 transitions. [2018-12-08 09:20:16,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-08 09:20:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2018-12-08 09:20:16,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 09:20:16,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:20:16,354 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:20:16,354 INFO L423 AbstractCegarLoop]: === Iteration 9 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:20:16,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:20:16,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1223285400, now seen corresponding path program 1 times [2018-12-08 09:20:16,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:20:16,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:20:16,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:20:16,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:20:16,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:20:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:20:16,578 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-08 09:20:16,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:20:16,578 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:20:16,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:20:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:20:16,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:20:16,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:16,625 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-08 09:20:16,627 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-08 09:20:16,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:16,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:16,636 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-08 09:20:16,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-08 09:20:16,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:16,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:16,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:16,662 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 22 treesize of output 34 [2018-12-08 09:20:16,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:16,671 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-08 09:20:16,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:31 [2018-12-08 09:20:17,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:17,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:17,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:17,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:17,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2018-12-08 09:20:17,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:17,232 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-08 09:20:17,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:36 [2018-12-08 09:20:17,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-08 09:20:17,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-08 09:20:17,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:17,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:17,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:17,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:41 [2018-12-08 09:20:18,060 WARN L180 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 100 [2018-12-08 09:20:18,094 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 21 treesize of output 18 [2018-12-08 09:20:18,101 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-08 09:20:18,121 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 23 [2018-12-08 09:20:18,162 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 15 [2018-12-08 09:20:18,162 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:18,200 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:18,233 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:18,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:18,502 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:18,510 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:18,714 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-08 09:20:18,718 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-08 09:20:18,723 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-08 09:20:18,723 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:18,732 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:18,761 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-08 09:20:18,766 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-08 09:20:18,767 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:18,775 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:18,789 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-08 09:20:18,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2018-12-08 09:20:18,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-12-08 09:20:18,803 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:18,837 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 29 treesize of output 26 [2018-12-08 09:20:18,837 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:18,855 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 25 treesize of output 19 [2018-12-08 09:20:18,866 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 24 [2018-12-08 09:20:18,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 41 [2018-12-08 09:20:18,894 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 6 xjuncts. [2018-12-08 09:20:18,924 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:20:18,945 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:20:18,998 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:20:19,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:19,139 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 47 treesize of output 48 [2018-12-08 09:20:19,143 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 29 treesize of output 32 [2018-12-08 09:20:19,150 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 32 treesize of output 34 [2018-12-08 09:20:19,163 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2018-12-08 09:20:19,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-12-08 09:20:19,182 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:19,192 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:19,202 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:19,213 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:19,232 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:19,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:19,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 80 [2018-12-08 09:20:19,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 67 [2018-12-08 09:20:19,384 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 8 xjuncts. [2018-12-08 09:20:19,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2018-12-08 09:20:19,594 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:19,722 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 4 case distinctions, treesize of input 51 treesize of output 55 [2018-12-08 09:20:19,723 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 4 xjuncts. [2018-12-08 09:20:19,944 INFO L267 ElimStorePlain]: Start of recursive call 24: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 09:20:20,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2018-12-08 09:20:20,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-12-08 09:20:20,141 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:20,154 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 36 treesize of output 28 [2018-12-08 09:20:20,173 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 43 [2018-12-08 09:20:20,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-12-08 09:20:20,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:20,388 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:20:20,389 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_41 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-08 09:20:20,391 INFO L168 Benchmark]: Toolchain (without parser) took 64741.25 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 248.0 MB). Free memory was 957.1 MB in the beginning and 998.4 MB in the end (delta: -41.3 MB). Peak memory consumption was 419.4 MB. Max. memory is 11.5 GB. [2018-12-08 09:20:20,391 INFO L168 Benchmark]: CDTParser took 0.14 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-08 09:20:20,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-08 09:20:20,392 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-08 09:20:20,392 INFO L168 Benchmark]: Boogie Preprocessor took 22.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:20:20,392 INFO L168 Benchmark]: RCFGBuilder took 279.15 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: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. [2018-12-08 09:20:20,392 INFO L168 Benchmark]: TraceAbstraction took 64148.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 104.9 MB). Free memory was 1.1 GB in the beginning and 998.4 MB in the end (delta: 79.3 MB). Peak memory consumption was 396.8 MB. Max. memory is 11.5 GB. [2018-12-08 09:20:20,393 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.14 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 270.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.15 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 279.15 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: 42.6 MB). Peak memory consumption was 42.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64148.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 104.9 MB). Free memory was 1.1 GB in the beginning and 998.4 MB in the end (delta: 79.3 MB). Peak memory consumption was 396.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_41 input size 11 context size 11 output size 11 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_41 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... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-08 09:20:21,611 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:20:21,612 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:20:21,618 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:20:21,618 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:20:21,619 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:20:21,619 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:20:21,620 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:20:21,621 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:20:21,621 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:20:21,622 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:20:21,622 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:20:21,622 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:20:21,623 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:20:21,623 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:20:21,624 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:20:21,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:20:21,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:20:21,626 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:20:21,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:20:21,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:20:21,627 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:20:21,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:20:21,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:20:21,629 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:20:21,629 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:20:21,630 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:20:21,630 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:20:21,630 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:20:21,631 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:20:21,631 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:20:21,631 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:20:21,631 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:20:21,632 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:20:21,632 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:20:21,632 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:20:21,633 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-08 09:20:21,640 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:20:21,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:20:21,640 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 09:20:21,640 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 09:20:21,641 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:20:21,641 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:20:21,641 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:20:21,641 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:20:21,641 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 09:20:21,641 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 09:20:21,641 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:20:21,642 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 09:20:21,642 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 09:20:21,642 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 09:20:21,642 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 09:20:21,642 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 09:20:21,642 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 09:20:21,642 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:20:21,642 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:20:21,642 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 09:20:21,642 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:20:21,642 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:20:21,643 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 09:20:21,643 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 09:20:21,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:20:21,643 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:20:21,643 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 09:20:21,643 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 09:20:21,643 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-08 09:20:21,643 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 09:20:21,643 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 09:20:21,643 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-08 09:20:21,643 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_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer 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 -> Automizer 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-08 09:20:21,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:20:21,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:20:21,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:20:21,671 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:20:21,672 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:20:21,672 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/../../sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-12-08 09:20:21,706 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/data/e665eb36f/e1777ee50e3f485094d7d77d1a38f592/FLAG130580efd [2018-12-08 09:20:22,144 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:20:22,145 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/sv-benchmarks/c/heap-data/packet_filter_true-unreach-call.i [2018-12-08 09:20:22,151 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/data/e665eb36f/e1777ee50e3f485094d7d77d1a38f592/FLAG130580efd [2018-12-08 09:20:22,159 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/data/e665eb36f/e1777ee50e3f485094d7d77d1a38f592 [2018-12-08 09:20:22,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:20:22,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:20:22,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:20:22,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:20:22,166 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:20:22,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:20:22" (1/1) ... [2018-12-08 09:20:22,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1e626f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:20:22, skipping insertion in model container [2018-12-08 09:20:22,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:20:22" (1/1) ... [2018-12-08 09:20:22,174 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:20:22,201 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:20:22,361 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:20:22,370 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:20:22,442 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:20:22,469 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:20:22,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:20:22 WrapperNode [2018-12-08 09:20:22,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:20:22,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:20:22,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:20:22,470 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:20:22,475 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:20:22" (1/1) ... [2018-12-08 09:20:22,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:20:22" (1/1) ... [2018-12-08 09:20:22,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:20:22,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:20:22,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:20:22,495 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:20:22,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:20:22" (1/1) ... [2018-12-08 09:20:22,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:20:22" (1/1) ... [2018-12-08 09:20:22,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:20:22" (1/1) ... [2018-12-08 09:20:22,506 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:20:22" (1/1) ... [2018-12-08 09:20:22,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:20:22" (1/1) ... [2018-12-08 09:20:22,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:20:22" (1/1) ... [2018-12-08 09:20:22,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:20:22" (1/1) ... [2018-12-08 09:20:22,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:20:22,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:20:22,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:20:22,525 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:20:22,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:20:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 09:20:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 09:20:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-08 09:20:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure receive [2018-12-08 09:20:22,556 INFO L138 BoogieDeclarations]: Found implementation of procedure receive [2018-12-08 09:20:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure process_prio_queue [2018-12-08 09:20:22,556 INFO L138 BoogieDeclarations]: Found implementation of procedure process_prio_queue [2018-12-08 09:20:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 09:20:22,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 09:20:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2018-12-08 09:20:22,556 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2018-12-08 09:20:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 09:20:22,556 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 09:20:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 09:20:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 09:20:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_charp [2018-12-08 09:20:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure send [2018-12-08 09:20:22,557 INFO L138 BoogieDeclarations]: Found implementation of procedure send [2018-12-08 09:20:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 09:20:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-08 09:20:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 09:20:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-12-08 09:20:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure process_normal_queue [2018-12-08 09:20:22,557 INFO L138 BoogieDeclarations]: Found implementation of procedure process_normal_queue [2018-12-08 09:20:22,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:20:22,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:20:24,847 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:20:24,847 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-08 09:20:24,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:20:24 BoogieIcfgContainer [2018-12-08 09:20:24,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:20:24,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 09:20:24,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 09:20:24,850 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 09:20:24,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 09:20:22" (1/3) ... [2018-12-08 09:20:24,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23cb0cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:20:24, skipping insertion in model container [2018-12-08 09:20:24,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:20:22" (2/3) ... [2018-12-08 09:20:24,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23cb0cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 09:20:24, skipping insertion in model container [2018-12-08 09:20:24,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:20:24" (3/3) ... [2018-12-08 09:20:24,852 INFO L112 eAbstractionObserver]: Analyzing ICFG packet_filter_true-unreach-call.i [2018-12-08 09:20:24,858 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 09:20:24,863 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-08 09:20:24,875 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-08 09:20:24,892 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:20:24,892 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 09:20:24,892 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 09:20:24,892 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 09:20:24,893 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:20:24,893 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:20:24,893 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 09:20:24,893 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:20:24,893 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 09:20:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-12-08 09:20:24,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 09:20:24,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:20:24,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:20:24,909 INFO L423 AbstractCegarLoop]: === Iteration 1 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:20:24,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:20:24,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1331955837, now seen corresponding path program 1 times [2018-12-08 09:20:24,915 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 09:20:24,915 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 09:20:24,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:20:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:20:24,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:20:24,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:20:24,986 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 09:20:24,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:20:24,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 09:20:24,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-08 09:20:25,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 09:20:25,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 09:20:25,004 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2018-12-08 09:20:25,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:20:25,019 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2018-12-08 09:20:25,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 09:20:25,020 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-12-08 09:20:25,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:20:25,026 INFO L225 Difference]: With dead ends: 99 [2018-12-08 09:20:25,026 INFO L226 Difference]: Without dead ends: 56 [2018-12-08 09:20:25,028 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-08 09:20:25,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-08 09:20:25,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-08 09:20:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-08 09:20:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2018-12-08 09:20:25,060 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 14 [2018-12-08 09:20:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:20:25,060 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-12-08 09:20:25,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-08 09:20:25,061 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-12-08 09:20:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 09:20:25,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:20:25,061 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:20:25,061 INFO L423 AbstractCegarLoop]: === Iteration 2 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:20:25,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:20:25,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2076658335, now seen corresponding path program 1 times [2018-12-08 09:20:25,062 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 09:20:25,062 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 09:20:25,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:20:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:20:25,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:20:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:20:25,105 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 09:20:25,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:20:25,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 09:20:25,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 09:20:25,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 09:20:25,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 09:20:25,108 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand 3 states. [2018-12-08 09:20:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:20:25,120 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-12-08 09:20:25,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 09:20:25,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-08 09:20:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:20:25,122 INFO L225 Difference]: With dead ends: 59 [2018-12-08 09:20:25,122 INFO L226 Difference]: Without dead ends: 57 [2018-12-08 09:20:25,122 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-08 09:20:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-08 09:20:25,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-08 09:20:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-08 09:20:25,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-12-08 09:20:25,129 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 14 [2018-12-08 09:20:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:20:25,129 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-12-08 09:20:25,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 09:20:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-12-08 09:20:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-08 09:20:25,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:20:25,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:20:25,130 INFO L423 AbstractCegarLoop]: === Iteration 3 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:20:25,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:20:25,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2076656413, now seen corresponding path program 1 times [2018-12-08 09:20:25,130 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 09:20:25,130 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 09:20:25,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:20:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:20:25,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:20:25,203 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-08 09:20:25,206 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-08 09:20:25,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:25,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:25,216 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-08 09:20:25,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 09:20:25,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:25,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:25,223 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-08 09:20:25,224 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-08 09:20:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:20:25,262 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 09:20:25,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:20:25,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 09:20:25,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 09:20:25,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 09:20:25,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 09:20:25,264 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 6 states. [2018-12-08 09:20:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:20:27,445 INFO L93 Difference]: Finished difference Result 93 states and 111 transitions. [2018-12-08 09:20:27,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:20:27,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-08 09:20:27,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:20:27,447 INFO L225 Difference]: With dead ends: 93 [2018-12-08 09:20:27,447 INFO L226 Difference]: Without dead ends: 66 [2018-12-08 09:20:27,447 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-08 09:20:27,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-08 09:20:27,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-12-08 09:20:27,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-08 09:20:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-12-08 09:20:27,454 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 14 [2018-12-08 09:20:27,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:20:27,454 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-12-08 09:20:27,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 09:20:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-12-08 09:20:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 09:20:27,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:20:27,455 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-08 09:20:27,455 INFO L423 AbstractCegarLoop]: === Iteration 4 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:20:27,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:20:27,455 INFO L82 PathProgramCache]: Analyzing trace with hash 644197206, now seen corresponding path program 1 times [2018-12-08 09:20:27,455 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 09:20:27,455 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/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-08 09:20:27,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:20:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:20:27,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:20:27,535 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-08 09:20:27,538 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-08 09:20:27,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:27,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:27,547 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-08 09:20:27,549 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-08 09:20:27,550 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:27,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:27,554 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-08 09:20:27,554 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-08 09:20:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:20:27,581 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 09:20:27,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:20:27,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 09:20:27,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 09:20:27,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:20:27,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:20:27,584 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 7 states. [2018-12-08 09:20:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:20:30,115 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2018-12-08 09:20:30,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 09:20:30,116 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-08 09:20:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:20:30,117 INFO L225 Difference]: With dead ends: 98 [2018-12-08 09:20:30,117 INFO L226 Difference]: Without dead ends: 76 [2018-12-08 09:20:30,117 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-08 09:20:30,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-08 09:20:30,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 58. [2018-12-08 09:20:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-08 09:20:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2018-12-08 09:20:30,124 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 20 [2018-12-08 09:20:30,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:20:30,125 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-12-08 09:20:30,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 09:20:30,125 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2018-12-08 09:20:30,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-08 09:20:30,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:20:30,126 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-08 09:20:30,126 INFO L423 AbstractCegarLoop]: === Iteration 5 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:20:30,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:20:30,126 INFO L82 PathProgramCache]: Analyzing trace with hash -309506550, now seen corresponding path program 1 times [2018-12-08 09:20:30,127 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 09:20:30,127 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 09:20:30,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:20:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:20:30,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:20:30,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:30,254 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-08 09:20:30,258 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-08 09:20:30,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:30,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:30,275 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-08 09:20:30,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-12-08 09:20:30,298 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-08 09:20:30,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:30,311 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-08 09:20:30,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-12-08 09:20:30,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:30,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:30,629 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:30,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:30,772 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:30,792 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:30,880 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:30,891 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:30,932 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-08 09:20:30,932 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-12-08 09:20:32,943 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-08 09:20:32,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:32,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:32,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:32,975 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-08 09:20:32,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:33,084 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-08 09:20:33,095 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-08 09:20:33,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:33,117 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-08 09:20:33,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:33,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:33,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:33,152 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-08 09:20:33,153 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:33,185 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:33,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:33,240 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:33,328 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-08 09:20:33,337 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-08 09:20:33,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:33,353 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-08 09:20:33,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:33,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:33,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:20:33,388 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-08 09:20:33,388 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:33,415 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:33,434 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:33,459 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:33,522 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-08 09:20:33,523 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:78, output treesize:15 [2018-12-08 09:20:33,541 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-08 09:20:33,543 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-08 09:20:33,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:33,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:33,551 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-08 09:20:33,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-08 09:20:33,552 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:33,554 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:33,556 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-08 09:20:33,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-08 09:20:33,603 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-08 09:20:33,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 09:20:34,122 WARN L180 SmtUtils]: Spent 514.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-08 09:20:34,478 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-08 09:20:35,234 WARN L180 SmtUtils]: Spent 753.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-08 09:20:35,925 WARN L180 SmtUtils]: Spent 690.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-08 09:20:38,322 WARN L180 SmtUtils]: Spent 2.39 s on a formula simplification that was a NOOP. DAG size: 109 [2018-12-08 09:20:38,325 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:38,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:38,406 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:38,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:38,481 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:38,546 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:38,547 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:38,636 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:44,903 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:44,984 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:44,985 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:45,070 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:45,071 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:45,168 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:49,946 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:50,007 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:50,008 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:50,046 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:50,047 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:50,088 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:53,162 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:53,197 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:53,198 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:53,238 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:53,239 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:53,272 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:53,273 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:53,310 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:54,591 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-08 09:20:54,616 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-08 09:20:54,617 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:54,637 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:20:54,638 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-08 09:20:54,662 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-08 09:20:55,585 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-08 09:20:55,607 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-08 09:20:55,607 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:55,619 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:55,620 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-08 09:20:55,634 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-08 09:20:56,104 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:56,135 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:56,136 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:56,155 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:56,156 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:56,180 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:56,511 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:56,529 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:56,529 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:56,540 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:56,541 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-08 09:20:56,556 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:20:56,815 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-08 09:20:56,815 INFO L202 ElimStorePlain]: Needed 53 recursive calls to eliminate 14 variables, input treesize:193, output treesize:131 [2018-12-08 09:21:03,024 WARN L180 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2018-12-08 09:21:03,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:21:03,027 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:21:03,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:21:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:21:03,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:21:03,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:03,079 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-08 09:21:03,082 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-08 09:21:03,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:03,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:03,100 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-08 09:21:03,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2018-12-08 09:21:03,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:03,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:03,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:03,110 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-08 09:21:03,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:03,127 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-08 09:21:03,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:46 [2018-12-08 09:21:03,166 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:03,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:03,460 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:03,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:03,586 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:03,600 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:03,662 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:03,671 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:03,706 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-08 09:21:03,706 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-12-08 09:21:05,723 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-08 09:21:05,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:05,753 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:05,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:05,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:05,763 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-08 09:21:05,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:05,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 09:21:05,921 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-08 09:21:05,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:05,945 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-08 09:21:05,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:05,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:05,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:05,977 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-08 09:21:05,977 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:06,013 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:06,042 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:06,080 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:06,192 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-08 09:21:06,207 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-08 09:21:06,219 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:06,224 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-08 09:21:06,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:06,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:06,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:06,257 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-08 09:21:06,257 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:06,290 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:06,313 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:06,351 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:06,433 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-08 09:21:06,434 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 13 variables, input treesize:93, output treesize:15 [2018-12-08 09:21:06,436 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-08 09:21:06,438 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-08 09:21:06,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:06,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:06,447 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-08 09:21:06,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-08 09:21:06,448 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:06,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:06,453 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-08 09:21:06,453 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-08 09:21:06,455 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-08 09:21:06,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 09:21:06,810 WARN L180 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-08 09:21:07,243 WARN L180 SmtUtils]: Spent 432.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-08 09:21:08,108 WARN L180 SmtUtils]: Spent 863.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-08 09:21:08,761 WARN L180 SmtUtils]: Spent 652.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-08 09:21:12,116 WARN L180 SmtUtils]: Spent 3.35 s on a formula simplification that was a NOOP. DAG size: 107 [2018-12-08 09:21:12,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:12,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:12,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:12,269 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:12,270 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:12,334 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:12,335 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:12,404 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:16,715 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:16,788 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:16,789 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:16,869 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:16,870 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:16,952 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:20,709 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:20,745 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:20,746 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:20,775 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:20,775 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:20,809 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:23,115 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:23,152 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:23,153 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:23,212 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:23,213 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:23,251 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:24,418 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:24,440 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-08 09:21:24,441 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-08 09:21:24,462 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-08 09:21:24,462 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:24,488 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:25,369 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:25,382 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:25,383 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-08 09:21:25,391 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-08 09:21:25,392 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-08 09:21:25,408 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-08 09:21:25,879 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:25,903 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:25,904 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:25,926 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:25,927 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:25,954 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:26,374 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:26,393 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:26,393 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:26,409 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:26,409 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:26,421 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:26,641 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-08 09:21:26,642 INFO L202 ElimStorePlain]: Needed 51 recursive calls to eliminate 14 variables, input treesize:193, output treesize:131 [2018-12-08 09:21:34,893 WARN L180 SmtUtils]: Spent 6.16 s on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2018-12-08 09:21:34,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:21:34,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2018-12-08 09:21:34,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-08 09:21:34,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 09:21:34,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=104, Unknown=3, NotChecked=42, Total=182 [2018-12-08 09:21:34,909 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 12 states. [2018-12-08 09:21:37,482 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-08 09:21:40,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:21:40,398 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2018-12-08 09:21:40,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 09:21:40,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-12-08 09:21:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:21:40,399 INFO L225 Difference]: With dead ends: 121 [2018-12-08 09:21:40,399 INFO L226 Difference]: Without dead ends: 94 [2018-12-08 09:21:40,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=54, Invalid=194, Unknown=4, NotChecked=90, Total=342 [2018-12-08 09:21:40,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-08 09:21:40,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 69. [2018-12-08 09:21:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-08 09:21:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2018-12-08 09:21:40,405 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 24 [2018-12-08 09:21:40,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:21:40,405 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2018-12-08 09:21:40,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-08 09:21:40,405 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2018-12-08 09:21:40,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 09:21:40,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:21:40,406 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-08 09:21:40,406 INFO L423 AbstractCegarLoop]: === Iteration 6 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:21:40,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:21:40,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1333878491, now seen corresponding path program 1 times [2018-12-08 09:21:40,406 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 09:21:40,406 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 09:21:40,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:21:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:21:40,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:21:40,529 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-08 09:21:40,532 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-08 09:21:40,535 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-08 09:21:40,535 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:40,537 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:40,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:40,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:40,542 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:26, output treesize:15 [2018-12-08 09:21:40,583 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-08 09:21:40,585 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-08 09:21:40,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:40,597 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-08 09:21:40,597 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:40,606 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-08 09:21:40,607 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:40,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:40,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:40,612 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-12-08 09:21:40,625 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-08 09:21:40,625 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 09:21:40,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:21:40,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 09:21:40,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 09:21:40,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 09:21:40,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-08 09:21:40,628 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 9 states. [2018-12-08 09:21:41,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:21:41,935 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions. [2018-12-08 09:21:41,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 09:21:41,938 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-12-08 09:21:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:21:41,939 INFO L225 Difference]: With dead ends: 133 [2018-12-08 09:21:41,939 INFO L226 Difference]: Without dead ends: 82 [2018-12-08 09:21:41,939 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-08 09:21:41,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-08 09:21:41,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-12-08 09:21:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-08 09:21:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2018-12-08 09:21:41,945 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 30 [2018-12-08 09:21:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:21:41,945 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2018-12-08 09:21:41,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 09:21:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2018-12-08 09:21:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 09:21:41,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:21:41,946 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-08 09:21:41,946 INFO L423 AbstractCegarLoop]: === Iteration 7 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:21:41,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:21:41,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1218673859, now seen corresponding path program 1 times [2018-12-08 09:21:41,946 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 09:21:41,946 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/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-08 09:21:41,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:21:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:21:42,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:21:42,068 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-08 09:21:42,071 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-08 09:21:42,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:42,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:42,082 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-08 09:21:42,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-12-08 09:21:42,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:42,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:42,099 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-08 09:21:42,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:42,112 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-08 09:21:42,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2018-12-08 09:21:42,174 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:42,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:42,456 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:42,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:42,612 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:42,625 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:42,684 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:42,693 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:42,731 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-08 09:21:42,731 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-12-08 09:21:44,741 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-08 09:21:44,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:44,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:44,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:44,777 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-08 09:21:44,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:44,890 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-08 09:21:44,898 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-08 09:21:44,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:44,914 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-08 09:21:44,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:44,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:44,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:44,947 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-08 09:21:44,947 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:44,976 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:44,999 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:45,029 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:45,126 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-08 09:21:45,135 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-08 09:21:45,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:45,153 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-08 09:21:45,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:45,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:45,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:21:45,180 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-08 09:21:45,180 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:45,206 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:45,226 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:45,256 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:45,321 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-08 09:21:45,321 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:78, output treesize:15 [2018-12-08 09:21:45,352 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-08 09:21:45,354 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-08 09:21:45,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:45,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:45,362 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-08 09:21:45,364 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-08 09:21:45,364 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:45,365 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:45,367 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-08 09:21:45,367 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-08 09:21:45,414 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-08 09:21:45,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 09:21:47,917 WARN L180 SmtUtils]: Spent 432.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-08 09:21:48,438 WARN L180 SmtUtils]: Spent 521.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-08 09:21:49,214 WARN L180 SmtUtils]: Spent 774.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-08 09:21:49,794 WARN L180 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-08 09:21:53,655 WARN L180 SmtUtils]: Spent 3.86 s on a formula simplification that was a NOOP. DAG size: 109 [2018-12-08 09:21:53,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:53,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:53,752 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:21:53,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:21:53,841 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:53,923 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:53,923 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:54,021 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:59,396 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:59,452 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:59,453 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:59,501 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:59,502 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:59,538 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:59,539 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:21:59,583 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:04,036 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:04,069 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:04,070 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-08 09:22:04,106 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-08 09:22:04,106 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:04,128 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:04,129 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:04,152 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:07,696 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:07,714 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:07,715 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:07,725 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:07,726 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:07,741 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:07,741 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:07,750 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:09,440 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-08 09:22:09,511 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-08 09:22:09,512 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-08 09:22:09,599 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-08 09:22:09,600 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-08 09:22:09,683 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-08 09:22:10,960 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,009 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,010 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,047 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,048 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,091 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,916 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,935 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,936 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,959 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,960 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,980 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:12,465 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-08 09:22:12,485 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-08 09:22:12,486 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:12,499 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:12,499 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-08 09:22:12,510 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-08 09:22:12,879 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-08 09:22:12,879 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 14 variables, input treesize:193, output treesize:158 [2018-12-08 09:22:14,297 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 105 DAG size of output: 49 [2018-12-08 09:22:14,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:22:14,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/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-08 09:22:14,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:14,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:14,341 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-08 09:22:14,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-08 09:22:14,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:14,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:14,355 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-08 09:22:14,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:25 [2018-12-08 09:22:14,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:14,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:14,360 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-08 09:22:14,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:14,371 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-08 09:22:14,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2018-12-08 09:22:14,375 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:14,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:14,614 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:14,653 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:14,766 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:14,779 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:14,866 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:14,877 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:14,913 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-08 09:22:14,914 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:100, output treesize:48 [2018-12-08 09:22:16,922 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-08 09:22:16,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:16,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:16,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:16,951 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-08 09:22:16,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:17,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 09:22:17,081 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-08 09:22:17,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:17,099 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-08 09:22:17,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:17,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:17,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:17,128 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-08 09:22:17,128 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:17,158 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:17,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:17,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:17,306 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-08 09:22:17,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-08 09:22:17,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:17,332 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-08 09:22:17,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:17,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:17,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:17,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-08 09:22:17,363 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:17,389 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:17,409 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:17,439 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:17,507 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-08 09:22:17,508 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:78, output treesize:15 [2018-12-08 09:22:17,512 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-08 09:22:17,514 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-08 09:22:17,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:17,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:17,522 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-08 09:22:17,523 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-08 09:22:17,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:17,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:17,527 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-08 09:22:17,527 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-12-08 09:22:17,529 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-08 09:22:17,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 09:22:20,160 WARN L180 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-08 09:22:20,496 WARN L180 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-08 09:22:21,207 WARN L180 SmtUtils]: Spent 709.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-12-08 09:22:21,923 WARN L180 SmtUtils]: Spent 715.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-12-08 09:22:25,376 WARN L180 SmtUtils]: Spent 3.45 s on a formula simplification that was a NOOP. DAG size: 108 [2018-12-08 09:22:25,378 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:25,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:25,457 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:25,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:25,554 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:25,655 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:25,655 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:25,736 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:32,908 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:32,955 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:32,955 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:33,005 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:33,006 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:33,049 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:33,050 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:33,088 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:39,629 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:39,666 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:39,667 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:39,695 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:39,696 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:39,733 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:39,733 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:39,756 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:43,447 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:43,523 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:43,524 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:43,612 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:43,613 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:43,683 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:45,839 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:45,851 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:45,852 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:45,871 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:45,871 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:45,887 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:45,888 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:45,896 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:46,952 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-08 09:22:46,992 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-08 09:22:46,993 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-08 09:22:47,041 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-08 09:22:47,042 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:47,080 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-08 09:22:47,890 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:47,910 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:47,911 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:47,934 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:47,934 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:47,956 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:48,480 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-08 09:22:48,500 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-08 09:22:48,501 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-08 09:22:48,511 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-08 09:22:48,511 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:48,520 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:48,881 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-08 09:22:48,881 INFO L202 ElimStorePlain]: Needed 57 recursive calls to eliminate 14 variables, input treesize:193, output treesize:158 [2018-12-08 09:22:57,135 WARN L180 SmtUtils]: Spent 6.13 s on a formula simplification. DAG size of input: 104 DAG size of output: 44 [2018-12-08 09:22:57,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:22:57,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-08 09:22:57,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 09:22:57,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 09:22:57,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=146, Unknown=4, NotChecked=50, Total=240 [2018-12-08 09:22:57,151 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand 13 states. [2018-12-08 09:22:59,802 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-08 09:23:02,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:23:02,419 INFO L93 Difference]: Finished difference Result 117 states and 147 transitions. [2018-12-08 09:23:02,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 09:23:02,420 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-12-08 09:23:02,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 09:23:02,421 INFO L225 Difference]: With dead ends: 117 [2018-12-08 09:23:02,421 INFO L226 Difference]: Without dead ends: 95 [2018-12-08 09:23:02,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=69, Invalid=244, Unknown=5, NotChecked=102, Total=420 [2018-12-08 09:23:02,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-08 09:23:02,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 71. [2018-12-08 09:23:02,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-08 09:23:02,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2018-12-08 09:23:02,429 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 30 [2018-12-08 09:23:02,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 09:23:02,429 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2018-12-08 09:23:02,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 09:23:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2018-12-08 09:23:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-08 09:23:02,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 09:23:02,430 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-08 09:23:02,430 INFO L423 AbstractCegarLoop]: === Iteration 8 === [process_prio_queueErr0ASSERT_VIOLATIONERROR_FUNCTION, process_normal_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 09:23:02,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:23:02,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1756580317, now seen corresponding path program 1 times [2018-12-08 09:23:02,431 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 09:23:02,431 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_959c4ee3-8c11-46d4-9241-a3919ecbb889/bin-2019/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 09:23:02,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:23:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:23:02,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:23:02,616 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-08 09:23:02,618 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-08 09:23:02,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:02,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:02,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:23:02,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:9 [2018-12-08 09:23:28,902 WARN L180 SmtUtils]: Spent 26.27 s on a formula simplification. DAG size of input: 118 DAG size of output: 93 [2018-12-08 09:23:28,903 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:23:29,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:23:39,062 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:23:39,646 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:23:48,227 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:23:48,674 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:23:57,008 INFO L303 Elim1Store]: Index analysis took 1566 ms [2018-12-08 09:23:57,009 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-08 09:23:57,125 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-12-08 09:23:57,126 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-08 09:23:57,341 INFO L303 Elim1Store]: Index analysis took 214 ms [2018-12-08 09:23:57,341 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-08 09:23:57,342 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 09:23:57,945 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:24:00,266 INFO L303 Elim1Store]: Index analysis took 978 ms [2018-12-08 09:24:00,267 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-08 09:24:00,486 INFO L303 Elim1Store]: Index analysis took 218 ms [2018-12-08 09:24:00,487 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-08 09:24:00,487 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 09:24:00,967 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:24:01,348 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-08 09:24:01,864 INFO L303 Elim1Store]: Index analysis took 515 ms [2018-12-08 09:24:01,864 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-08 09:24:02,020 INFO L303 Elim1Store]: Index analysis took 154 ms [2018-12-08 09:24:02,046 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-08 09:24:02,046 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-08 09:24:04,758 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-08 09:24:05,194 INFO L303 Elim1Store]: Index analysis took 435 ms [2018-12-08 09:24:05,196 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-08 09:24:05,197 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 09:24:05,650 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:24:05,683 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-08 09:24:05,896 INFO L303 Elim1Store]: Index analysis took 212 ms [2018-12-08 09:24:05,897 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-08 09:24:05,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:24:06,131 INFO L303 Elim1Store]: Index analysis took 233 ms [2018-12-08 09:24:06,131 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-08 09:24:06,277 INFO L303 Elim1Store]: Index analysis took 145 ms [2018-12-08 09:24:06,478 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 09:24:06,479 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-08 09:24:06,483 INFO L168 Benchmark]: Toolchain (without parser) took 224321.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.2 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -79.3 MB). Peak memory consumption was 108.9 MB. Max. memory is 11.5 GB. [2018-12-08 09:24:06,484 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-08 09:24:06,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2018-12-08 09:24:06,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.99 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-08 09:24:06,485 INFO L168 Benchmark]: Boogie Preprocessor took 29.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:24:06,485 INFO L168 Benchmark]: RCFGBuilder took 2322.49 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.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-12-08 09:24:06,485 INFO L168 Benchmark]: TraceAbstraction took 221634.67 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.3 MB). Peak memory consumption was 97.1 MB. Max. memory is 11.5 GB. [2018-12-08 09:24:06,487 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 306.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.99 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.57 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 2322.49 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.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 221634.67 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 48.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.3 MB). Peak memory consumption was 97.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_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...