./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/heap-data/shared_mem2_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/heap-data/shared_mem2_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/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 ebbfaff6f87d2f170bbf62930cb63938c92c4b2b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 15:53:01,154 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:53:01,155 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:53:01,161 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:53:01,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:53:01,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:53:01,163 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:53:01,164 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:53:01,165 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:53:01,165 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:53:01,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:53:01,166 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:53:01,167 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:53:01,167 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:53:01,168 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:53:01,169 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:53:01,169 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:53:01,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:53:01,171 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:53:01,172 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:53:01,173 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:53:01,173 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:53:01,175 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:53:01,175 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:53:01,175 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:53:01,176 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:53:01,176 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:53:01,177 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:53:01,177 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:53:01,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:53:01,178 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:53:01,179 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:53:01,179 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:53:01,179 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:53:01,180 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:53:01,180 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:53:01,180 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 15:53:01,191 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:53:01,191 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:53:01,192 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 15:53:01,192 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 15:53:01,192 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 15:53:01,192 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 15:53:01,192 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 15:53:01,192 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 15:53:01,192 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 15:53:01,193 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 15:53:01,193 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 15:53:01,193 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 15:53:01,193 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 15:53:01,193 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:53:01,194 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:53:01,194 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:53:01,194 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:53:01,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:53:01,194 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 15:53:01,194 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 15:53:01,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 15:53:01,194 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:53:01,195 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:53:01,195 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:53:01,195 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 15:53:01,195 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:53:01,195 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:53:01,195 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 15:53:01,195 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 15:53:01,195 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:53:01,196 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:53:01,196 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 15:53:01,196 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 15:53:01,196 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 15:53:01,196 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 15:53:01,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 15:53:01,196 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 15:53:01,196 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_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/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 -> ebbfaff6f87d2f170bbf62930cb63938c92c4b2b [2018-11-18 15:53:01,220 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:53:01,229 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:53:01,232 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:53:01,233 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:53:01,233 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:53:01,234 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/bin-2019/utaipan/../../sv-benchmarks/c/heap-data/shared_mem2_true-unreach-call.i [2018-11-18 15:53:01,279 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/bin-2019/utaipan/data/b89764109/2b226596e297479ababe8e162bf4f859/FLAGcc53a49b1 [2018-11-18 15:53:01,654 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:53:01,654 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/sv-benchmarks/c/heap-data/shared_mem2_true-unreach-call.i [2018-11-18 15:53:01,664 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/bin-2019/utaipan/data/b89764109/2b226596e297479ababe8e162bf4f859/FLAGcc53a49b1 [2018-11-18 15:53:02,038 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/bin-2019/utaipan/data/b89764109/2b226596e297479ababe8e162bf4f859 [2018-11-18 15:53:02,041 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:53:02,041 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:53:02,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:53:02,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:53:02,044 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:53:02,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:53:02" (1/1) ... [2018-11-18 15:53:02,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3467704d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:53:02, skipping insertion in model container [2018-11-18 15:53:02,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:53:02" (1/1) ... [2018-11-18 15:53:02,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:53:02,084 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:53:02,303 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:53:02,311 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:53:02,339 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:53:02,415 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:53:02,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:53:02 WrapperNode [2018-11-18 15:53:02,415 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:53:02,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:53:02,416 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:53:02,416 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:53:02,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:53:02" (1/1) ... [2018-11-18 15:53:02,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:53:02" (1/1) ... [2018-11-18 15:53:02,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:53:02,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:53:02,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:53:02,436 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:53:02,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:53:02" (1/1) ... [2018-11-18 15:53:02,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:53:02" (1/1) ... [2018-11-18 15:53:02,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:53:02" (1/1) ... [2018-11-18 15:53:02,443 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:53:02" (1/1) ... [2018-11-18 15:53:02,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:53:02" (1/1) ... [2018-11-18 15:53:02,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:53:02" (1/1) ... [2018-11-18 15:53:02,453 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:53:02" (1/1) ... [2018-11-18 15:53:02,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:53:02,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:53:02,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:53:02,454 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:53:02,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:53:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 15:53:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 15:53:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 15:53:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 15:53:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 15:53:02,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 15:53:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 15:53:02,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 15:53:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 15:53:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 15:53:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:53:02,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:53:02,656 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:53:02,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:53:02 BoogieIcfgContainer [2018-11-18 15:53:02,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:53:02,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 15:53:02,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 15:53:02,658 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 15:53:02,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 03:53:02" (1/3) ... [2018-11-18 15:53:02,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24935bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:53:02, skipping insertion in model container [2018-11-18 15:53:02,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:53:02" (2/3) ... [2018-11-18 15:53:02,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24935bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 03:53:02, skipping insertion in model container [2018-11-18 15:53:02,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:53:02" (3/3) ... [2018-11-18 15:53:02,660 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem2_true-unreach-call.i [2018-11-18 15:53:02,666 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 15:53:02,671 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 15:53:02,679 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 15:53:02,699 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 15:53:02,699 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 15:53:02,699 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 15:53:02,700 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:53:02,700 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:53:02,700 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 15:53:02,700 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:53:02,700 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 15:53:02,709 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-18 15:53:02,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 15:53:02,713 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:53:02,713 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:53:02,715 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:53:02,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:02,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1485801103, now seen corresponding path program 1 times [2018-11-18 15:53:02,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:53:02,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:02,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:02,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:02,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:53:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:53:02,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:53:02,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 15:53:02,814 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:53:02,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 15:53:02,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 15:53:02,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:53:02,826 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-18 15:53:02,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:53:02,836 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-11-18 15:53:02,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 15:53:02,837 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-18 15:53:02,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:53:02,843 INFO L225 Difference]: With dead ends: 38 [2018-11-18 15:53:02,843 INFO L226 Difference]: Without dead ends: 20 [2018-11-18 15:53:02,845 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 15:53:02,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-18 15:53:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-18 15:53:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 15:53:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-18 15:53:02,867 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2018-11-18 15:53:02,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:53:02,868 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-18 15:53:02,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 15:53:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-18 15:53:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 15:53:02,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:53:02,868 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:53:02,869 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:53:02,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:02,869 INFO L82 PathProgramCache]: Analyzing trace with hash 874371624, now seen corresponding path program 1 times [2018-11-18 15:53:02,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:53:02,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:02,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:02,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:02,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:53:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:02,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:53:02,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:53:02,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:53:02,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 15:53:02,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 15:53:02,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:53:02,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:53:02,975 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 5 states. [2018-11-18 15:53:03,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:53:03,031 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-11-18 15:53:03,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:53:03,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-18 15:53:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:53:03,032 INFO L225 Difference]: With dead ends: 34 [2018-11-18 15:53:03,032 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 15:53:03,033 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:53:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 15:53:03,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-18 15:53:03,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 15:53:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-11-18 15:53:03,037 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 16 [2018-11-18 15:53:03,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:53:03,037 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-18 15:53:03,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 15:53:03,037 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-18 15:53:03,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 15:53:03,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:53:03,038 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:53:03,038 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:53:03,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:03,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1932709261, now seen corresponding path program 1 times [2018-11-18 15:53:03,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:53:03,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:03,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:03,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:03,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:53:03,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:53:03,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:03,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:53:03,153 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-18 15:53:03,155 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [11], [14], [16], [19], [26], [30], [32], [35], [48], [51], [52], [58], [59], [60] [2018-11-18 15:53:03,177 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:53:03,177 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:53:03,286 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:53:03,287 INFO L272 AbstractInterpreter]: Visited 18 different actions 18 times. Never merged. Never widened. Performed 118 root evaluator evaluations with a maximum evaluation depth of 3. Performed 118 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 33 variables. [2018-11-18 15:53:03,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:03,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:53:03,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:03,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:53:03,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:03,303 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:53:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:03,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:53:03,371 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:03,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2018-11-18 15:53:03,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-18 15:53:03,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:03,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:03,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:53:03,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 15:53:03,405 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:03,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 15:53:03,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 15:53:03,415 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:03,419 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:03,431 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:03,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:03,438 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2018-11-18 15:53:03,494 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:03,495 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:03,497 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:03,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 15:53:03,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:03,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-11-18 15:53:03,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 15:53:03,527 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:03,546 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:03,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:03,558 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:45, output treesize:19 [2018-11-18 15:53:03,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:53:03,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:53:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:53:03,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:53:03,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-18 15:53:03,692 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:53:03,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 15:53:03,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:53:03,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:53:03,693 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 9 states. [2018-11-18 15:53:03,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:53:03,784 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-18 15:53:03,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:53:03,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-11-18 15:53:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:53:03,787 INFO L225 Difference]: With dead ends: 39 [2018-11-18 15:53:03,787 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 15:53:03,787 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-11-18 15:53:03,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 15:53:03,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2018-11-18 15:53:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 15:53:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-18 15:53:03,794 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 20 [2018-11-18 15:53:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:53:03,794 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-18 15:53:03,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 15:53:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-18 15:53:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 15:53:03,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:53:03,795 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:53:03,795 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:53:03,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:03,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1849232671, now seen corresponding path program 1 times [2018-11-18 15:53:03,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:53:03,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:03,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:03,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:03,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:53:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:53:04,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:04,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:53:04,074 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-18 15:53:04,074 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [11], [14], [26], [30], [32], [35], [37], [40], [44], [48], [51], [52], [58], [59], [60] [2018-11-18 15:53:04,075 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:53:04,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:53:04,114 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:53:04,114 INFO L272 AbstractInterpreter]: Visited 19 different actions 28 times. Merged at 9 different actions 9 times. Never widened. Performed 156 root evaluator evaluations with a maximum evaluation depth of 3. Performed 156 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 37 variables. [2018-11-18 15:53:04,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:04,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:53:04,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:04,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:53:04,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:04,123 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:53:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:04,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:53:04,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-18 15:53:04,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 15:53:04,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:04,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 15:53:04,168 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,172 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-18 15:53:04,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 15:53:04,186 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:04,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 15:53:04,188 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,193 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,196 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,202 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:37, output treesize:37 [2018-11-18 15:53:04,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2018-11-18 15:53:04,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:04,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 61 [2018-11-18 15:53:04,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 59 [2018-11-18 15:53:04,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2018-11-18 15:53:04,316 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 52 [2018-11-18 15:53:04,350 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 15:53:04,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-18 15:53:04,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-11-18 15:53:04,389 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:04,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2018-11-18 15:53:04,400 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,403 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-11-18 15:53:04,406 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:04,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2018-11-18 15:53:04,408 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,413 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-11-18 15:53:04,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 20 [2018-11-18 15:53:04,418 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,421 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-11-18 15:53:04,428 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:04,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-11-18 15:53:04,430 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,434 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 15:53:04,446 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:113, output treesize:46 [2018-11-18 15:53:04,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-18 15:53:04,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-18 15:53:04,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2018-11-18 15:53:04,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:53:04,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:53:04,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 57 [2018-11-18 15:53:04,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-18 15:53:04,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-18 15:53:04,674 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 54 [2018-11-18 15:53:04,731 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-18 15:53:04,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2018-11-18 15:53:04,780 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-18 15:53:04,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-18 15:53:04,836 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2018-11-18 15:53:04,871 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 15:53:04,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 45 [2018-11-18 15:53:04,907 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-18 15:53:04,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:04,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:53:04,915 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:81, output treesize:19 [2018-11-18 15:53:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:53:04,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:53:04,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2018-11-18 15:53:04,971 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:53:04,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 15:53:04,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 15:53:04,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-11-18 15:53:04,972 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 16 states. [2018-11-18 15:53:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:53:05,461 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2018-11-18 15:53:05,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:53:05,461 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-11-18 15:53:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:53:05,461 INFO L225 Difference]: With dead ends: 51 [2018-11-18 15:53:05,462 INFO L226 Difference]: Without dead ends: 29 [2018-11-18 15:53:05,462 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2018-11-18 15:53:05,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-18 15:53:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-18 15:53:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 15:53:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-18 15:53:05,465 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 21 [2018-11-18 15:53:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:53:05,465 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-18 15:53:05,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 15:53:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-18 15:53:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 15:53:05,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:53:05,465 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:53:05,466 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:53:05,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:05,466 INFO L82 PathProgramCache]: Analyzing trace with hash -778211110, now seen corresponding path program 1 times [2018-11-18 15:53:05,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:53:05,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:05,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:05,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:05,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:53:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:53:05,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:05,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:53:05,690 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-11-18 15:53:05,690 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [11], [14], [16], [19], [26], [30], [32], [35], [37], [40], [44], [48], [51], [52], [58], [59], [60] [2018-11-18 15:53:05,691 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 15:53:05,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 15:53:05,729 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 15:53:05,729 INFO L272 AbstractInterpreter]: Visited 21 different actions 30 times. Merged at 9 different actions 9 times. Never widened. Performed 188 root evaluator evaluations with a maximum evaluation depth of 3. Performed 188 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 43 variables. [2018-11-18 15:53:05,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:05,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 15:53:05,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:05,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:53:05,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:05,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 15:53:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:05,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:53:05,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-18 15:53:05,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 15:53:05,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:05,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:05,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-18 15:53:05,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 15:53:05,805 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:05,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 15:53:05,807 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:05,822 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:05,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:05,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-18 15:53:05,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 15:53:05,845 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:05,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 15:53:05,846 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:05,851 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:05,854 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:05,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:05,863 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:53 [2018-11-18 15:53:05,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:05,952 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:05,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 15:53:05,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:05,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2018-11-18 15:53:05,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 15:53:05,986 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:05,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 15:53:05,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:05,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-11-18 15:53:06,018 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:06,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-11-18 15:53:06,022 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,030 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,037 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 51 [2018-11-18 15:53:06,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-18 15:53:06,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:06,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-18 15:53:06,063 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,068 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,079 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:06,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-11-18 15:53:06,084 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:06,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-11-18 15:53:06,087 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,093 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,098 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,109 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:133, output treesize:113 [2018-11-18 15:53:06,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 155 [2018-11-18 15:53:06,217 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:06,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-18 15:53:06,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:06,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 95 [2018-11-18 15:53:06,233 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:06,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:06,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2018-11-18 15:53:06,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 15:53:06,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-18 15:53:06,256 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 35 [2018-11-18 15:53:06,263 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,266 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 41 [2018-11-18 15:53:06,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-11-18 15:53:06,285 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 34 [2018-11-18 15:53:06,318 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 15:53:06,335 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-18 15:53:06,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 15:53:06,348 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:189, output treesize:46 [2018-11-18 15:53:06,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-18 15:53:06,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-18 15:53:06,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2018-11-18 15:53:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:53:06,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:53:06,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 57 [2018-11-18 15:53:06,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-11-18 15:53:06,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-11-18 15:53:06,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 54 [2018-11-18 15:53:06,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-18 15:53:06,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2018-11-18 15:53:06,633 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-18 15:53:06,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-18 15:53:06,662 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-18 15:53:06,691 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 45 [2018-11-18 15:53:06,750 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-18 15:53:06,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2018-11-18 15:53:06,770 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:06,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 15:53:06,782 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 1 variables, input treesize:81, output treesize:19 [2018-11-18 15:53:06,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:53:06,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:53:06,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2018-11-18 15:53:06,877 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:53:06,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 15:53:06,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 15:53:06,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-11-18 15:53:06,878 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 18 states. [2018-11-18 15:53:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:53:07,913 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-11-18 15:53:07,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 15:53:07,914 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 25 [2018-11-18 15:53:07,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:53:07,914 INFO L225 Difference]: With dead ends: 65 [2018-11-18 15:53:07,914 INFO L226 Difference]: Without dead ends: 38 [2018-11-18 15:53:07,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=289, Invalid=1193, Unknown=0, NotChecked=0, Total=1482 [2018-11-18 15:53:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-18 15:53:07,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2018-11-18 15:53:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 15:53:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-18 15:53:07,919 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 25 [2018-11-18 15:53:07,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:53:07,920 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-18 15:53:07,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 15:53:07,920 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-18 15:53:07,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 15:53:07,920 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 15:53:07,921 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:53:07,921 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 15:53:07,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:53:07,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1617133333, now seen corresponding path program 2 times [2018-11-18 15:53:07,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 15:53:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:07,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:53:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:53:07,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 15:53:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:53:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:53:08,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:08,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 15:53:08,151 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-18 15:53:08,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-18 15:53:08,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:53:08,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:53:08,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 15:53:08,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-18 15:53:08,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 15:53:08,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:53:08,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:53:08,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 69 [2018-11-18 15:53:08,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2018-11-18 15:53:08,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:08,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:08,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-11-18 15:53:08,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2018-11-18 15:53:08,220 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:08,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:08,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 63 [2018-11-18 15:53:08,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2018-11-18 15:53:08,273 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:08,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 35 treesize of output 62 [2018-11-18 15:53:08,368 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 9 xjuncts. [2018-11-18 15:53:08,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 52 [2018-11-18 15:53:08,499 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-11-18 15:53:08,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 45 [2018-11-18 15:53:08,601 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-18 15:53:08,689 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 12 xjuncts. [2018-11-18 15:53:08,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 20 dim-0 vars, and 10 xjuncts. [2018-11-18 15:53:08,787 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:84, output treesize:265 [2018-11-18 15:53:13,227 WARN L180 SmtUtils]: Spent 4.40 s on a formula simplification. DAG size of input: 116 DAG size of output: 16 [2018-11-18 15:53:13,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-18 15:53:13,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-18 15:53:13,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 15:53:13,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 15:53:13,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:13,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:16 [2018-11-18 15:53:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 15:53:13,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 15:53:13,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 122 [2018-11-18 15:53:13,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 94 [2018-11-18 15:53:13,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:13,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:13,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 84 [2018-11-18 15:53:13,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2018-11-18 15:53:13,397 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:13,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:13,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 15:53:13,421 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:140, output treesize:68 [2018-11-18 15:53:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 15:53:13,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 15:53:13,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2018-11-18 15:53:13,471 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-18 15:53:13,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 15:53:13,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 15:53:13,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-11-18 15:53:13,471 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 16 states. [2018-11-18 15:53:13,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:53:13,894 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2018-11-18 15:53:13,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 15:53:13,895 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-11-18 15:53:13,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 15:53:13,895 INFO L225 Difference]: With dead ends: 45 [2018-11-18 15:53:13,895 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 15:53:13,896 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2018-11-18 15:53:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 15:53:13,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 15:53:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 15:53:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 15:53:13,896 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-11-18 15:53:13,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 15:53:13,897 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:53:13,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 15:53:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:53:13,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 15:53:13,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 15:53:14,083 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:53:14,083 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-18 15:53:14,083 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:53:14,084 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 15:53:14,084 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 15:53:14,084 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 15:53:14,084 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 15:53:14,084 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 565 591) no Hoare annotation was computed. [2018-11-18 15:53:14,084 INFO L425 ceAbstractionStarter]: For program point L589(lines 589 590) no Hoare annotation was computed. [2018-11-18 15:53:14,084 INFO L425 ceAbstractionStarter]: For program point L589-2(lines 565 591) no Hoare annotation was computed. [2018-11-18 15:53:14,084 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 586) no Hoare annotation was computed. [2018-11-18 15:53:14,084 INFO L425 ceAbstractionStarter]: For program point L585-2(lines 585 586) no Hoare annotation was computed. [2018-11-18 15:53:14,084 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 581) no Hoare annotation was computed. [2018-11-18 15:53:14,084 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 565 591) the Hoare annotation is: true [2018-11-18 15:53:14,085 INFO L421 ceAbstractionStarter]: At program point L575-2(lines 573 582) the Hoare annotation is: (let ((.cse3 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (.cse1 (+ main_~list~0.offset 4))) (let ((.cse0 (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) .cse1))) (.cse2 (= |main_#t~mem7| .cse3))) (and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= main_~list~0.base main_~head~0.base) (= (select |#valid| main_~m~0.base) 1) (or (not .cse0) (and (or (= main_~m~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) .cse1)) .cse2) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 1))) (= main_~m~0.offset 0) (not (= main_~m~0.base main_~head~0.base)) (= (select |#valid| main_~list~0.base) 1) (= 0 .cse3) (or .cse0 .cse2)))) [2018-11-18 15:53:14,085 INFO L425 ceAbstractionStarter]: For program point L573-1(lines 573 582) no Hoare annotation was computed. [2018-11-18 15:53:14,085 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 590) no Hoare annotation was computed. [2018-11-18 15:53:14,085 INFO L425 ceAbstractionStarter]: For program point L573-2(lines 573 582) no Hoare annotation was computed. [2018-11-18 15:53:14,085 INFO L425 ceAbstractionStarter]: For program point L573-4(lines 573 582) no Hoare annotation was computed. [2018-11-18 15:53:14,085 INFO L425 ceAbstractionStarter]: For program point L590(line 590) no Hoare annotation was computed. [2018-11-18 15:53:14,085 INFO L425 ceAbstractionStarter]: For program point L584-1(lines 584 588) no Hoare annotation was computed. [2018-11-18 15:53:14,085 INFO L425 ceAbstractionStarter]: For program point L584-2(lines 584 588) no Hoare annotation was computed. [2018-11-18 15:53:14,086 INFO L421 ceAbstractionStarter]: At program point L584-4(lines 584 588) the Hoare annotation is: (or (exists ((v_prenex_26 Int)) (let ((.cse0 (* 2 v_prenex_26))) (and (<= .cse0 100) (= .cse0 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset))))) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)) [2018-11-18 15:53:14,086 INFO L425 ceAbstractionStarter]: For program point L584-5(lines 584 588) no Hoare annotation was computed. [2018-11-18 15:53:14,092 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:14,093 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:14,093 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:14,096 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,096 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:14,096 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:14,097 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,097 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,097 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,097 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:14,098 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,100 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:14,100 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:14,101 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:14,102 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,102 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:14,103 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:14,103 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,103 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,103 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,103 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:14,103 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,105 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-18 15:53:14,105 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-18 15:53:14,105 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,106 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,106 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-18 15:53:14,106 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-18 15:53:14,106 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,107 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 03:53:14 BoogieIcfgContainer [2018-11-18 15:53:14,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 15:53:14,111 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:53:14,111 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:53:14,111 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:53:14,111 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:53:02" (3/4) ... [2018-11-18 15:53:14,114 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 15:53:14,118 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 15:53:14,118 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 15:53:14,121 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-18 15:53:14,122 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 15:53:14,122 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 15:53:14,149 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_prenex_26 : int :: 2 * v_prenex_26 <= 100 && 2 * v_prenex_26 == unknown-#memory_int-unknown[m][m]) || unknown-#memory_int-unknown[m][m] <= 99 [2018-11-18 15:53:14,162 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_24bc18b3-bb6e-4a9d-be23-8a0219c7cf9d/bin-2019/utaipan/witness.graphml [2018-11-18 15:53:14,162 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:53:14,163 INFO L168 Benchmark]: Toolchain (without parser) took 12121.97 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 375.4 MB). Free memory was 950.0 MB in the beginning and 1.4 GB in the end (delta: -419.6 MB). Peak memory consumption was 400.0 MB. Max. memory is 11.5 GB. [2018-11-18 15:53:14,163 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:53:14,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -212.8 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:53:14,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2018-11-18 15:53:14,164 INFO L168 Benchmark]: Boogie Preprocessor took 18.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:53:14,164 INFO L168 Benchmark]: RCFGBuilder took 202.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-18 15:53:14,164 INFO L168 Benchmark]: TraceAbstraction took 11453.69 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 894.5 MB in the end (delta: 245.2 MB). Peak memory consumption was 415.0 MB. Max. memory is 11.5 GB. [2018-11-18 15:53:14,165 INFO L168 Benchmark]: Witness Printer took 51.60 ms. Allocated memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 30.9 MB). Free memory was 894.5 MB in the beginning and 1.4 GB in the end (delta: -475.1 MB). Peak memory consumption was 29.1 kB. Max. memory is 11.5 GB. [2018-11-18 15:53:14,166 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.6 MB). Free memory was 950.0 MB in the beginning and 1.2 GB in the end (delta: -212.8 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 202.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11453.69 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 169.9 MB). Free memory was 1.1 GB in the beginning and 894.5 MB in the end (delta: 245.2 MB). Peak memory consumption was 415.0 MB. Max. memory is 11.5 GB. * Witness Printer took 51.60 ms. Allocated memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 30.9 MB). Free memory was 894.5 MB in the beginning and 1.4 GB in the end (delta: -475.1 MB). Peak memory consumption was 29.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 590]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 573]: Loop Invariant [2018-11-18 15:53:14,169 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:14,169 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:14,170 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:14,170 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,170 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:14,170 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:14,171 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,171 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,171 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,171 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:14,171 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,171 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:14,172 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-18 15:53:14,172 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-18 15:53:14,172 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,172 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:14,172 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:14,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-18 15:53:14,173 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((1 == unknown-#memory_int-unknown[head][head] && list == head) && \valid[m] == 1) && (!(m == #memory_$Pointer$[list][list + 4]) || ((m == #memory_$Pointer$[list][list + 4] || aux-m->val-aux == unknown-#memory_int-unknown[m][m]) && unknown-#memory_int-unknown[list][list] == 1))) && m == 0) && !(m == head)) && \valid[list] == 1) && 0 == unknown-#memory_int-unknown[m][m]) && (m == #memory_$Pointer$[list][list + 4] || aux-m->val-aux == unknown-#memory_int-unknown[m][m]) - InvariantResult [Line: 584]: Loop Invariant [2018-11-18 15:53:14,173 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-18 15:53:14,174 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-18 15:53:14,174 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,174 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,174 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-18 15:53:14,174 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_26,QUANTIFIED] [2018-11-18 15:53:14,175 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 15:53:14,175 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (\exists v_prenex_26 : int :: 2 * v_prenex_26 <= 100 && 2 * v_prenex_26 == unknown-#memory_int-unknown[m][m]) || unknown-#memory_int-unknown[m][m] <= 99 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 1 error locations. SAFE Result, 11.3s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 113 SDtfs, 176 SDslu, 550 SDs, 0 SdLazy, 487 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 154 SyntacticMatches, 11 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=5, 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, 6 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 19 NumberOfFragments, 116 HoareAnnotationTreeSize, 6 FomulaSimplifications, 872 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 1280 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 218 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 299 ConstructedInterpolants, 26 QuantifiedInterpolants, 116888 SizeOfPredicates, 64 NumberOfNonLiveVariables, 426 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 24/75 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...