./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.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_d8cba08f-3cb7-474f-aa9a-973f165e3392/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/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 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:30:38,377 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:30:38,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:30:38,384 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:30:38,384 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:30:38,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:30:38,385 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:30:38,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:30:38,387 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:30:38,387 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:30:38,388 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:30:38,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:30:38,388 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:30:38,389 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:30:38,389 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:30:38,390 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:30:38,390 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:30:38,391 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:30:38,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:30:38,392 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:30:38,393 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:30:38,393 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:30:38,394 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:30:38,394 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:30:38,395 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:30:38,395 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:30:38,395 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:30:38,396 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:30:38,396 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:30:38,397 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:30:38,397 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:30:38,397 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:30:38,397 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:30:38,397 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:30:38,398 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:30:38,398 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:30:38,398 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 02:30:38,405 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:30:38,405 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:30:38,406 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:30:38,406 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:30:38,406 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:30:38,406 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:30:38,406 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 02:30:38,406 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:30:38,406 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:30:38,406 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:30:38,407 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:30:38,407 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:30:38,407 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 02:30:38,407 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:30:38,407 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 02:30:38,407 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:30:38,407 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:30:38,407 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 02:30:38,407 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 02:30:38,407 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:30:38,407 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:30:38,407 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:30:38,408 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:30:38,408 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:30:38,408 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:30:38,408 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:30:38,408 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 02:30:38,408 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 02:30:38,408 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:30:38,408 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 02:30:38,408 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_d8cba08f-3cb7-474f-aa9a-973f165e3392/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 -> 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 [2018-12-02 02:30:38,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:30:38,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:30:38,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:30:38,434 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:30:38,434 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:30:38,435 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/bin-2019/uautomizer/../../sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-12-02 02:30:38,470 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/bin-2019/uautomizer/data/53deaf4a1/327d8bf193914e68b2138fac509970d0/FLAG7de190a87 [2018-12-02 02:30:38,784 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:30:38,785 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/sv-benchmarks/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-12-02 02:30:38,791 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/bin-2019/uautomizer/data/53deaf4a1/327d8bf193914e68b2138fac509970d0/FLAG7de190a87 [2018-12-02 02:30:38,802 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/bin-2019/uautomizer/data/53deaf4a1/327d8bf193914e68b2138fac509970d0 [2018-12-02 02:30:38,804 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:30:38,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:30:38,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:30:38,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:30:38,808 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:30:38,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:30:38" (1/1) ... [2018-12-02 02:30:38,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:38, skipping insertion in model container [2018-12-02 02:30:38,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:30:38" (1/1) ... [2018-12-02 02:30:38,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:30:38,840 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:30:38,993 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:30:39,031 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:30:39,058 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:30:39,080 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:30:39,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:39 WrapperNode [2018-12-02 02:30:39,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:30:39,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:30:39,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:30:39,080 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:30:39,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:39" (1/1) ... [2018-12-02 02:30:39,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:39" (1/1) ... [2018-12-02 02:30:39,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:30:39,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:30:39,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:30:39,098 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:30:39,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:39" (1/1) ... [2018-12-02 02:30:39,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:39" (1/1) ... [2018-12-02 02:30:39,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:39" (1/1) ... [2018-12-02 02:30:39,106 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:39" (1/1) ... [2018-12-02 02:30:39,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:39" (1/1) ... [2018-12-02 02:30:39,113 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:39" (1/1) ... [2018-12-02 02:30:39,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:39" (1/1) ... [2018-12-02 02:30:39,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:30:39,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:30:39,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:30:39,116 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:30:39,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/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-02 02:30:39,146 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2018-12-02 02:30:39,146 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2018-12-02 02:30:39,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 02:30:39,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 02:30:39,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 02:30:39,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 02:30:39,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 02:30:39,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 02:30:39,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 02:30:39,147 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 02:30:39,147 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 02:30:39,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 02:30:39,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 02:30:39,147 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2018-12-02 02:30:39,147 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2018-12-02 02:30:39,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 02:30:39,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:30:39,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:30:39,311 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:30:39,311 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 02:30:39,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:30:39 BoogieIcfgContainer [2018-12-02 02:30:39,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:30:39,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 02:30:39,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 02:30:39,314 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 02:30:39,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:30:38" (1/3) ... [2018-12-02 02:30:39,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfafe52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:30:39, skipping insertion in model container [2018-12-02 02:30:39,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:39" (2/3) ... [2018-12-02 02:30:39,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bfafe52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:30:39, skipping insertion in model container [2018-12-02 02:30:39,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:30:39" (3/3) ... [2018-12-02 02:30:39,316 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search_false-unreach-call_false-valid-memcleanup.i [2018-12-02 02:30:39,321 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 02:30:39,325 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 02:30:39,334 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 02:30:39,350 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 02:30:39,351 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 02:30:39,351 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 02:30:39,351 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 02:30:39,351 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:30:39,351 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:30:39,351 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 02:30:39,351 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:30:39,351 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 02:30:39,361 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-12-02 02:30:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 02:30:39,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:30:39,365 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:30:39,367 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:30:39,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:30:39,370 INFO L82 PathProgramCache]: Analyzing trace with hash -658334123, now seen corresponding path program 1 times [2018-12-02 02:30:39,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:30:39,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:30:39,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:30:39,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:30:39,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:30:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:30:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 02:30:39,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:30:39,526 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/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-02 02:30:39,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:30:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:30:39,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:30:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-02 02:30:39,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 02:30:39,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2018-12-02 02:30:39,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 02:30:39,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 02:30:39,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 02:30:39,640 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 6 states. [2018-12-02 02:30:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:30:39,784 INFO L93 Difference]: Finished difference Result 95 states and 133 transitions. [2018-12-02 02:30:39,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 02:30:39,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-12-02 02:30:39,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:30:39,791 INFO L225 Difference]: With dead ends: 95 [2018-12-02 02:30:39,791 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 02:30:39,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-12-02 02:30:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 02:30:39,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2018-12-02 02:30:39,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 02:30:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-02 02:30:39,820 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 45 [2018-12-02 02:30:39,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:30:39,820 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-02 02:30:39,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 02:30:39,820 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-12-02 02:30:39,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 02:30:39,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:30:39,821 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:30:39,822 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:30:39,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:30:39,822 INFO L82 PathProgramCache]: Analyzing trace with hash 369290796, now seen corresponding path program 1 times [2018-12-02 02:30:39,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:30:39,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:30:39,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:30:39,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:30:39,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:30:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:30:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 02:30:39,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:30:39,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 02:30:39,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 02:30:39,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 02:30:39,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-12-02 02:30:39,947 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 10 states. [2018-12-02 02:30:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:30:40,143 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-12-02 02:30:40,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 02:30:40,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-12-02 02:30:40,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:30:40,145 INFO L225 Difference]: With dead ends: 56 [2018-12-02 02:30:40,145 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 02:30:40,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-12-02 02:30:40,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 02:30:40,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-12-02 02:30:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 02:30:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-12-02 02:30:40,150 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 47 [2018-12-02 02:30:40,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:30:40,151 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-02 02:30:40,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 02:30:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-12-02 02:30:40,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 02:30:40,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:30:40,152 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:30:40,152 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:30:40,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:30:40,152 INFO L82 PathProgramCache]: Analyzing trace with hash -23736214, now seen corresponding path program 1 times [2018-12-02 02:30:40,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:30:40,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:30:40,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:30:40,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:30:40,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:30:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:30:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-02 02:30:40,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:30:40,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 02:30:40,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 02:30:40,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 02:30:40,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 02:30:40,199 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 7 states. [2018-12-02 02:30:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:30:40,279 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-12-02 02:30:40,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 02:30:40,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-12-02 02:30:40,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:30:40,280 INFO L225 Difference]: With dead ends: 54 [2018-12-02 02:30:40,281 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 02:30:40,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-02 02:30:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 02:30:40,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-12-02 02:30:40,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 02:30:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-12-02 02:30:40,285 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 47 [2018-12-02 02:30:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:30:40,286 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-02 02:30:40,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 02:30:40,286 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-12-02 02:30:40,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 02:30:40,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:30:40,286 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:30:40,287 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:30:40,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:30:40,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1979191460, now seen corresponding path program 1 times [2018-12-02 02:30:40,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:30:40,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:30:40,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:30:40,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:30:40,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:30:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:30:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-02 02:30:40,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:30:40,643 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/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-02 02:30:40,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:30:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:30:40,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:30:40,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:30:40,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:30:40,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:40,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-02 02:30:40,717 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 22 treesize of output 19 [2018-12-02 02:30:40,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-12-02 02:30:40,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:30:40,722 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 22 treesize of output 14 [2018-12-02 02:30:40,722 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:30:40,726 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:40,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:40,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:40,732 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2018-12-02 02:30:40,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:30:40,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:30:40,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:30:40,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:40,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:30:40,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:30:40,808 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:30:40,810 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:40,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:30:40,817 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:57, output treesize:49 [2018-12-02 02:30:41,803 WARN L180 SmtUtils]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-02 02:30:42,383 WARN L180 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-02 02:30:42,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:30:42,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:30:42,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-12-02 02:30:42,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:30:42,401 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 36 treesize of output 43 [2018-12-02 02:30:42,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-12-02 02:30:42,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:30:42,406 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 22 treesize of output 14 [2018-12-02 02:30:42,406 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:30:42,409 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:42,414 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:42,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:42,419 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:36 [2018-12-02 02:30:42,647 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 02:30:42,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:30:42,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:42,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:1 [2018-12-02 02:30:42,654 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-02 02:30:42,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:30:42,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 30 [2018-12-02 02:30:42,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-02 02:30:42,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-02 02:30:42,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=780, Unknown=1, NotChecked=0, Total=870 [2018-12-02 02:30:42,669 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 30 states. [2018-12-02 02:30:43,704 WARN L180 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-12-02 02:30:45,959 WARN L180 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2018-12-02 02:30:47,192 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-12-02 02:30:49,195 WARN L180 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2018-12-02 02:30:49,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:30:49,622 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-12-02 02:30:49,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 02:30:49,623 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 50 [2018-12-02 02:30:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:30:49,623 INFO L225 Difference]: With dead ends: 66 [2018-12-02 02:30:49,623 INFO L226 Difference]: Without dead ends: 50 [2018-12-02 02:30:49,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=250, Invalid=2005, Unknown=1, NotChecked=0, Total=2256 [2018-12-02 02:30:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-02 02:30:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-12-02 02:30:49,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 02:30:49,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-12-02 02:30:49,630 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 50 [2018-12-02 02:30:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:30:49,630 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-12-02 02:30:49,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-02 02:30:49,630 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-12-02 02:30:49,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 02:30:49,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:30:49,631 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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-02 02:30:49,632 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:30:49,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:30:49,632 INFO L82 PathProgramCache]: Analyzing trace with hash -596828116, now seen corresponding path program 2 times [2018-12-02 02:30:49,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:30:49,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:30:49,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:30:49,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:30:49,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:30:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:30:50,403 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2018-12-02 02:30:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:30:50,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:30:50,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/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-02 02:30:50,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 02:30:50,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 02:30:50,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 02:30:50,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:30:50,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:30:50,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:30:50,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:50,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-02 02:30:50,940 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 22 treesize of output 19 [2018-12-02 02:30:50,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-12-02 02:30:50,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:30:50,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 02:30:50,945 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 02:30:50,948 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:50,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:50,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:50,954 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:16 [2018-12-02 02:30:51,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:30:51,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:30:51,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:30:51,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:51,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:30:51,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:30:51,023 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:30:51,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:51,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:30:51,033 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:55 [2018-12-02 02:30:51,473 WARN L180 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-02 02:30:51,895 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-02 02:30:51,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:30:51,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:30:51,906 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 39 [2018-12-02 02:30:51,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:30:51,925 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 36 treesize of output 43 [2018-12-02 02:30:51,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-12-02 02:30:51,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:30:51,930 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 22 treesize of output 14 [2018-12-02 02:30:51,931 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:30:51,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:51,936 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:51,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:51,944 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:52 [2018-12-02 02:30:52,072 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:30:52,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:30:52,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:30:52,103 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:52,120 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:30:52,122 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:30:52,135 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:30:52,138 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:30:52,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 02:30:52,148 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:117, output treesize:63 [2018-12-02 02:31:02,458 WARN L180 SmtUtils]: Spent 1.96 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-02 02:31:05,383 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-02 02:31:05,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:31:05,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:31:05,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:31:05,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-12-02 02:31:05,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:31:05,414 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 34 treesize of output 39 [2018-12-02 02:31:05,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-12-02 02:31:05,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:31:05,420 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 22 treesize of output 14 [2018-12-02 02:31:05,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:31:05,423 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:31:05,428 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:31:05,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:31:05,445 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 44 treesize of output 59 [2018-12-02 02:31:05,448 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 28 treesize of output 27 [2018-12-02 02:31:05,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:31:05,451 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-12-02 02:31:05,451 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 02:31:05,456 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:31:05,462 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:31:05,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:31:05,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-12-02 02:31:05,480 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 13 treesize of output 16 [2018-12-02 02:31:05,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:31:05,483 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 16 treesize of output 23 [2018-12-02 02:31:05,484 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 02:31:05,487 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:31:05,491 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:31:05,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:31:05,502 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 8 variables, input treesize:103, output treesize:77 [2018-12-02 02:31:05,933 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-02 02:31:05,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:31:05,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:31:05,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:114, output treesize:1 [2018-12-02 02:31:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:31:05,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:31:05,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 22] total 42 [2018-12-02 02:31:05,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-02 02:31:05,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-02 02:31:05,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1595, Unknown=8, NotChecked=0, Total=1722 [2018-12-02 02:31:05,970 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 42 states. [2018-12-02 02:31:11,717 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2018-12-02 02:31:16,320 WARN L180 SmtUtils]: Spent 4.44 s on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2018-12-02 02:31:20,756 WARN L180 SmtUtils]: Spent 4.38 s on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2018-12-02 02:31:29,362 WARN L180 SmtUtils]: Spent 5.09 s on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2018-12-02 02:31:33,915 WARN L180 SmtUtils]: Spent 4.49 s on a formula simplification. DAG size of input: 104 DAG size of output: 65 [2018-12-02 02:31:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:31:38,428 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-12-02 02:31:38,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 02:31:38,428 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 53 [2018-12-02 02:31:38,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:31:38,429 INFO L225 Difference]: With dead ends: 70 [2018-12-02 02:31:38,429 INFO L226 Difference]: Without dead ends: 61 [2018-12-02 02:31:38,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 39.1s TimeCoverageRelationStatistics Valid=319, Invalid=3213, Unknown=8, NotChecked=0, Total=3540 [2018-12-02 02:31:38,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-02 02:31:38,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-12-02 02:31:38,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 02:31:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-12-02 02:31:38,435 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 53 [2018-12-02 02:31:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:31:38,435 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-12-02 02:31:38,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-02 02:31:38,435 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-12-02 02:31:38,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 02:31:38,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:31:38,436 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:31:38,436 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:31:38,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:31:38,436 INFO L82 PathProgramCache]: Analyzing trace with hash -989855126, now seen corresponding path program 1 times [2018-12-02 02:31:38,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:31:38,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:31:38,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:31:38,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 02:31:38,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:31:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:31:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:31:38,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 02:31:38,796 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/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-02 02:31:38,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:31:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:31:38,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 02:31:38,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 02:31:38,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:31:38,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:31:38,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-12-02 02:31:38,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:31:38,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:31:38,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:31:38,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:31:38,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:31:38,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-12-02 02:31:38,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 02:31:38,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 02:31:38,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 02:31:38,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:31:38,929 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:31:38,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:31:38,940 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 02:31:38,942 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:31:38,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 02:31:38,949 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:65, output treesize:34 [2018-12-02 02:31:39,757 WARN L180 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-02 02:31:40,200 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-12-02 02:31:40,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:31:40,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:31:40,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 02:31:40,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 02:31:40,216 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 27 treesize of output 28 [2018-12-02 02:31:40,217 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 13 treesize of output 16 [2018-12-02 02:31:40,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 02:31:40,219 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-02 02:31:40,220 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 02:31:40,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:31:40,227 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:31:40,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 02:31:40,232 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:49, output treesize:39 [2018-12-02 02:31:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 02:31:40,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 02:31:40,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18] total 32 [2018-12-02 02:31:40,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-02 02:31:40,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-02 02:31:40,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=899, Unknown=1, NotChecked=0, Total=992 [2018-12-02 02:31:40,397 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 32 states. [2018-12-02 02:31:41,366 WARN L180 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2018-12-02 02:31:43,230 WARN L180 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-12-02 02:31:44,258 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-12-02 02:31:45,167 WARN L180 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-12-02 02:31:46,955 WARN L180 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-12-02 02:31:47,926 WARN L180 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2018-12-02 02:31:49,922 WARN L180 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2018-12-02 02:31:51,064 WARN L180 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-12-02 02:31:51,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:31:51,450 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-12-02 02:31:51,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 02:31:51,450 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 53 [2018-12-02 02:31:51,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:31:51,451 INFO L225 Difference]: With dead ends: 76 [2018-12-02 02:31:51,451 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 02:31:51,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=383, Invalid=2586, Unknown=1, NotChecked=0, Total=2970 [2018-12-02 02:31:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 02:31:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-12-02 02:31:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 02:31:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-12-02 02:31:51,457 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 53 [2018-12-02 02:31:51,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:31:51,457 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-12-02 02:31:51,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-02 02:31:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-12-02 02:31:51,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 02:31:51,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:31:51,458 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:31:51,458 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:31:51,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:31:51,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1243118940, now seen corresponding path program 3 times [2018-12-02 02:31:51,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:31:51,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:31:51,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:31:51,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:31:51,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:31:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:31:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 02:31:51,523 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 02:31:51,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:31:51 BoogieIcfgContainer [2018-12-02 02:31:51,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 02:31:51,558 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:31:51,558 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:31:51,558 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:31:51,558 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:30:39" (3/4) ... [2018-12-02 02:31:51,560 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 02:31:51,603 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d8cba08f-3cb7-474f-aa9a-973f165e3392/bin-2019/uautomizer/witness.graphml [2018-12-02 02:31:51,603 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:31:51,603 INFO L168 Benchmark]: Toolchain (without parser) took 72799.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 272.6 MB). Free memory was 957.1 MB in the beginning and 1.3 GB in the end (delta: -310.2 MB). Peak memory consumption was 439.4 MB. Max. memory is 11.5 GB. [2018-12-02 02:31:51,604 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:31:51,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 275.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. [2018-12-02 02:31:51,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:31:51,604 INFO L168 Benchmark]: Boogie Preprocessor took 17.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:31:51,604 INFO L168 Benchmark]: RCFGBuilder took 195.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-02 02:31:51,604 INFO L168 Benchmark]: TraceAbstraction took 72246.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 801.3 MB in the end (delta: 305.7 MB). Peak memory consumption was 441.5 MB. Max. memory is 11.5 GB. [2018-12-02 02:31:51,604 INFO L168 Benchmark]: Witness Printer took 44.84 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -11.0 MB). Free memory was 801.3 MB in the beginning and 1.3 GB in the end (delta: -466.0 MB). Peak memory consumption was 8.2 kB. Max. memory is 11.5 GB. [2018-12-02 02:31:51,605 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 275.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 30.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.21 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 195.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 72246.17 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 801.3 MB in the end (delta: 305.7 MB). Peak memory consumption was 441.5 MB. Max. memory is 11.5 GB. * Witness Printer took 44.84 ms. Allocated memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: -11.0 MB). Free memory was 801.3 MB in the beginning and 1.3 GB in the end (delta: -466.0 MB). Peak memory consumption was 8.2 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L623] mlist *head; VAL [\old(head)=36, \old(head)=23, head={0:0}] [L644] int i; [L645] mlist *mylist, *temp; VAL [\old(head)=0, \old(head)=0, head={0:0}] [L646] CALL insert_list(mylist,2) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, l={16:32}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={16:32}, l={30:0}, malloc(sizeof(mlist))={30:0}] [L634] COND TRUE head==((void *)0) [L635] l->next = ((void *)0) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={0:0}, k=2, l={16:32}, l={30:0}, malloc(sizeof(mlist))={30:0}] [L640] head = l [L641] return 0; VAL [\old(head)=0, \old(head)=0, \old(k)=2, \result=0, head={30:0}, k=2, l={30:0}, l={16:32}, malloc(sizeof(mlist))={30:0}] [L646] RET insert_list(mylist,2) VAL [\old(head)=0, \old(head)=0, head={30:0}, insert_list(mylist,2)=0, mylist={16:32}] [L647] CALL insert_list(mylist,5) VAL [\old(head)=0, \old(head)=30, \old(k)=5, head={30:0}, l={16:32}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [\old(head)=30, \old(head)=0, \old(k)=5, head={30:0}, k=5, l={31:0}, l={16:32}, malloc(sizeof(mlist))={31:0}] [L634] COND FALSE !(head==((void *)0)) [L637] l->key = k [L638] l->next = head VAL [\old(head)=30, \old(head)=0, \old(k)=5, head={30:0}, k=5, l={16:32}, l={31:0}, malloc(sizeof(mlist))={31:0}] [L640] head = l [L641] return 0; VAL [\old(head)=30, \old(head)=0, \old(k)=5, \result=0, head={31:0}, k=5, l={31:0}, l={16:32}, malloc(sizeof(mlist))={31:0}] [L647] RET insert_list(mylist,5) VAL [\old(head)=0, \old(head)=0, head={31:0}, insert_list(mylist,5)=0, mylist={16:32}] [L648] CALL insert_list(mylist,1) VAL [\old(head)=0, \old(head)=31, \old(k)=1, head={31:0}, l={16:32}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [\old(head)=31, \old(head)=0, \old(k)=1, head={31:0}, k=1, l={16:32}, l={15:0}, malloc(sizeof(mlist))={15:0}] [L634] COND FALSE !(head==((void *)0)) [L637] l->key = k [L638] l->next = head VAL [\old(head)=31, \old(head)=0, \old(k)=1, head={31:0}, k=1, l={15:0}, l={16:32}, malloc(sizeof(mlist))={15:0}] [L640] head = l [L641] return 0; VAL [\old(head)=0, \old(head)=31, \old(k)=1, \result=0, head={15:0}, k=1, l={16:32}, l={15:0}, malloc(sizeof(mlist))={15:0}] [L648] RET insert_list(mylist,1) VAL [\old(head)=0, \old(head)=0, head={15:0}, insert_list(mylist,1)=0, mylist={16:32}] [L649] CALL insert_list(mylist,3) VAL [\old(head)=15, \old(head)=0, \old(k)=3, head={15:0}, l={16:32}] [L632] l = (mlist*)malloc(sizeof(mlist)) [L633] l->key = k VAL [\old(head)=15, \old(head)=0, \old(k)=3, head={15:0}, k=3, l={17:0}, l={16:32}, malloc(sizeof(mlist))={17:0}] [L634] COND FALSE !(head==((void *)0)) [L637] l->key = k [L638] l->next = head VAL [\old(head)=15, \old(head)=0, \old(k)=3, head={15:0}, k=3, l={16:32}, l={17:0}, malloc(sizeof(mlist))={17:0}] [L640] head = l [L641] return 0; VAL [\old(head)=0, \old(head)=15, \old(k)=3, \result=0, head={17:0}, k=3, l={17:0}, l={16:32}, malloc(sizeof(mlist))={17:0}] [L649] RET insert_list(mylist,3) VAL [\old(head)=0, \old(head)=0, head={17:0}, insert_list(mylist,3)=0, mylist={16:32}] [L650] CALL, EXPR search_list(head,2) VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, l={17:0}] [L625] l = head VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={17:0}, l={17:0}] [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={17:0}, l={17:0}, l!=((void *)0) && l->key!=k=1, l->key=3] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={15:0}, l={17:0}, l!=((void *)0) && l->key!=k=1, l->key=1] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={31:0}, l={17:0}, l!=((void *)0) && l->key!=k=1, l->key=5] [L626] COND TRUE l!=((void *)0) && l->key!=k [L627] EXPR l->next [L627] l = l->next [L626] l!=((void *)0) && l->key!=k [L626] EXPR l->key [L626] l!=((void *)0) && l->key!=k VAL [\old(head)=0, \old(head)=0, \old(k)=2, head={17:0}, k=2, l={30:0}, l={17:0}, l!=((void *)0) && l->key!=k=0, l->key=2] [L626] COND FALSE !(l!=((void *)0) && l->key!=k) [L629] return l; VAL [\old(head)=0, \old(head)=0, \old(k)=2, \result={30:0}, head={17:0}, k=2, l={17:0}, l={30:0}] [L650] RET, EXPR search_list(head,2) VAL [\old(head)=0, \old(head)=0, head={17:0}, mylist={16:32}, search_list(head,2)={30:0}] [L650] temp = search_list(head,2) [L651] EXPR temp->key VAL [\old(head)=0, \old(head)=0, head={17:0}, mylist={16:32}, temp={30:0}, temp->key=2] [L651] CALL __VERIFIER_assert(temp->key==1) VAL [\old(cond)=0, \old(head)=0, \old(head)=0, head={17:0}] [L4] COND TRUE !(cond) VAL [\old(cond)=0, \old(head)=0, \old(head)=0, cond=0, head={17:0}] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(head)=0, \old(head)=0, cond=0, head={17:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 41 locations, 1 error locations. UNSAFE Result, 72.2s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 50.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 172 SDtfs, 414 SDslu, 976 SDs, 0 SdLazy, 2599 SolverSat, 268 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 388 GetRequests, 181 SyntacticMatches, 14 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1865 ImplicationChecksByTransitivity, 60.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 26 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 552 NumberOfCodeBlocks, 552 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 486 ConstructedInterpolants, 12 QuantifiedInterpolants, 450811 SizeOfPredicates, 63 NumberOfNonLiveVariables, 1345 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 220/342 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...