./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/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 9eff01e8b41fd58fd007a4a54a96fca4ce69974c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:17:12,114 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:17:12,115 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:17:12,125 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:17:12,125 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:17:12,126 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:17:12,127 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:17:12,129 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:17:12,130 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:17:12,131 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:17:12,132 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:17:12,132 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:17:12,133 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:17:12,134 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:17:12,135 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:17:12,136 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:17:12,137 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:17:12,139 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:17:12,141 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:17:12,142 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:17:12,143 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:17:12,145 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:17:12,147 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:17:12,147 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:17:12,147 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:17:12,149 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:17:12,149 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:17:12,150 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:17:12,151 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:17:12,152 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:17:12,153 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:17:12,153 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:17:12,153 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:17:12,154 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:17:12,155 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:17:12,155 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:17:12,155 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 20:17:12,173 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:17:12,173 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:17:12,174 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:17:12,174 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 20:17:12,175 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 20:17:12,175 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 20:17:12,175 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 20:17:12,175 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 20:17:12,175 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 20:17:12,176 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 20:17:12,176 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 20:17:12,178 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:17:12,178 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:17:12,178 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:17:12,178 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:17:12,178 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:17:12,178 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:17:12,179 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:17:12,179 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:17:12,179 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:17:12,179 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:17:12,179 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:17:12,179 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:17:12,180 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:17:12,180 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:17:12,180 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:17:12,180 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:17:12,180 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:17:12,180 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:17:12,181 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:17:12,181 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 20:17:12,181 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:17:12,181 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:17:12,181 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:17:12,181 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_7809be12-b678-46e7-a7fa-16d359e094aa/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 -> 9eff01e8b41fd58fd007a4a54a96fca4ce69974c [2018-10-26 20:17:12,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:17:12,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:17:12,235 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:17:12,237 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:17:12,238 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:17:12,238 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/bin-2019/utaipan/../../sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-10-26 20:17:12,290 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/bin-2019/utaipan/data/0d8bf771b/133ab5384bb44107a85c9b289f876f21/FLAG15f1c73c4 [2018-10-26 20:17:12,678 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:17:12,679 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/sv-benchmarks/c/loops/invert_string_false-unreach-call_true-termination.i [2018-10-26 20:17:12,685 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/bin-2019/utaipan/data/0d8bf771b/133ab5384bb44107a85c9b289f876f21/FLAG15f1c73c4 [2018-10-26 20:17:12,698 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/bin-2019/utaipan/data/0d8bf771b/133ab5384bb44107a85c9b289f876f21 [2018-10-26 20:17:12,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:17:12,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:17:12,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:17:12,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:17:12,707 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:17:12,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:17:12" (1/1) ... [2018-10-26 20:17:12,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce68e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:17:12, skipping insertion in model container [2018-10-26 20:17:12,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:17:12" (1/1) ... [2018-10-26 20:17:12,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:17:12,742 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:17:12,878 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:17:12,881 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:17:12,898 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:17:12,915 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:17:12,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:17:12 WrapperNode [2018-10-26 20:17:12,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:17:12,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:17:12,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:17:12,917 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:17:12,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:17:12" (1/1) ... [2018-10-26 20:17:12,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:17:12" (1/1) ... [2018-10-26 20:17:12,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:17:12,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:17:12,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:17:12,962 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:17:12,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:17:12" (1/1) ... [2018-10-26 20:17:12,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:17:12" (1/1) ... [2018-10-26 20:17:12,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:17:12" (1/1) ... [2018-10-26 20:17:12,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:17:12" (1/1) ... [2018-10-26 20:17:12,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:17:12" (1/1) ... [2018-10-26 20:17:12,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:17:12" (1/1) ... [2018-10-26 20:17:12,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:17:12" (1/1) ... [2018-10-26 20:17:12,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:17:12,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:17:12,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:17:12,990 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:17:12,991 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:17:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/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-10-26 20:17:13,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:17:13,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:17:13,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:17:13,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:17:13,125 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:17:13,125 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:17:13,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-26 20:17:13,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-26 20:17:13,564 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:17:13,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:17:13 BoogieIcfgContainer [2018-10-26 20:17:13,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:17:13,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:17:13,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:17:13,570 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:17:13,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:17:12" (1/3) ... [2018-10-26 20:17:13,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fe32f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:17:13, skipping insertion in model container [2018-10-26 20:17:13,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:17:12" (2/3) ... [2018-10-26 20:17:13,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fe32f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:17:13, skipping insertion in model container [2018-10-26 20:17:13,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:17:13" (3/3) ... [2018-10-26 20:17:13,575 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_false-unreach-call_true-termination.i [2018-10-26 20:17:13,585 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:17:13,592 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:17:13,607 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:17:13,638 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:17:13,638 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:17:13,639 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:17:13,639 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:17:13,639 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:17:13,639 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:17:13,639 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:17:13,639 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:17:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-10-26 20:17:13,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-26 20:17:13,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:17:13,661 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:17:13,663 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:17:13,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:17:13,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1989464865, now seen corresponding path program 1 times [2018-10-26 20:17:13,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:17:13,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:13,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:17:13,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:13,714 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:17:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:17:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:17:13,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:17:13,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 20:17:13,791 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:17:13,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 20:17:13,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 20:17:13,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 20:17:13,809 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-10-26 20:17:13,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:17:13,827 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-10-26 20:17:13,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 20:17:13,829 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-10-26 20:17:13,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:17:13,836 INFO L225 Difference]: With dead ends: 51 [2018-10-26 20:17:13,836 INFO L226 Difference]: Without dead ends: 25 [2018-10-26 20:17:13,839 INFO L605 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-10-26 20:17:13,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-26 20:17:13,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-26 20:17:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-26 20:17:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-26 20:17:13,871 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-10-26 20:17:13,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:17:13,872 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-26 20:17:13,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 20:17:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-26 20:17:13,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 20:17:13,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:17:13,873 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:17:13,874 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:17:13,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:17:13,874 INFO L82 PathProgramCache]: Analyzing trace with hash 971272842, now seen corresponding path program 1 times [2018-10-26 20:17:13,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:17:13,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:13,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:17:13,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:13,875 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:17:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:17:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:17:14,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:17:14,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 20:17:14,055 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:17:14,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:17:14,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:17:14,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:17:14,057 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-10-26 20:17:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:17:14,209 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-10-26 20:17:14,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 20:17:14,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-26 20:17:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:17:14,210 INFO L225 Difference]: With dead ends: 42 [2018-10-26 20:17:14,210 INFO L226 Difference]: Without dead ends: 28 [2018-10-26 20:17:14,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:17:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-26 20:17:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-10-26 20:17:14,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-26 20:17:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-10-26 20:17:14,218 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-10-26 20:17:14,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:17:14,218 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-10-26 20:17:14,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:17:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-10-26 20:17:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 20:17:14,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:17:14,219 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:17:14,220 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:17:14,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:17:14,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1585722772, now seen corresponding path program 1 times [2018-10-26 20:17:14,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:17:14,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:14,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:17:14,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:14,222 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:17:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:17:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:17:14,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:17:14,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 20:17:14,325 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:17:14,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:17:14,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:17:14,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:17:14,327 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2018-10-26 20:17:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:17:14,577 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-10-26 20:17:14,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:17:14,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-10-26 20:17:14,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:17:14,580 INFO L225 Difference]: With dead ends: 53 [2018-10-26 20:17:14,580 INFO L226 Difference]: Without dead ends: 35 [2018-10-26 20:17:14,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:17:14,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-26 20:17:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-10-26 20:17:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-26 20:17:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-26 20:17:14,588 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2018-10-26 20:17:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:17:14,588 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-26 20:17:14,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:17:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-26 20:17:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 20:17:14,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:17:14,589 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:17:14,589 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:17:14,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:17:14,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1045245671, now seen corresponding path program 1 times [2018-10-26 20:17:14,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:17:14,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:14,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:17:14,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:14,591 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:17:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:17:15,247 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2018-10-26 20:17:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:17:15,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:17:15,501 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:17:15,502 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-26 20:17:15,504 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [31], [35], [39], [44], [54], [57], [59], [65], [66], [67], [69] [2018-10-26 20:17:15,554 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:17:15,555 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:17:15,691 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:17:19,196 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:17:19,198 INFO L272 AbstractInterpreter]: Visited 22 different actions 472 times. Merged at 12 different actions 311 times. Widened at 4 different actions 71 times. Found 31 fixpoints after 5 different actions. Largest state had 40 variables. [2018-10-26 20:17:19,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:17:19,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:17:19,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:17:19,247 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/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-10-26 20:17:19,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:17:19,254 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:17:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:17:19,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:17:19,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 20:17:19,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:19,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:19,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-26 20:17:20,066 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-26 20:17:20,153 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 15 treesize of output 17 [2018-10-26 20:17:20,165 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 12 treesize of output 11 [2018-10-26 20:17:20,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:20,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:20,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:20,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-10-26 20:17:20,307 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 28 treesize of output 24 [2018-10-26 20:17:20,318 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:17:20,318 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 20:17:20,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:20,324 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 11 treesize of output 3 [2018-10-26 20:17:20,325 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:20,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:20,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:20,346 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-10-26 20:17:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:17:20,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:17:20,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-10-26 20:17:20,510 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-26 20:17:20,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:20,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-26 20:17:20,521 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:20,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:17:20,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:17:20,545 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:37, output treesize:15 [2018-10-26 20:17:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:17:20,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:17:20,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2018-10-26 20:17:20,675 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:17:20,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-26 20:17:20,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-26 20:17:20,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2018-10-26 20:17:20,677 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 21 states. [2018-10-26 20:17:21,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:17:21,306 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-10-26 20:17:21,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 20:17:21,308 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-10-26 20:17:21,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:17:21,308 INFO L225 Difference]: With dead ends: 59 [2018-10-26 20:17:21,309 INFO L226 Difference]: Without dead ends: 57 [2018-10-26 20:17:21,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=245, Invalid=1015, Unknown=0, NotChecked=0, Total=1260 [2018-10-26 20:17:21,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-26 20:17:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 46. [2018-10-26 20:17:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-26 20:17:21,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-10-26 20:17:21,315 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 24 [2018-10-26 20:17:21,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:17:21,316 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-10-26 20:17:21,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-26 20:17:21,316 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-10-26 20:17:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 20:17:21,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:17:21,317 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:17:21,317 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:17:21,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:17:21,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1367946380, now seen corresponding path program 2 times [2018-10-26 20:17:21,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:17:21,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:21,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:17:21,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:21,319 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:17:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:17:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:17:21,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:17:21,386 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:17:21,386 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:17:21,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:17:21,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:17:21,386 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/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-10-26 20:17:21,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 20:17:21,396 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 20:17:21,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-26 20:17:21,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 20:17:21,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:17:21,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 20:17:21,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:21,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:21,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-26 20:17:21,462 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 15 treesize of output 17 [2018-10-26 20:17:21,465 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 12 treesize of output 11 [2018-10-26 20:17:21,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:21,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:21,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:21,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-10-26 20:17:21,589 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 28 treesize of output 24 [2018-10-26 20:17:21,592 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 13 treesize of output 5 [2018-10-26 20:17:21,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:21,610 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:17:21,610 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-10-26 20:17:21,611 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:21,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:21,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:21,619 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:38, output treesize:3 [2018-10-26 20:17:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:17:21,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:17:21,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2018-10-26 20:17:21,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-10-26 20:17:21,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:21,814 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-10-26 20:17:21,815 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:21,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:17:21,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:17:21,835 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:28 [2018-10-26 20:17:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:17:21,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:17:21,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 22 [2018-10-26 20:17:21,910 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:17:21,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 20:17:21,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 20:17:21,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-10-26 20:17:21,911 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 15 states. [2018-10-26 20:17:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:17:22,672 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-10-26 20:17:22,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-26 20:17:22,673 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-10-26 20:17:22,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:17:22,674 INFO L225 Difference]: With dead ends: 87 [2018-10-26 20:17:22,674 INFO L226 Difference]: Without dead ends: 63 [2018-10-26 20:17:22,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=269, Invalid=1213, Unknown=0, NotChecked=0, Total=1482 [2018-10-26 20:17:22,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-26 20:17:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 52. [2018-10-26 20:17:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-26 20:17:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-10-26 20:17:22,684 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 27 [2018-10-26 20:17:22,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:17:22,684 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-10-26 20:17:22,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 20:17:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-10-26 20:17:22,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 20:17:22,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:17:22,685 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, 1] [2018-10-26 20:17:22,686 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:17:22,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:17:22,686 INFO L82 PathProgramCache]: Analyzing trace with hash 260616490, now seen corresponding path program 3 times [2018-10-26 20:17:22,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:17:22,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:22,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 20:17:22,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:22,687 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:17:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:17:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:17:23,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:17:23,072 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:17:23,072 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:17:23,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:17:23,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:17:23,072 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/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-10-26 20:17:23,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-26 20:17:23,079 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-26 20:17:23,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-26 20:17:23,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 20:17:23,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:17:23,112 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 11 treesize of output 8 [2018-10-26 20:17:23,114 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-10-26 20:17:23,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:23,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:23,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:23,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-10-26 20:17:23,145 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 11 treesize of output 8 [2018-10-26 20:17:23,148 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-10-26 20:17:23,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:23,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:23,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:23,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2018-10-26 20:17:23,196 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 17 treesize of output 30 [2018-10-26 20:17:23,200 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 19 treesize of output 18 [2018-10-26 20:17:23,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:23,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:23,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:23,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-10-26 20:17:23,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-10-26 20:17:23,409 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:17:23,409 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 11 [2018-10-26 20:17:23,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:23,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:23,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:23,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:36, output treesize:3 [2018-10-26 20:17:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:17:23,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:17:24,012 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-26 20:17:24,022 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 20:17:24,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:17:24,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 29 [2018-10-26 20:17:24,050 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:17:24,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-26 20:17:24,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-26 20:17:24,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2018-10-26 20:17:24,051 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 22 states. [2018-10-26 20:17:24,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:17:24,666 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2018-10-26 20:17:24,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 20:17:24,666 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2018-10-26 20:17:24,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:17:24,668 INFO L225 Difference]: With dead ends: 85 [2018-10-26 20:17:24,669 INFO L226 Difference]: Without dead ends: 83 [2018-10-26 20:17:24,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=218, Invalid=1114, Unknown=0, NotChecked=0, Total=1332 [2018-10-26 20:17:24,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-26 20:17:24,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 55. [2018-10-26 20:17:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-26 20:17:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-10-26 20:17:24,678 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 30 [2018-10-26 20:17:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:17:24,678 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-10-26 20:17:24,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-26 20:17:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-10-26 20:17:24,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-26 20:17:24,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:17:24,679 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:17:24,679 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:17:24,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:17:24,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1439664076, now seen corresponding path program 4 times [2018-10-26 20:17:24,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:17:24,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:24,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 20:17:24,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:24,683 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:17:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:17:24,774 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:17:24,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:17:24,774 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:17:24,774 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:17:24,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:17:24,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:17:24,774 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/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-10-26 20:17:24,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:17:24,781 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:17:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:17:24,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:17:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:17:24,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:17:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:17:24,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:17:24,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 8 [2018-10-26 20:17:24,929 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:17:24,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 20:17:24,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 20:17:24,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:17:24,930 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 8 states. [2018-10-26 20:17:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:17:25,081 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2018-10-26 20:17:25,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 20:17:25,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-10-26 20:17:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:17:25,082 INFO L225 Difference]: With dead ends: 122 [2018-10-26 20:17:25,083 INFO L226 Difference]: Without dead ends: 96 [2018-10-26 20:17:25,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-10-26 20:17:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-26 20:17:25,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 58. [2018-10-26 20:17:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-26 20:17:25,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-10-26 20:17:25,095 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 33 [2018-10-26 20:17:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:17:25,095 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-10-26 20:17:25,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 20:17:25,095 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-10-26 20:17:25,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 20:17:25,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:17:25,096 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:17:25,096 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:17:25,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:17:25,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1967307697, now seen corresponding path program 1 times [2018-10-26 20:17:25,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:17:25,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:25,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:17:25,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:25,098 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:17:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:17:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 20:17:25,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:17:25,198 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:17:25,198 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-10-26 20:17:25,199 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [31], [35], [39], [44], [46], [48], [54], [57], [59], [62], [64], [65], [66], [67], [69], [70] [2018-10-26 20:17:25,201 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:17:25,201 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:17:25,208 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:17:30,223 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:17:30,223 INFO L272 AbstractInterpreter]: Visited 27 different actions 887 times. Merged at 15 different actions 490 times. Widened at 5 different actions 96 times. Found 59 fixpoints after 6 different actions. Largest state had 42 variables. [2018-10-26 20:17:30,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:17:30,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:17:30,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:17:30,261 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 20:17:30,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:17:30,276 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:17:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:17:30,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:17:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 20:17:30,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:17:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 20:17:30,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:17:30,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2018-10-26 20:17:30,660 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:17:30,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:17:30,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:17:30,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:17:30,660 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 7 states. [2018-10-26 20:17:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:17:30,815 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-10-26 20:17:30,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:17:30,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2018-10-26 20:17:30,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:17:30,816 INFO L225 Difference]: With dead ends: 96 [2018-10-26 20:17:30,816 INFO L226 Difference]: Without dead ends: 68 [2018-10-26 20:17:30,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-10-26 20:17:30,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-26 20:17:30,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2018-10-26 20:17:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-26 20:17:30,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-10-26 20:17:30,822 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 36 [2018-10-26 20:17:30,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:17:30,822 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-10-26 20:17:30,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:17:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-10-26 20:17:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 20:17:30,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:17:30,823 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:17:30,825 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:17:30,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:17:30,825 INFO L82 PathProgramCache]: Analyzing trace with hash 144640967, now seen corresponding path program 5 times [2018-10-26 20:17:30,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:17:30,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:30,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:17:30,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:30,827 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:17:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:17:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:17:31,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:17:31,138 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:17:31,138 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-26 20:17:31,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-26 20:17:31,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:17:31,139 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:17:31,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-26 20:17:31,146 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-26 20:17:31,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-26 20:17:31,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-26 20:17:31,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:17:31,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 20:17:31,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-26 20:17:31,265 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:17:31,266 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-10-26 20:17:31,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-10-26 20:17:31,305 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:17:31,307 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-10-26 20:17:31,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-10-26 20:17:31,366 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:17:31,368 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-10-26 20:17:31,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-10-26 20:17:31,609 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 17 treesize of output 19 [2018-10-26 20:17:31,611 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 14 treesize of output 13 [2018-10-26 20:17:31,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-10-26 20:17:31,781 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 30 treesize of output 26 [2018-10-26 20:17:31,792 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 15 treesize of output 7 [2018-10-26 20:17:31,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,833 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:17:31,834 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 20:17:31,834 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:31,842 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:3 [2018-10-26 20:17:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-26 20:17:31,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:17:34,150 WARN L179 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 29 [2018-10-26 20:17:36,235 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 32 [2018-10-26 20:17:36,242 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:17:36,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:17:36,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:17:36,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:133, output treesize:1 [2018-10-26 20:17:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-26 20:17:36,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:17:36,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14] total 38 [2018-10-26 20:17:36,264 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:17:36,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-26 20:17:36,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-26 20:17:36,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1222, Unknown=0, NotChecked=0, Total=1406 [2018-10-26 20:17:36,265 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 27 states. [2018-10-26 20:17:37,695 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-10-26 20:17:37,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:17:37,968 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2018-10-26 20:17:37,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-26 20:17:37,969 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-10-26 20:17:37,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:17:37,969 INFO L225 Difference]: With dead ends: 137 [2018-10-26 20:17:37,969 INFO L226 Difference]: Without dead ends: 135 [2018-10-26 20:17:37,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=662, Invalid=3120, Unknown=0, NotChecked=0, Total=3782 [2018-10-26 20:17:37,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-26 20:17:37,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2018-10-26 20:17:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-26 20:17:37,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-10-26 20:17:37,983 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 36 [2018-10-26 20:17:37,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:17:37,983 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-10-26 20:17:37,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-26 20:17:37,983 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-10-26 20:17:37,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 20:17:37,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:17:37,984 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:17:37,986 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:17:37,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:17:37,986 INFO L82 PathProgramCache]: Analyzing trace with hash -669879850, now seen corresponding path program 2 times [2018-10-26 20:17:37,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:17:37,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:37,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-26 20:17:37,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:17:37,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:17:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:17:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:17:38,045 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 20:17:38,057 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,058 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,058 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,058 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,059 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,059 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,059 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,059 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,060 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,060 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,063 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,064 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,064 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,064 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,064 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,064 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,065 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,065 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,065 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,065 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,066 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,066 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,066 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,066 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,067 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,068 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,068 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,074 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,075 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,075 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,075 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,075 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,076 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,076 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,076 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,076 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,076 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,077 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,077 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,077 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,077 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,077 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,078 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,078 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,078 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:17:38 BoogieIcfgContainer [2018-10-26 20:17:38,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:17:38,105 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:17:38,105 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:17:38,105 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:17:38,107 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:17:13" (3/4) ... [2018-10-26 20:17:38,109 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 20:17:38,110 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,110 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,111 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,111 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,111 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,111 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,111 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,111 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,111 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,112 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,112 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,112 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,112 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,116 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,117 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,117 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,118 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,118 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,119 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,119 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,119 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,119 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,119 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,119 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,119 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,119 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,120 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,120 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,120 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,120 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,120 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,120 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,120 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,120 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,121 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,121 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,121 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,121 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,121 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,121 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,121 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,122 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,122 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,122 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,122 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,122 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,122 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,122 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,122 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,123 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,123 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,123 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:17:38,181 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_7809be12-b678-46e7-a7fa-16d359e094aa/bin-2019/utaipan/witness.graphml [2018-10-26 20:17:38,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:17:38,182 INFO L168 Benchmark]: Toolchain (without parser) took 25480.66 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 959.8 MB in the beginning and 1.1 GB in the end (delta: -104.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-10-26 20:17:38,182 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:17:38,182 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.77 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:17:38,183 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.42 ms. Allocated memory is still 1.0 GB. Free memory was 949.1 MB in the beginning and 946.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:17:38,183 INFO L168 Benchmark]: Boogie Preprocessor took 28.01 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:17:38,183 INFO L168 Benchmark]: RCFGBuilder took 575.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-10-26 20:17:38,183 INFO L168 Benchmark]: TraceAbstraction took 24538.86 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-10-26 20:17:38,184 INFO L168 Benchmark]: Witness Printer took 76.27 ms. Allocated memory is still 2.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-10-26 20:17:38,185 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 213.77 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.42 ms. Allocated memory is still 1.0 GB. Free memory was 949.1 MB in the beginning and 946.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.01 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 575.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -174.8 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24538.86 ms. Allocated memory was 1.2 GB in the beginning and 2.4 GB in the end (delta: 1.2 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 76.27 ms. Allocated memory is still 2.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L13] int MAX = __VERIFIER_nondet_uint(); [L14] CALL char str1[MAX], str2[MAX]; [L14] RET char str1[MAX], str2[MAX]; [L14] RET char str1[MAX], str2[MAX]; [L15] int cont, i, j; [L16] cont = 0 [L18] i=0 [L18] COND TRUE i= 0 [L26] CALL, EXPR str1[0] [L26] RET, EXPR str1[0] [L26] CALL str2[j] = str1[0] [L26] RET str2[j] = str1[0] [L27] j++ [L25] i-- [L25] COND TRUE i >= 0 [L26] CALL, EXPR str1[0] [L26] RET, EXPR str1[0] [L26] CALL str2[j] = str1[0] [L26] RET str2[j] = str1[0] [L27] j++ [L25] i-- [L25] COND FALSE !(i >= 0) [L30] j = MAX-1 [L31] i=0 [L31] COND TRUE i