./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c --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_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b974f281a213c0803f91ef44d205e442fb2a5f8f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-09 13:00:32,573 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 13:00:32,574 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 13:00:32,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 13:00:32,580 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 13:00:32,580 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 13:00:32,581 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 13:00:32,582 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 13:00:32,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 13:00:32,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 13:00:32,583 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 13:00:32,583 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 13:00:32,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 13:00:32,584 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 13:00:32,585 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 13:00:32,585 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 13:00:32,586 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 13:00:32,587 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 13:00:32,587 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 13:00:32,588 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 13:00:32,589 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 13:00:32,589 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 13:00:32,590 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 13:00:32,591 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 13:00:32,591 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 13:00:32,591 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 13:00:32,592 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 13:00:32,592 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 13:00:32,592 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 13:00:32,593 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 13:00:32,593 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 13:00:32,594 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 13:00:32,594 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 13:00:32,594 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 13:00:32,594 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 13:00:32,595 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 13:00:32,595 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 13:00:32,602 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 13:00:32,602 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 13:00:32,602 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 13:00:32,602 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 13:00:32,603 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 13:00:32,603 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 13:00:32,603 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 13:00:32,603 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 13:00:32,603 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 13:00:32,603 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 13:00:32,603 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 13:00:32,603 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 13:00:32,603 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 13:00:32,604 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 13:00:32,604 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 13:00:32,604 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 13:00:32,604 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 13:00:32,604 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 13:00:32,604 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 13:00:32,604 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 13:00:32,604 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 13:00:32,604 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 13:00:32,604 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 13:00:32,604 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 13:00:32,605 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 13:00:32,605 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 13:00:32,605 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 13:00:32,605 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 13:00:32,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 13:00:32,605 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 13:00:32,605 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 13:00:32,605 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 13:00:32,605 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 13:00:32,605 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 13:00:32,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 13:00:32,606 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 13:00:32,606 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b974f281a213c0803f91ef44d205e442fb2a5f8f [2018-12-09 13:00:32,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 13:00:32,630 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 13:00:32,631 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 13:00:32,632 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 13:00:32,633 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 13:00:32,633 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c [2018-12-09 13:00:32,669 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/data/bf76282d8/47da0a856171432aa4dfda5a566464db/FLAGcdcf22853 [2018-12-09 13:00:33,013 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 13:00:33,013 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/sv-benchmarks/c/ldv-regression/test23_false-unreach-call.c [2018-12-09 13:00:33,017 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/data/bf76282d8/47da0a856171432aa4dfda5a566464db/FLAGcdcf22853 [2018-12-09 13:00:33,025 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/data/bf76282d8/47da0a856171432aa4dfda5a566464db [2018-12-09 13:00:33,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 13:00:33,027 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 13:00:33,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 13:00:33,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 13:00:33,030 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 13:00:33,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:00:33" (1/1) ... [2018-12-09 13:00:33,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@602de2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:00:33, skipping insertion in model container [2018-12-09 13:00:33,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 01:00:33" (1/1) ... [2018-12-09 13:00:33,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 13:00:33,047 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 13:00:33,144 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 13:00:33,153 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 13:00:33,164 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 13:00:33,177 INFO L195 MainTranslator]: Completed translation [2018-12-09 13:00:33,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:00:33 WrapperNode [2018-12-09 13:00:33,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 13:00:33,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 13:00:33,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 13:00:33,177 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 13:00:33,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:00:33" (1/1) ... [2018-12-09 13:00:33,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:00:33" (1/1) ... [2018-12-09 13:00:33,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 13:00:33,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 13:00:33,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 13:00:33,222 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 13:00:33,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:00:33" (1/1) ... [2018-12-09 13:00:33,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:00:33" (1/1) ... [2018-12-09 13:00:33,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:00:33" (1/1) ... [2018-12-09 13:00:33,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:00:33" (1/1) ... [2018-12-09 13:00:33,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:00:33" (1/1) ... [2018-12-09 13:00:33,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:00:33" (1/1) ... [2018-12-09 13:00:33,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:00:33" (1/1) ... [2018-12-09 13:00:33,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 13:00:33,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 13:00:33,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 13:00:33,246 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 13:00:33,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:00:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 13:00:33,280 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-12-09 13:00:33,280 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-12-09 13:00:33,280 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 13:00:33,280 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 13:00:33,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 13:00:33,280 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-12-09 13:00:33,280 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-12-09 13:00:33,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 13:00:33,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 13:00:33,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 13:00:33,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 13:00:33,281 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-12-09 13:00:33,281 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-12-09 13:00:33,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 13:00:33,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 13:00:33,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 13:00:33,408 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 13:00:33,409 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 13:00:33,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:00:33 BoogieIcfgContainer [2018-12-09 13:00:33,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 13:00:33,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 13:00:33,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 13:00:33,413 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 13:00:33,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 01:00:33" (1/3) ... [2018-12-09 13:00:33,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424a6dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:00:33, skipping insertion in model container [2018-12-09 13:00:33,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 01:00:33" (2/3) ... [2018-12-09 13:00:33,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@424a6dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 01:00:33, skipping insertion in model container [2018-12-09 13:00:33,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:00:33" (3/3) ... [2018-12-09 13:00:33,416 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_false-unreach-call.c [2018-12-09 13:00:33,425 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 13:00:33,431 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 13:00:33,446 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 13:00:33,471 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 13:00:33,471 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 13:00:33,471 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 13:00:33,471 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 13:00:33,471 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 13:00:33,472 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 13:00:33,472 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 13:00:33,472 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 13:00:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-09 13:00:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 13:00:33,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:33,488 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:33,490 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:33,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:33,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1787337799, now seen corresponding path program 1 times [2018-12-09 13:00:33,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:00:33,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:33,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:33,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:33,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:00:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 13:00:33,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:00:33,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 13:00:33,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:00:33,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 13:00:33,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 13:00:33,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 13:00:33,617 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-12-09 13:00:33,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:33,629 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-12-09 13:00:33,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 13:00:33,630 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-12-09 13:00:33,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:33,635 INFO L225 Difference]: With dead ends: 46 [2018-12-09 13:00:33,635 INFO L226 Difference]: Without dead ends: 28 [2018-12-09 13:00:33,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 13:00:33,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-09 13:00:33,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-09 13:00:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-09 13:00:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-09 13:00:33,661 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 30 [2018-12-09 13:00:33,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:33,662 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-09 13:00:33,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 13:00:33,662 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-09 13:00:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 13:00:33,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:33,663 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:33,663 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:33,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:33,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1425990092, now seen corresponding path program 1 times [2018-12-09 13:00:33,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:00:33,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:33,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:33,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:33,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:00:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 13:00:34,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:00:34,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 13:00:34,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:00:34,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 13:00:34,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 13:00:34,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-09 13:00:34,189 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2018-12-09 13:00:34,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:34,521 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-12-09 13:00:34,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 13:00:34,521 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-09 13:00:34,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:34,523 INFO L225 Difference]: With dead ends: 54 [2018-12-09 13:00:34,523 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 13:00:34,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-12-09 13:00:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 13:00:34,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2018-12-09 13:00:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 13:00:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-12-09 13:00:34,530 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 31 [2018-12-09 13:00:34,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:34,531 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-12-09 13:00:34,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 13:00:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-12-09 13:00:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 13:00:34,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:34,532 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:34,532 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:34,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:34,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1848691918, now seen corresponding path program 1 times [2018-12-09 13:00:34,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:00:34,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:34,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:34,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:34,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:00:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 13:00:34,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:34,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 13:00:34,600 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-12-09 13:00:34,601 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [3], [6], [8], [10], [11], [17], [19], [22], [27], [30], [37], [40], [47], [50], [51], [52], [53], [54], [56], [57], [58], [59], [60], [61], [62], [63] [2018-12-09 13:00:34,623 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 13:00:34,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 13:00:34,745 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 13:00:34,746 INFO L272 AbstractInterpreter]: Visited 29 different actions 35 times. Merged at 1 different actions 2 times. Never widened. Performed 325 root evaluator evaluations with a maximum evaluation depth of 5. Performed 325 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 1 different actions. Largest state had 33 variables. [2018-12-09 13:00:34,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:34,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 13:00:34,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:34,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:00:34,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:34,767 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 13:00:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:34,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:00:34,826 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 11 treesize of output 14 [2018-12-09 13:00:34,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 13:00:34,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:00:34,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:00:34,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:00:34,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-09 13:00:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 13:00:34,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:00:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 13:00:34,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 13:00:34,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2018-12-09 13:00:34,922 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 13:00:34,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 13:00:34,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 13:00:34,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-09 13:00:34,923 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 13 states. [2018-12-09 13:00:35,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:35,059 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-12-09 13:00:35,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 13:00:35,060 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-12-09 13:00:35,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:35,060 INFO L225 Difference]: With dead ends: 56 [2018-12-09 13:00:35,060 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 13:00:35,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-12-09 13:00:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 13:00:35,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-12-09 13:00:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 13:00:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-12-09 13:00:35,065 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2018-12-09 13:00:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:35,066 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-09 13:00:35,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 13:00:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-12-09 13:00:35,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 13:00:35,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:35,066 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:35,066 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:35,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:35,067 INFO L82 PathProgramCache]: Analyzing trace with hash 568828240, now seen corresponding path program 1 times [2018-12-09 13:00:35,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:00:35,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:35,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:35,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:35,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:00:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:35,452 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 31 [2018-12-09 13:00:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 13:00:35,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 13:00:35,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 13:00:35,491 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 13:00:35,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 13:00:35,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 13:00:35,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-09 13:00:35,492 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 12 states. [2018-12-09 13:00:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:35,787 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-12-09 13:00:35,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 13:00:35,787 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-09 13:00:35,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:35,788 INFO L225 Difference]: With dead ends: 54 [2018-12-09 13:00:35,788 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 13:00:35,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-12-09 13:00:35,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 13:00:35,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-12-09 13:00:35,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 13:00:35,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-12-09 13:00:35,795 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 31 [2018-12-09 13:00:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:35,796 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-09 13:00:35,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 13:00:35,796 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-12-09 13:00:35,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 13:00:35,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:35,797 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:35,797 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:35,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:35,797 INFO L82 PathProgramCache]: Analyzing trace with hash -957154489, now seen corresponding path program 1 times [2018-12-09 13:00:35,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:00:35,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:35,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:35,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:35,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:00:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 13:00:36,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:36,300 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 13:00:36,300 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-12-09 13:00:36,300 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [3], [6], [10], [11], [17], [19], [22], [27], [30], [32], [37], [40], [47], [50], [51], [52], [53], [54], [56], [57], [58], [59], [60], [61], [62], [63] [2018-12-09 13:00:36,302 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 13:00:36,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 13:00:36,343 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 13:00:36,343 INFO L272 AbstractInterpreter]: Visited 29 different actions 32 times. Never merged. Never widened. Performed 301 root evaluator evaluations with a maximum evaluation depth of 5. Performed 301 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 34 variables. [2018-12-09 13:00:36,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:36,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 13:00:36,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:36,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:00:36,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:36,351 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 13:00:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:36,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:00:36,486 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 16 treesize of output 13 [2018-12-09 13:00:36,488 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 13 treesize of output 12 [2018-12-09 13:00:36,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:00:36,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:00:36,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 13:00:36,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2018-12-09 13:00:36,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2018-12-09 13:00:36,543 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 13:00:36,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-12-09 13:00:36,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:00:36,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:00:36,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:00:36,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:5 [2018-12-09 13:00:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 13:00:36,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:00:36,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-12-09 13:00:36,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-12-09 13:00:36,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:00:36,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:00:36,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:00:36,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:15 [2018-12-09 13:00:36,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 13:00:36,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 13:00:36,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 32 [2018-12-09 13:00:36,803 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 13:00:36,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 13:00:36,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 13:00:36,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2018-12-09 13:00:36,804 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 23 states. [2018-12-09 13:00:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:37,506 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-12-09 13:00:37,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 13:00:37,506 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2018-12-09 13:00:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:37,506 INFO L225 Difference]: With dead ends: 60 [2018-12-09 13:00:37,506 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 13:00:37,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=274, Invalid=1796, Unknown=0, NotChecked=0, Total=2070 [2018-12-09 13:00:37,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 13:00:37,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 41. [2018-12-09 13:00:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 13:00:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-12-09 13:00:37,512 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 33 [2018-12-09 13:00:37,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:37,512 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-12-09 13:00:37,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 13:00:37,512 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-12-09 13:00:37,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 13:00:37,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:37,513 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:37,513 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:37,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:37,513 INFO L82 PathProgramCache]: Analyzing trace with hash -55973429, now seen corresponding path program 1 times [2018-12-09 13:00:37,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:00:37,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:37,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:37,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:37,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:00:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:37,841 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 26 [2018-12-09 13:00:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 13:00:37,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:37,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 13:00:37,927 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 34 with the following transitions: [2018-12-09 13:00:37,927 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [3], [8], [10], [11], [17], [19], [22], [27], [30], [32], [37], [40], [47], [50], [51], [52], [53], [54], [56], [57], [58], [59], [60], [61], [62], [63] [2018-12-09 13:00:37,929 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 13:00:37,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 13:00:37,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 13:00:37,953 INFO L272 AbstractInterpreter]: Visited 29 different actions 32 times. Never merged. Never widened. Performed 301 root evaluator evaluations with a maximum evaluation depth of 5. Performed 301 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 34 variables. [2018-12-09 13:00:37,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:37,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 13:00:37,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:37,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:00:37,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:37,962 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 13:00:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:37,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:00:38,102 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 16 treesize of output 13 [2018-12-09 13:00:38,104 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 13 treesize of output 12 [2018-12-09 13:00:38,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:00:38,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:00:38,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 13:00:38,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:59 [2018-12-09 13:00:38,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-12-09 13:00:38,155 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 13:00:38,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-12-09 13:00:38,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:00:38,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:00:38,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:00:38,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:5 [2018-12-09 13:00:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 13:00:38,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:00:38,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-12-09 13:00:38,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-12-09 13:00:38,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:00:38,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:00:38,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 13:00:38,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:15 [2018-12-09 13:00:38,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 13:00:38,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 13:00:38,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 32 [2018-12-09 13:00:38,396 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 13:00:38,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 13:00:38,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 13:00:38,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2018-12-09 13:00:38,397 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 23 states. [2018-12-09 13:00:39,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:39,107 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2018-12-09 13:00:39,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 13:00:39,107 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 33 [2018-12-09 13:00:39,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:39,108 INFO L225 Difference]: With dead ends: 62 [2018-12-09 13:00:39,108 INFO L226 Difference]: Without dead ends: 54 [2018-12-09 13:00:39,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=274, Invalid=1796, Unknown=0, NotChecked=0, Total=2070 [2018-12-09 13:00:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-09 13:00:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2018-12-09 13:00:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-09 13:00:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-12-09 13:00:39,114 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 33 [2018-12-09 13:00:39,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:39,114 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-09 13:00:39,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 13:00:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-12-09 13:00:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 13:00:39,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:39,115 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:39,115 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:39,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:39,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1263240701, now seen corresponding path program 2 times [2018-12-09 13:00:39,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:00:39,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:39,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 13:00:39,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:39,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:00:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:39,473 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 34 [2018-12-09 13:00:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 13:00:39,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:39,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 13:00:39,835 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 13:00:39,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 13:00:39,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:39,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:00:39,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 13:00:39,843 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 13:00:39,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 13:00:39,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 13:00:39,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:00:39,941 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 16 treesize of output 13 [2018-12-09 13:00:39,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-09 13:00:39,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:00:39,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:00:39,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 13:00:39,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-12-09 13:00:40,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-12-09 13:00:40,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2018-12-09 13:00:40,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:00:40,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:00:40,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:00:40,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:9 [2018-12-09 13:00:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 13:00:40,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:00:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 13:00:40,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 13:00:40,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 7] total 31 [2018-12-09 13:00:40,183 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 13:00:40,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 13:00:40,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 13:00:40,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-12-09 13:00:40,184 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 26 states. [2018-12-09 13:00:41,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:41,880 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2018-12-09 13:00:41,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-09 13:00:41,881 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-12-09 13:00:41,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:41,882 INFO L225 Difference]: With dead ends: 80 [2018-12-09 13:00:41,882 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 13:00:41,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=918, Invalid=4052, Unknown=0, NotChecked=0, Total=4970 [2018-12-09 13:00:41,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 13:00:41,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2018-12-09 13:00:41,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 13:00:41,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-12-09 13:00:41,897 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 37 [2018-12-09 13:00:41,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:41,897 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-12-09 13:00:41,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 13:00:41,897 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-12-09 13:00:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 13:00:41,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:41,898 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:41,899 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:41,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:41,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2133408361, now seen corresponding path program 3 times [2018-12-09 13:00:41,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:00:41,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:41,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 13:00:41,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:41,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:00:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 13:00:42,546 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 26 [2018-12-09 13:00:42,872 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 36 [2018-12-09 13:00:43,035 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 17 [2018-12-09 13:00:43,397 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 19 [2018-12-09 13:00:43,642 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 20 [2018-12-09 13:00:43,861 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 20 [2018-12-09 13:00:44,217 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 20 [2018-12-09 13:00:44,462 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 17 [2018-12-09 13:00:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 13:00:44,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:44,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 13:00:44,754 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 13:00:44,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 13:00:44,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 13:00:44,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 13:00:44,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 13:00:44,767 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 13:00:44,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 13:00:44,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 13:00:44,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 13:00:44,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 11 treesize of output 8 [2018-12-09 13:00:44,809 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 8 treesize of output 7 [2018-12-09 13:00:44,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:00:44,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:00:44,815 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-09 13:00:44,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2018-12-09 13:00:44,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 13:00:44,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 13:00:44,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 13:00:44,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:00:44,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 13:00:44,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-12-09 13:00:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 13:00:44,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 13:00:45,092 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 13:00:45,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 13:00:45,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 11] total 32 [2018-12-09 13:00:45,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 13:00:45,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-09 13:00:45,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-09 13:00:45,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2018-12-09 13:00:45,110 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 30 states. [2018-12-09 13:00:46,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 13:00:46,801 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2018-12-09 13:00:46,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-09 13:00:46,801 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 45 [2018-12-09 13:00:46,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 13:00:46,801 INFO L225 Difference]: With dead ends: 96 [2018-12-09 13:00:46,802 INFO L226 Difference]: Without dead ends: 88 [2018-12-09 13:00:46,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 75 SyntacticMatches, 11 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1515, Invalid=5127, Unknown=0, NotChecked=0, Total=6642 [2018-12-09 13:00:46,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-09 13:00:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 55. [2018-12-09 13:00:46,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-09 13:00:46,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-12-09 13:00:46,811 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 45 [2018-12-09 13:00:46,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 13:00:46,811 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-12-09 13:00:46,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-09 13:00:46,811 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-12-09 13:00:46,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 13:00:46,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 13:00:46,812 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 13:00:46,812 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 13:00:46,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 13:00:46,812 INFO L82 PathProgramCache]: Analyzing trace with hash 821150421, now seen corresponding path program 4 times [2018-12-09 13:00:46,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 13:00:46,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:46,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 13:00:46,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 13:00:46,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 13:00:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:00:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 13:00:46,860 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 13:00:46,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 01:00:46 BoogieIcfgContainer [2018-12-09 13:00:46,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 13:00:46,902 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 13:00:46,903 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 13:00:46,903 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 13:00:46,903 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 01:00:33" (3/4) ... [2018-12-09 13:00:46,905 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 13:00:46,946 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5287df29-790f-4782-81b6-e86fc30833e1/bin-2019/utaipan/witness.graphml [2018-12-09 13:00:46,947 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 13:00:46,947 INFO L168 Benchmark]: Toolchain (without parser) took 13920.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 256.9 MB). Free memory was 950.8 MB in the beginning and 810.6 MB in the end (delta: 140.1 MB). Peak memory consumption was 397.0 MB. Max. memory is 11.5 GB. [2018-12-09 13:00:46,948 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:00:46,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.31 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 13:00:46,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 940.0 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-12-09 13:00:46,948 INFO L168 Benchmark]: Boogie Preprocessor took 23.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 13:00:46,948 INFO L168 Benchmark]: RCFGBuilder took 163.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-09 13:00:46,949 INFO L168 Benchmark]: TraceAbstraction took 13492.27 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 151.5 MB). Free memory was 1.1 GB in the beginning and 819.3 MB in the end (delta: 264.3 MB). Peak memory consumption was 415.9 MB. Max. memory is 11.5 GB. [2018-12-09 13:00:46,949 INFO L168 Benchmark]: Witness Printer took 44.20 ms. Allocated memory is still 1.3 GB. Free memory was 819.3 MB in the beginning and 810.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2018-12-09 13:00:46,950 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 149.31 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 940.0 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 163.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13492.27 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 151.5 MB). Free memory was 1.1 GB in the beginning and 819.3 MB in the end (delta: 264.3 MB). Peak memory consumption was 415.9 MB. Max. memory is 11.5 GB. * Witness Printer took 44.20 ms. Allocated memory is still 1.3 GB. Free memory was 819.3 MB in the beginning and 810.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 50]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] struct dummy d1, d2; VAL [\old(d1)=80, \old(d1)=74, \old(d2)=76, \old(d2)=78, d1={75:0}, d2={79:0}] [L33] CALL init() VAL [d1={75:0}, d2={79:0}] [L14] d1.a = __VERIFIER_nondet_int() [L15] d1.b = __VERIFIER_nondet_int() [L17] d2.a = __VERIFIER_nondet_int() [L18] d2.b = __VERIFIER_nondet_int() [L33] RET init() VAL [d1={75:0}, d2={79:0}] [L34] CALL, EXPR get_dummy() VAL [d1={75:0}, d2={79:0}] [L23] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={75:0}, d1={75:0}, d2={79:0}] [L23] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L34] RET, EXPR get_dummy() VAL [d1={75:0}, d2={79:0}, get_dummy()={75:0}] [L34] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L34] CALL, EXPR get_dummy() VAL [d1={75:0}, d2={79:0}] [L23] EXPR __VERIFIER_nondet_bool() ? &d1 : &d2 VAL [__VERIFIER_nondet_bool()=1, __VERIFIER_nondet_bool() ? &d1 : &d2={75:0}, d1={75:0}, d2={79:0}] [L23] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L34] RET, EXPR get_dummy() VAL [d1={75:0}, d2={79:0}, get_dummy()={75:0}, pd1={75:0}] [L34] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L35] int i = __VERIFIER_nondet_int(); [L36] COND TRUE pd1 != 0 && pd1 == pd2 && i >= 0 && i < 10 [L37] pd2->array[i] = i [L38] int *pa = &pd1->array[i]; [L39] EXPR pd2->array[i] [L39] i = pd2->array[i] - 10 [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-10, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-9, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-9, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-8, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-8, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-7, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-7, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-6, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-6, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-5, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-5, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-4, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-4, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-3, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-3, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-2, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-2, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=-1, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=-1, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=0, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=0, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND TRUE i <= *pa [L41] ++i VAL [d1={75:0}, d2={79:0}, i=1, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] EXPR \read(*pa) VAL [\read(*pa)=0, d1={75:0}, d2={79:0}, i=1, pa={75:8}, pd1={75:0}, pd2={75:0}] [L40] COND FALSE !(i <= *pa) [L43] CALL, EXPR check(pd2, i) VAL [\old(i)=1, d1={75:0}, d2={79:0}, s1={75:0}] [L28] EXPR s1->array[i] [L28] return s1->array[i] == i; [L43] RET, EXPR check(pd2, i) VAL [check(pd2, i)=0, d1={75:0}, d2={79:0}, i=1, pa={75:8}, pd1={75:0}, pd2={75:0}] [L43] COND TRUE !check(pd2, i) [L50] __VERIFIER_error() VAL [d1={75:0}, d2={79:0}, i=1, pa={75:8}, pd1={75:0}, pd2={75:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. UNSAFE Result, 13.4s OverallTime, 9 OverallIterations, 12 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 231 SDtfs, 440 SDslu, 1957 SDs, 0 SdLazy, 1903 SolverSat, 237 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 618 GetRequests, 290 SyntacticMatches, 36 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3975 ImplicationChecksByTransitivity, 10.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 111 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 503 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 611 ConstructedInterpolants, 13 QuantifiedInterpolants, 146655 SizeOfPredicates, 56 NumberOfNonLiveVariables, 1071 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 50/288 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...