./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.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_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/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 33e42f4b3b45c436d08f92209409517a203ca824 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:31:50,209 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:31:50,210 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:31:50,217 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:31:50,217 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:31:50,218 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:31:50,219 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:31:50,220 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:31:50,221 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:31:50,222 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:31:50,223 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:31:50,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:31:50,223 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:31:50,224 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:31:50,225 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:31:50,225 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:31:50,226 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:31:50,228 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:31:50,229 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:31:50,230 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:31:50,231 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:31:50,232 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:31:50,233 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:31:50,233 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:31:50,234 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:31:50,234 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:31:50,236 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:31:50,236 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:31:50,237 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:31:50,238 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:31:50,238 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:31:50,239 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:31:50,239 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:31:50,239 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:31:50,239 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:31:50,240 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:31:50,240 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 13:31:50,247 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:31:50,247 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:31:50,248 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:31:50,248 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:31:50,248 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:31:50,248 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:31:50,248 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 13:31:50,248 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:31:50,248 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 13:31:50,249 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 13:31:50,249 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:31:50,249 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:31:50,249 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:31:50,250 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:31:50,250 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:31:50,250 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:31:50,250 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:31:50,250 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:31:50,250 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:31:50,250 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:31:50,251 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:31:50,251 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:31:50,251 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:31:50,251 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:31:50,251 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:31:50,251 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:31:50,251 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:31:50,251 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:31:50,252 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:31:50,252 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:31:50,252 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 13:31:50,252 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:31:50,252 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:31:50,252 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 13:31:50,252 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_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/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 -> 33e42f4b3b45c436d08f92209409517a203ca824 [2018-11-10 13:31:50,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:31:50,285 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:31:50,288 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:31:50,289 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:31:50,289 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:31:50,290 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-10 13:31:50,330 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/data/5bfb74e2e/7c93fb5745ae4ab89030ddc775779e52/FLAG2313ad178 [2018-11-10 13:31:50,760 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:31:50,761 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/sv-benchmarks/c/list-simple/sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-10 13:31:50,767 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/data/5bfb74e2e/7c93fb5745ae4ab89030ddc775779e52/FLAG2313ad178 [2018-11-10 13:31:50,776 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/data/5bfb74e2e/7c93fb5745ae4ab89030ddc775779e52 [2018-11-10 13:31:50,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:31:50,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:31:50,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:31:50,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:31:50,782 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:31:50,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:31:50" (1/1) ... [2018-11-10 13:31:50,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77125104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:31:50, skipping insertion in model container [2018-11-10 13:31:50,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:31:50" (1/1) ... [2018-11-10 13:31:50,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:31:50,817 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:31:50,999 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:31:51,006 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:31:51,039 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:31:51,071 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:31:51,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:31:51 WrapperNode [2018-11-10 13:31:51,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:31:51,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:31:51,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:31:51,073 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:31:51,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:31:51" (1/1) ... [2018-11-10 13:31:51,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:31:51" (1/1) ... [2018-11-10 13:31:51,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:31:51,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:31:51,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:31:51,145 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:31:51,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:31:51" (1/1) ... [2018-11-10 13:31:51,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:31:51" (1/1) ... [2018-11-10 13:31:51,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:31:51" (1/1) ... [2018-11-10 13:31:51,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:31:51" (1/1) ... [2018-11-10 13:31:51,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:31:51" (1/1) ... [2018-11-10 13:31:51,161 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:31:51" (1/1) ... [2018-11-10 13:31:51,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:31:51" (1/1) ... [2018-11-10 13:31:51,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:31:51,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:31:51,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:31:51,165 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:31:51,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:31:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:31:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-10 13:31:51,214 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-10 13:31:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-10 13:31:51,214 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-10 13:31:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:31:51,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:31:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:31:51,215 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:31:51,215 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2018-11-10 13:31:51,215 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2018-11-10 13:31:51,215 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-11-10 13:31:51,215 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-11-10 13:31:51,215 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-11-10 13:31:51,215 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-11-10 13:31:51,215 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2018-11-10 13:31:51,215 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2018-11-10 13:31:51,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:31:51,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:31:51,507 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:31:51,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:31:51 BoogieIcfgContainer [2018-11-10 13:31:51,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:31:51,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:31:51,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:31:51,511 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:31:51,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:31:50" (1/3) ... [2018-11-10 13:31:51,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35095c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:31:51, skipping insertion in model container [2018-11-10 13:31:51,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:31:51" (2/3) ... [2018-11-10 13:31:51,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35095c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:31:51, skipping insertion in model container [2018-11-10 13:31:51,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:31:51" (3/3) ... [2018-11-10 13:31:51,515 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-10 13:31:51,523 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:31:51,528 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:31:51,540 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:31:51,565 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:31:51,565 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:31:51,565 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:31:51,565 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:31:51,565 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:31:51,565 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:31:51,565 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:31:51,566 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:31:51,576 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-11-10 13:31:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 13:31:51,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:51,582 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:31:51,584 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:51,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:51,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1149182898, now seen corresponding path program 1 times [2018-11-10 13:31:51,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:51,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:51,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:51,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:51,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:51,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:31:51,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:51,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:31:51,717 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:51,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 13:31:51,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:31:51,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:31:51,729 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-11-10 13:31:51,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:51,748 INFO L93 Difference]: Finished difference Result 106 states and 134 transitions. [2018-11-10 13:31:51,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:31:51,749 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 33 [2018-11-10 13:31:51,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:51,754 INFO L225 Difference]: With dead ends: 106 [2018-11-10 13:31:51,755 INFO L226 Difference]: Without dead ends: 48 [2018-11-10 13:31:51,757 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-11-10 13:31:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-10 13:31:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-10 13:31:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-10 13:31:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-11-10 13:31:51,790 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 33 [2018-11-10 13:31:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:51,791 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-11-10 13:31:51,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 13:31:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-10 13:31:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-10 13:31:51,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:51,793 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:31:51,794 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:51,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:51,794 INFO L82 PathProgramCache]: Analyzing trace with hash -822594058, now seen corresponding path program 1 times [2018-11-10 13:31:51,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:51,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:51,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:51,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:51,796 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:31:51,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:51,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:31:51,872 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:51,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:31:51,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:31:51,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:31:51,873 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 4 states. [2018-11-10 13:31:51,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:51,940 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2018-11-10 13:31:51,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:31:51,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-10 13:31:51,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:51,942 INFO L225 Difference]: With dead ends: 75 [2018-11-10 13:31:51,942 INFO L226 Difference]: Without dead ends: 60 [2018-11-10 13:31:51,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:31:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-10 13:31:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2018-11-10 13:31:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 13:31:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-11-10 13:31:51,951 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 36 [2018-11-10 13:31:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:51,952 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-11-10 13:31:51,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:31:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-10 13:31:51,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-10 13:31:51,953 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:51,953 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:31:51,954 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:51,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:51,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1330775126, now seen corresponding path program 1 times [2018-11-10 13:31:51,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:51,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:51,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:51,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:51,956 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:52,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:31:52,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:52,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:31:52,031 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:52,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:31:52,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:31:52,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:31:52,032 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 5 states. [2018-11-10 13:31:52,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:52,069 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-10 13:31:52,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:31:52,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-10 13:31:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:52,071 INFO L225 Difference]: With dead ends: 85 [2018-11-10 13:31:52,071 INFO L226 Difference]: Without dead ends: 54 [2018-11-10 13:31:52,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:31:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-10 13:31:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-10 13:31:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 13:31:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-10 13:31:52,076 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 46 [2018-11-10 13:31:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:52,076 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-10 13:31:52,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:31:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-11-10 13:31:52,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 13:31:52,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:52,077 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:31:52,077 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:52,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:52,077 INFO L82 PathProgramCache]: Analyzing trace with hash -405441186, now seen corresponding path program 1 times [2018-11-10 13:31:52,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:52,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:52,078 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-10 13:31:52,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:31:52,170 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:31:52,171 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-10 13:31:52,172 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [20], [21], [22], [24], [28], [32], [34], [36], [40], [41], [45], [47], [51], [54], [56], [59], [63], [67], [72], [74], [77], [87], [112], [116], [120], [126], [127], [128], [134], [136], [137], [138], [139], [140], [141], [142], [143], [144], [146], [147], [148], [149], [150], [151] [2018-11-10 13:31:52,208 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:31:52,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:31:52,449 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:31:52,450 INFO L272 AbstractInterpreter]: Visited 32 different actions 39 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-10 13:31:52,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:52,460 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:31:52,742 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 76.91% of their original sizes. [2018-11-10 13:31:52,742 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:31:53,344 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-10 13:31:53,344 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:31:53,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:31:53,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [5] total 23 [2018-11-10 13:31:53,345 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:53,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 13:31:53,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 13:31:53,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-11-10 13:31:53,346 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 20 states. [2018-11-10 13:31:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:54,797 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-11-10 13:31:54,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 13:31:54,797 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-11-10 13:31:54,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:54,798 INFO L225 Difference]: With dead ends: 87 [2018-11-10 13:31:54,798 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 13:31:54,799 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-11-10 13:31:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 13:31:54,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-10 13:31:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-10 13:31:54,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-11-10 13:31:54,812 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 55 [2018-11-10 13:31:54,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:54,812 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-11-10 13:31:54,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 13:31:54,813 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-11-10 13:31:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-10 13:31:54,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:54,814 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:31:54,814 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:54,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:54,814 INFO L82 PathProgramCache]: Analyzing trace with hash -317390568, now seen corresponding path program 1 times [2018-11-10 13:31:54,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:54,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:54,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:54,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:54,817 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 13:31:54,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:31:54,872 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:31:54,873 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-11-10 13:31:54,873 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [20], [21], [22], [24], [28], [32], [34], [36], [40], [41], [45], [47], [51], [54], [56], [59], [63], [67], [72], [74], [77], [87], [112], [116], [120], [122], [126], [127], [128], [134], [136], [137], [138], [139], [140], [141], [142], [143], [144], [146], [147], [148], [149], [150], [151] [2018-11-10 13:31:54,875 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:31:54,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:31:55,092 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 13:31:55,092 INFO L272 AbstractInterpreter]: Visited 44 different actions 146 times. Merged at 15 different actions 53 times. Never widened. Found 12 fixpoints after 4 different actions. Largest state had 42 variables. [2018-11-10 13:31:55,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:55,099 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 13:31:55,276 INFO L227 lantSequenceWeakener]: Weakened 50 states. On average, predicates are now at 77.47% of their original sizes. [2018-11-10 13:31:55,276 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 13:31:55,836 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-11-10 13:31:55,836 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 13:31:55,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:31:55,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [5] total 30 [2018-11-10 13:31:55,836 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:55,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-10 13:31:55,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-10 13:31:55,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2018-11-10 13:31:55,837 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 27 states. [2018-11-10 13:31:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:58,188 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2018-11-10 13:31:58,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 13:31:58,188 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 57 [2018-11-10 13:31:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:58,189 INFO L225 Difference]: With dead ends: 97 [2018-11-10 13:31:58,189 INFO L226 Difference]: Without dead ends: 82 [2018-11-10 13:31:58,190 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=1699, Unknown=0, NotChecked=0, Total=1892 [2018-11-10 13:31:58,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-10 13:31:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2018-11-10 13:31:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 13:31:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-11-10 13:31:58,203 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 57 [2018-11-10 13:31:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:58,204 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-11-10 13:31:58,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-10 13:31:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-11-10 13:31:58,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 13:31:58,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:58,205 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:31:58,205 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:58,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:58,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1776690450, now seen corresponding path program 1 times [2018-11-10 13:31:58,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:58,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:58,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:58,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:58,209 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:58,857 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:31:58,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:31:58,858 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:31:58,858 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 70 with the following transitions: [2018-11-10 13:31:58,858 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [16], [20], [21], [22], [24], [28], [32], [34], [36], [40], [41], [45], [47], [51], [54], [56], [59], [63], [67], [72], [74], [77], [87], [112], [116], [120], [122], [126], [127], [128], [134], [136], [137], [138], [139], [140], [141], [142], [143], [144], [146], [147], [148], [149], [150], [151] [2018-11-10 13:31:58,860 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:31:58,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:31:59,257 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:31:59,257 INFO L272 AbstractInterpreter]: Visited 51 different actions 176 times. Merged at 21 different actions 67 times. Never widened. Found 15 fixpoints after 5 different actions. Largest state had 42 variables. [2018-11-10 13:31:59,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:59,264 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:31:59,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:31:59,264 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:31:59,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:59,270 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:31:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:59,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:31:59,389 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 6 treesize of output 5 [2018-11-10 13:31:59,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:31:59,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:59,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 13:31:59,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:31:59,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:31:59,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 13:31:59,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:31:59,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:59,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-10 13:31:59,546 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-11-10 13:31:59,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-11-10 13:31:59,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:31:59,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:59,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:59,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-10 13:31:59,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-10 13:31:59,593 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-11-10 13:31:59,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:31:59,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:59,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:59,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:8 [2018-11-10 13:32:01,735 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~s~0.base_BEFORE_CALL_1 Int) (v_main_~s~0.offset_BEFORE_CALL_1 Int)) (not (= (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_1) v_main_~s~0.offset_BEFORE_CALL_1) v_main_~s~0.base_BEFORE_CALL_1))) is different from true [2018-11-10 13:32:04,374 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-10 13:32:06,441 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-10 13:32:06,447 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 25 treesize of output 18 [2018-11-10 13:32:06,449 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 18 treesize of output 17 [2018-11-10 13:32:06,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:06,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:06,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:06,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2018-11-10 13:32:08,501 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-10 13:32:08,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-11-10 13:32:08,554 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 1 [2018-11-10 13:32:08,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:08,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:08,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:08,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:12 [2018-11-10 13:32:14,607 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 12 [2018-11-10 13:32:18,642 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 13:32:18,647 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_main_~s~0.base_BEFORE_CALL_2 Int) (v_main_~s~0.offset_BEFORE_CALL_2 Int)) (not (= v_main_~s~0.base_BEFORE_CALL_2 (select (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_2)))) (exists ((|sll_circular_update_at_write~int_#ptr.offset| Int) (|sll_circular_update_at_write~int_#value| Int)) (= (store |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_circular_update_at_#in~head.base|) |sll_circular_update_at_write~int_#ptr.offset| |sll_circular_update_at_write~int_#value|)) |c_#memory_int|))) is different from true [2018-11-10 13:32:18,655 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 33 treesize of output 38 [2018-11-10 13:32:18,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:32:18,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:18,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:18,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:18,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:41 [2018-11-10 13:32:18,993 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 68 treesize of output 66 [2018-11-10 13:32:19,001 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 1 case distinctions, treesize of input 58 treesize of output 56 [2018-11-10 13:32:19,002 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 13:32:19,071 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 62 treesize of output 56 [2018-11-10 13:32:19,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:19,093 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 56 treesize of output 52 [2018-11-10 13:32:19,094 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:19,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-10 13:32:19,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 52 treesize of output 54 [2018-11-10 13:32:19,152 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 50 treesize of output 48 [2018-11-10 13:32:19,153 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:19,170 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 48 treesize of output 44 [2018-11-10 13:32:19,171 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:19,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-10 13:32:19,190 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:19,220 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-10 13:32:19,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 48 treesize of output 50 [2018-11-10 13:32:19,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2018-11-10 13:32:19,229 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:19,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-11-10 13:32:19,245 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:19,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2018-11-10 13:32:19,264 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 13:32:19,282 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-10 13:32:19,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-11-10 13:32:19,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-10 13:32:19,287 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:19,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-10 13:32:19,294 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:19,300 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:19,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-10 13:32:19,348 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 22 treesize of output 3 [2018-11-10 13:32:19,349 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:19,353 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:19,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-10 13:32:19,356 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 22 treesize of output 3 [2018-11-10 13:32:19,357 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:19,360 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:19,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 44 treesize of output 46 [2018-11-10 13:32:19,367 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 42 treesize of output 35 [2018-11-10 13:32:19,367 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:19,384 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 38 treesize of output 20 [2018-11-10 13:32:19,384 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:19,399 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:19,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-10 13:32:19,402 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 3 [2018-11-10 13:32:19,402 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:19,405 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:19,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 40 treesize of output 42 [2018-11-10 13:32:19,412 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 38 treesize of output 31 [2018-11-10 13:32:19,413 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:19,427 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 31 treesize of output 20 [2018-11-10 13:32:19,427 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:19,442 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 34 treesize of output 16 [2018-11-10 13:32:19,442 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:19,449 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:19,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 40 treesize of output 42 [2018-11-10 13:32:19,456 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 34 treesize of output 16 [2018-11-10 13:32:19,457 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:19,471 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:19,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:19,489 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 7 variables, input treesize:71, output treesize:7 [2018-11-10 13:32:19,532 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2018-11-10 13:32:19,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:32:20,224 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-10 13:32:20,229 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:32:28,463 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:32:28,470 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:32:36,683 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:32:36,688 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:32:36,694 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-10 13:32:49,021 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 81 [2018-11-10 13:32:49,088 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 49 [2018-11-10 13:32:49,102 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-11-10 13:32:49,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-11-10 13:32:49,117 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 12 treesize of output 1 [2018-11-10 13:32:49,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,120 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-11-10 13:32:49,123 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 28 treesize of output 7 [2018-11-10 13:32:49,123 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,125 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 13:32:49,154 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 49 [2018-11-10 13:32:49,167 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-11-10 13:32:49,167 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2018-11-10 13:32:49,181 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 28 treesize of output 7 [2018-11-10 13:32:49,181 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,183 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-11-10 13:32:49,186 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 12 treesize of output 1 [2018-11-10 13:32:49,186 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,189 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,199 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-10 13:32:49,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 13:32:49,226 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 7 treesize of output 5 [2018-11-10 13:32:49,226 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,228 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-10 13:32:49,231 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 8 treesize of output 1 [2018-11-10 13:32:49,231 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,240 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-10 13:32:49,259 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 7 treesize of output 5 [2018-11-10 13:32:49,259 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,260 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-10 13:32:49,263 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 8 treesize of output 1 [2018-11-10 13:32:49,263 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,265 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:32:49,275 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 8 variables, input treesize:147, output treesize:23 [2018-11-10 13:32:49,444 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 62 [2018-11-10 13:32:49,468 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 11 treesize of output 10 [2018-11-10 13:32:49,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,480 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 1 case distinctions, treesize of input 32 treesize of output 36 [2018-11-10 13:32:49,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-10 13:32:49,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-10 13:32:49,492 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,502 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2018-11-10 13:32:49,502 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 13:32:49,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:32:49,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:32:49,540 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 62 [2018-11-10 13:32:49,558 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 11 treesize of output 10 [2018-11-10 13:32:49,559 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,570 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 1 case distinctions, treesize of input 32 treesize of output 36 [2018-11-10 13:32:49,577 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2018-11-10 13:32:49,578 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-10 13:32:49,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-11-10 13:32:49,588 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-10 13:32:49,596 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,601 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:32:49,609 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:32:49,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-11-10 13:32:49,649 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:143, output treesize:183 [2018-11-10 13:32:49,797 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 33 treesize of output 37 [2018-11-10 13:32:49,799 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 32 treesize of output 30 [2018-11-10 13:32:49,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,823 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 29 treesize of output 28 [2018-11-10 13:32:49,823 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:49,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:32:49,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 5 xjuncts. [2018-11-10 13:32:49,860 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:125, output treesize:142 [2018-11-10 13:32:50,285 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-10 13:32:50,296 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 9 treesize of output 8 [2018-11-10 13:32:50,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:50,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 13:32:50,308 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 13 treesize of output 4 [2018-11-10 13:32:50,308 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:50,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:50,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-11-10 13:32:50,312 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 6 treesize of output 1 [2018-11-10 13:32:50,312 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:50,315 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:50,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 13:32:50,318 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 4 [2018-11-10 13:32:50,319 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:50,321 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:50,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:32:50,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:32:50,340 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:32, output treesize:17 [2018-11-10 13:32:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:32:50,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:32:50,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31, 29] total 78 [2018-11-10 13:32:50,759 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:32:50,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-10 13:32:50,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-10 13:32:50,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=5449, Unknown=16, NotChecked=298, Total=6006 [2018-11-10 13:32:50,762 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 55 states. [2018-11-10 13:33:25,290 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 13:33:29,343 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-10 13:33:37,789 WARN L179 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-11-10 13:33:41,874 WARN L179 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-11-10 13:33:44,002 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 32 [2018-11-10 13:34:06,891 WARN L179 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2018-11-10 13:35:34,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:34,317 INFO L93 Difference]: Finished difference Result 207 states and 236 transitions. [2018-11-10 13:35:34,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-10 13:35:34,318 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 69 [2018-11-10 13:35:34,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:34,320 INFO L225 Difference]: With dead ends: 207 [2018-11-10 13:35:34,320 INFO L226 Difference]: Without dead ends: 205 [2018-11-10 13:35:34,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 88 SyntacticMatches, 6 SemanticMatches, 111 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2285 ImplicationChecksByTransitivity, 114.7s TimeCoverageRelationStatistics Valid=701, Invalid=11477, Unknown=40, NotChecked=438, Total=12656 [2018-11-10 13:35:34,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-10 13:35:34,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 143. [2018-11-10 13:35:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-10 13:35:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 163 transitions. [2018-11-10 13:35:34,348 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 163 transitions. Word has length 69 [2018-11-10 13:35:34,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:34,348 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 163 transitions. [2018-11-10 13:35:34,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-10 13:35:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 163 transitions. [2018-11-10 13:35:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 13:35:34,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:34,350 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:34,350 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:34,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:34,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1309568088, now seen corresponding path program 2 times [2018-11-10 13:35:34,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:34,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:34,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:34,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:34,354 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 13:35:34,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:34,447 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:35:34,447 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:35:34,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:35:34,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:34,448 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:35:34,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:35:34,460 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:35:34,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 13:35:34,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:35:34,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:34,546 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 13:35:34,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:35:34,612 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 13:35:34,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:35:34,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 9 [2018-11-10 13:35:34,628 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:35:34,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:35:34,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:35:34,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:35:34,629 INFO L87 Difference]: Start difference. First operand 143 states and 163 transitions. Second operand 7 states. [2018-11-10 13:35:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:34,683 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2018-11-10 13:35:34,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:35:34,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-11-10 13:35:34,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:34,685 INFO L225 Difference]: With dead ends: 169 [2018-11-10 13:35:34,686 INFO L226 Difference]: Without dead ends: 140 [2018-11-10 13:35:34,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:35:34,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-10 13:35:34,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-11-10 13:35:34,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-10 13:35:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 157 transitions. [2018-11-10 13:35:34,705 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 157 transitions. Word has length 71 [2018-11-10 13:35:34,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:34,706 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 157 transitions. [2018-11-10 13:35:34,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:35:34,706 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 157 transitions. [2018-11-10 13:35:34,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 13:35:34,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:34,707 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:34,707 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:34,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:34,708 INFO L82 PathProgramCache]: Analyzing trace with hash -338917684, now seen corresponding path program 3 times [2018-11-10 13:35:34,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:34,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:34,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:35:34,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:34,709 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:35:34,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:34,767 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:35:34,767 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:35:34,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:35:34,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:34,767 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:35:34,788 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 13:35:34,789 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 13:35:34,828 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 13:35:34,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:35:34,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:34,841 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:35:34,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:35:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:35:34,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:35:34,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 8 [2018-11-10 13:35:34,911 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:35:34,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:35:34,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:35:34,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:35:34,912 INFO L87 Difference]: Start difference. First operand 140 states and 157 transitions. Second operand 7 states. [2018-11-10 13:35:34,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:34,966 INFO L93 Difference]: Finished difference Result 193 states and 215 transitions. [2018-11-10 13:35:34,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:35:34,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-11-10 13:35:34,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:34,967 INFO L225 Difference]: With dead ends: 193 [2018-11-10 13:35:34,968 INFO L226 Difference]: Without dead ends: 133 [2018-11-10 13:35:34,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 137 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:35:34,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-10 13:35:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2018-11-10 13:35:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-10 13:35:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2018-11-10 13:35:34,985 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 71 [2018-11-10 13:35:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:34,985 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2018-11-10 13:35:34,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:35:34,986 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2018-11-10 13:35:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-10 13:35:34,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:34,987 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:34,987 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:34,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:34,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1090626380, now seen corresponding path program 4 times [2018-11-10 13:35:34,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:34,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:34,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:35:34,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:34,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:35:35,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:35,058 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:35:35,058 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:35:35,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:35:35,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:35,058 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:35:35,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:35,073 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:35:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:35,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:35:35,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:35:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:35:35,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:35:35,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2018-11-10 13:35:35,290 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:35:35,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:35:35,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:35:35,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:35:35,291 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand 7 states. [2018-11-10 13:35:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:35,348 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2018-11-10 13:35:35,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:35:35,349 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-11-10 13:35:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:35,350 INFO L225 Difference]: With dead ends: 169 [2018-11-10 13:35:35,350 INFO L226 Difference]: Without dead ends: 123 [2018-11-10 13:35:35,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 138 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-10 13:35:35,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-10 13:35:35,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-11-10 13:35:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-10 13:35:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 130 transitions. [2018-11-10 13:35:35,369 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 130 transitions. Word has length 71 [2018-11-10 13:35:35,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:35,369 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 130 transitions. [2018-11-10 13:35:35,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:35:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 130 transitions. [2018-11-10 13:35:35,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 13:35:35,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:35,370 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:35,370 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:35,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:35,371 INFO L82 PathProgramCache]: Analyzing trace with hash 75432158, now seen corresponding path program 5 times [2018-11-10 13:35:35,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:35,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:35,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:35,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:35,372 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 13:35:35,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:35,421 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:35:35,421 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:35:35,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:35:35,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:35,421 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:35:35,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:35:35,431 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:35:35,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 13:35:35,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:35:35,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:35,483 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 13:35:35,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:35:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 13:35:35,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:35:35,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 8 [2018-11-10 13:35:35,555 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:35:35,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:35:35,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:35:35,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:35:35,555 INFO L87 Difference]: Start difference. First operand 123 states and 130 transitions. Second operand 6 states. [2018-11-10 13:35:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:35,585 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-11-10 13:35:35,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:35:35,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-11-10 13:35:35,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:35,587 INFO L225 Difference]: With dead ends: 139 [2018-11-10 13:35:35,587 INFO L226 Difference]: Without dead ends: 79 [2018-11-10 13:35:35,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 152 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:35:35,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-10 13:35:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-11-10 13:35:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-10 13:35:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2018-11-10 13:35:35,598 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 78 [2018-11-10 13:35:35,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:35,598 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2018-11-10 13:35:35,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:35:35,598 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2018-11-10 13:35:35,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 13:35:35,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:35,599 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:35,599 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:35,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:35,599 INFO L82 PathProgramCache]: Analyzing trace with hash 974885473, now seen corresponding path program 1 times [2018-11-10 13:35:35,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:35,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:35,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 13:35:35,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:35,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 13:35:35,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:35,927 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:35:35,927 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 82 with the following transitions: [2018-11-10 13:35:35,928 INFO L202 CegarAbsIntRunner]: [4], [5], [6], [10], [14], [16], [20], [21], [22], [24], [28], [32], [34], [36], [40], [41], [45], [47], [51], [54], [56], [59], [63], [67], [72], [74], [77], [79], [81], [87], [112], [116], [120], [122], [126], [127], [128], [134], [136], [137], [138], [139], [140], [141], [142], [143], [144], [146], [147], [148], [149], [150], [151] [2018-11-10 13:35:35,929 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:35:35,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:35:36,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:35:36,479 INFO L272 AbstractInterpreter]: Visited 53 different actions 266 times. Merged at 26 different actions 126 times. Widened at 2 different actions 2 times. Found 28 fixpoints after 7 different actions. Largest state had 42 variables. [2018-11-10 13:35:36,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:36,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:35:36,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:36,481 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/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-11-10 13:35:36,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:36,487 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:35:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:36,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:36,656 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 13 treesize of output 10 [2018-11-10 13:35:36,663 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 10 treesize of output 9 [2018-11-10 13:35:36,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:36,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:36,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:36,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:35:37,450 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 58 treesize of output 56 [2018-11-10 13:35:37,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-10 13:35:37,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:37,469 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:37,470 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 48 treesize of output 25 [2018-11-10 13:35:37,470 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:37,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:37,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:35:37,486 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:76, output treesize:31 [2018-11-10 13:35:37,670 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:35:37,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:35:38,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-10 13:35:38,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-10 13:35:38,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:38,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:38,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-11-10 13:35:38,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-10 13:35:38,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:38,206 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:38,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-11-10 13:35:38,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-10 13:35:38,210 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:38,216 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:38,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-10 13:35:38,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-10 13:35:38,261 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:38,265 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:38,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-11-10 13:35:38,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-10 13:35:38,267 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:38,271 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:38,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-11-10 13:35:38,302 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:77, output treesize:121 [2018-11-10 13:35:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 13:35:38,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:35:38,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 15] total 47 [2018-11-10 13:35:38,667 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:35:38,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-10 13:35:38,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-10 13:35:38,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2012, Unknown=0, NotChecked=0, Total=2162 [2018-11-10 13:35:38,668 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 36 states. [2018-11-10 13:35:39,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:39,682 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-11-10 13:35:39,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 13:35:39,683 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2018-11-10 13:35:39,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:39,684 INFO L225 Difference]: With dead ends: 96 [2018-11-10 13:35:39,684 INFO L226 Difference]: Without dead ends: 94 [2018-11-10 13:35:39,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=401, Invalid=3505, Unknown=0, NotChecked=0, Total=3906 [2018-11-10 13:35:39,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-10 13:35:39,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2018-11-10 13:35:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 13:35:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-11-10 13:35:39,706 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 81 [2018-11-10 13:35:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:39,707 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-11-10 13:35:39,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-10 13:35:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-10 13:35:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 13:35:39,708 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:39,708 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:39,708 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:39,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:39,708 INFO L82 PathProgramCache]: Analyzing trace with hash -425868825, now seen corresponding path program 2 times [2018-11-10 13:35:39,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:35:39,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:39,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:39,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:35:39,709 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:35:39,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 13:35:39,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:39,780 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:35:39,780 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 13:35:39,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 13:35:39,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:35:39,780 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:35:39,793 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 13:35:39,793 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 13:35:39,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-10 13:35:39,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 13:35:39,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 13:35:39,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:35:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 13:35:39,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 13:35:39,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 8 [2018-11-10 13:35:39,912 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:35:39,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:35:39,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:35:39,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:35:39,912 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 7 states. [2018-11-10 13:35:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:39,955 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2018-11-10 13:35:39,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:35:39,956 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-11-10 13:35:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:39,956 INFO L225 Difference]: With dead ends: 102 [2018-11-10 13:35:39,956 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 13:35:39,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 161 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:35:39,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 13:35:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 13:35:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 13:35:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:35:39,957 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2018-11-10 13:35:39,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:39,957 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:35:39,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:35:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:35:39,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 13:35:39,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 13:35:44,583 WARN L179 SmtUtils]: Spent 4.23 s on a formula simplification. DAG size of input: 144 DAG size of output: 57 [2018-11-10 13:35:44,797 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 50 [2018-11-10 13:35:45,018 WARN L179 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 74 [2018-11-10 13:35:45,323 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 57 [2018-11-10 13:35:45,533 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 64 [2018-11-10 13:35:45,720 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 79 [2018-11-10 13:35:45,892 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 71 [2018-11-10 13:35:56,389 WARN L179 SmtUtils]: Spent 10.50 s on a formula simplification. DAG size of input: 238 DAG size of output: 101 [2018-11-10 13:35:56,515 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 43 [2018-11-10 13:35:56,540 INFO L425 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-11-10 13:35:56,540 INFO L425 ceAbstractionStarter]: For program point exitEXIT(lines 560 562) no Hoare annotation was computed. [2018-11-10 13:35:56,540 INFO L428 ceAbstractionStarter]: At program point exitENTRY(lines 560 562) the Hoare annotation is: true [2018-11-10 13:35:56,541 INFO L425 ceAbstractionStarter]: For program point exitFINAL(lines 560 562) no Hoare annotation was computed. [2018-11-10 13:35:56,541 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:35:56,541 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-10 13:35:56,541 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:35:56,541 INFO L425 ceAbstractionStarter]: For program point sll_circular_get_data_atEXIT(lines 595 601) no Hoare annotation was computed. [2018-11-10 13:35:56,541 INFO L428 ceAbstractionStarter]: At program point sll_circular_get_data_atENTRY(lines 595 601) the Hoare annotation is: true [2018-11-10 13:35:56,541 INFO L425 ceAbstractionStarter]: For program point L596-1(lines 596 599) no Hoare annotation was computed. [2018-11-10 13:35:56,541 INFO L421 ceAbstractionStarter]: At program point L596-3(lines 596 599) the Hoare annotation is: (let ((.cse0 (forall ((v_main_~s~0.offset_BEFORE_CALL_7 Int) (v_main_~s~0.base_BEFORE_CALL_7 Int) (v_main_~len~0_BEFORE_CALL_21 Int)) (let ((.cse6 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_7) (+ v_main_~s~0.offset_BEFORE_CALL_7 4)))) (or (<= (+ .cse6 1) v_main_~len~0_BEFORE_CALL_21) (< (* 2 v_main_~len~0_BEFORE_CALL_21) (+ .cse6 2)) (< 2 v_main_~len~0_BEFORE_CALL_21)))))) (and (let ((.cse1 (<= sll_circular_get_data_at_~index 0)) (.cse2 (<= 1 |sll_circular_get_data_at_#in~index|))) (or (<= 2 |sll_circular_get_data_at_#in~index|) .cse0 (and (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (< sll_circular_get_data_at_~index 2) (or .cse1 .cse2)) (and .cse1 .cse2))) (let ((.cse4 (+ |sll_circular_get_data_at_#in~head.offset| 1)) (.cse5 (* 2 |sll_circular_get_data_at_#in~index|))) (or .cse0 (and (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base)) (forall ((v_main_~s~0.offset_BEFORE_CALL_3 Int) (v_main_~s~0.base_BEFORE_CALL_3 Int)) (let ((.cse3 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) v_main_~s~0.offset_BEFORE_CALL_3))) (or (= .cse3 v_main_~s~0.base_BEFORE_CALL_3) (not (= (select (select |#memory_int| .cse3) (+ (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) v_main_~s~0.offset_BEFORE_CALL_3) 4)) 3))))) (< .cse4 |sll_circular_get_data_at_#in~index|) (and (<= (+ sll_circular_get_data_at_~head.offset 1) sll_circular_get_data_at_~index) (<= 0 (* 2 sll_circular_get_data_at_~head.offset))) (< |sll_circular_get_data_at_#in~index| .cse4) (< .cse5 2) (< 2 .cse5))))) [2018-11-10 13:35:56,541 INFO L425 ceAbstractionStarter]: For program point L596-4(lines 596 599) no Hoare annotation was computed. [2018-11-10 13:35:56,541 INFO L425 ceAbstractionStarter]: For program point sll_circular_get_data_atFINAL(lines 595 601) no Hoare annotation was computed. [2018-11-10 13:35:56,541 INFO L421 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (let ((.cse0 (* 2 |sll_circular_create_#in~len|)) (.cse1 (* 2 |sll_circular_create_#in~data|))) (or (and (= (select |#valid| sll_circular_create_~last~0.base) 1) (= sll_circular_create_~last~0.base sll_circular_create_~head~0.base) (<= (+ sll_circular_create_~data sll_circular_create_~len) 3) (<= sll_circular_create_~len (+ sll_circular_create_~head~0.offset 2)) (<= 1 (+ sll_circular_create_~data sll_circular_create_~last~0.offset)) (not (= sll_circular_create_~head~0.base 0)) (<= (+ sll_circular_create_~len sll_circular_create_~last~0.offset) 2) (<= 4 (* 2 sll_circular_create_~len)) (<= (* 2 sll_circular_create_~head~0.offset) 0)) (< 4 .cse0) (< 2 .cse1) (< .cse0 4) (< .cse1 2))) [2018-11-10 13:35:56,541 INFO L425 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-11-10 13:35:56,541 INFO L425 ceAbstractionStarter]: For program point L575-1(lines 575 580) no Hoare annotation was computed. [2018-11-10 13:35:56,541 INFO L421 ceAbstractionStarter]: At program point L573(line 573) the Hoare annotation is: (let ((.cse0 (* 2 |sll_circular_create_#in~len|)) (.cse1 (* 2 |sll_circular_create_#in~data|))) (or (< 4 .cse0) (< 2 .cse1) (< .cse0 4) (< .cse1 2) (and (= sll_circular_create_~data 1) (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (<= 4 (* 2 sll_circular_create_~len)) (<= (+ sll_circular_create_~data sll_circular_create_~len) 3)))) [2018-11-10 13:35:56,541 INFO L425 ceAbstractionStarter]: For program point L573-1(line 573) no Hoare annotation was computed. [2018-11-10 13:35:56,541 INFO L421 ceAbstractionStarter]: At program point L575-3(lines 575 580) the Hoare annotation is: (let ((.cse4 (= sll_circular_create_~last~0.base sll_circular_create_~head~0.base)) (.cse0 (+ sll_circular_create_~data sll_circular_create_~len)) (.cse1 (<= 1 (+ sll_circular_create_~data sll_circular_create_~last~0.offset))) (.cse2 (+ sll_circular_create_~len sll_circular_create_~last~0.offset)) (.cse3 (<= (* 2 sll_circular_create_~head~0.offset) 0)) (.cse5 (* 2 |sll_circular_create_#in~len|))) (or (and (= sll_circular_create_~last~0.base (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (and (not (= sll_circular_create_~last~0.base 0)) (<= .cse0 2) (<= 1 (+ sll_circular_create_~head~0.offset sll_circular_create_~len)) .cse1 (<= .cse2 1) .cse3) (not .cse4) (= 0 (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset))) (and (= (select |#valid| sll_circular_create_~last~0.base) 1) .cse4 (<= .cse0 3) (<= sll_circular_create_~len (+ sll_circular_create_~head~0.offset 2)) .cse1 (not (= sll_circular_create_~head~0.base 0)) (<= .cse2 2) (<= 4 (* 2 sll_circular_create_~len)) .cse3) (not (= |sll_circular_create_#in~data| 1)) (< 4 .cse5) (< .cse5 4))) [2018-11-10 13:35:56,541 INFO L425 ceAbstractionStarter]: For program point L575-4(lines 575 580) no Hoare annotation was computed. [2018-11-10 13:35:56,542 INFO L421 ceAbstractionStarter]: At program point sll_circular_createENTRY(lines 572 583) the Hoare annotation is: (let ((.cse0 (* 2 |sll_circular_create_#in~len|)) (.cse1 (* 2 |sll_circular_create_#in~data|))) (or (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) (< 4 .cse0) (< 2 .cse1) (< .cse0 4) (< .cse1 2))) [2018-11-10 13:35:56,542 INFO L425 ceAbstractionStarter]: For program point sll_circular_createFINAL(lines 572 583) no Hoare annotation was computed. [2018-11-10 13:35:56,542 INFO L425 ceAbstractionStarter]: For program point sll_circular_createEXIT(lines 572 583) no Hoare annotation was computed. [2018-11-10 13:35:56,542 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:35:56,542 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 13:35:56,542 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:35:56,542 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:35:56,542 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 609 628) no Hoare annotation was computed. [2018-11-10 13:35:56,542 INFO L425 ceAbstractionStarter]: For program point L624(line 624) no Hoare annotation was computed. [2018-11-10 13:35:56,542 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 609 628) no Hoare annotation was computed. [2018-11-10 13:35:56,542 INFO L421 ceAbstractionStarter]: At program point L620(line 620) the Hoare annotation is: (let ((.cse0 (< main_~len~0 (+ main_~new_data~0 1))) (.cse3 (<= (* 2 main_~s~0.offset) 0)) (.cse4 (+ main_~new_data~0 2)) (.cse5 (* 2 main_~len~0))) (or (and .cse0 (exists ((main_~len~0 Int)) (let ((.cse1 (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 4))) (.cse2 (* 2 main_~len~0))) (and (< main_~len~0 (+ .cse1 1)) (<= main_~len~0 2) (< main_~len~0 (+ main_~expected~0 1)) (<= (+ .cse1 2) .cse2) (<= (+ main_~expected~0 2) .cse2)))) .cse3 (= main_~data~0 1) (<= main_~i~0 0) (<= main_~len~0 (+ main_~s~0.offset 2)) (<= .cse4 (+ main_~i~0 .cse5))) (let ((.cse7 (select |#memory_int| main_~s~0.base)) (.cse8 (+ main_~i~0 main_~len~0)) (.cse6 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (and (= 0 .cse6) .cse0 (<= (+ main_~len~0 main_~data~0) 3) (<= main_~len~0 (+ main_~data~0 1)) (<= (+ (select .cse7 (+ main_~s~0.offset 4)) 2) .cse5) .cse3 (<= (+ main_~i~0 main_~expected~0) 4) (<= .cse8 (+ (select .cse7 (+ 0 4)) 1)) (<= 2 (+ main_~s~0.offset main_~len~0)) (<= (+ main_~i~0 2) main_~expected~0) (<= .cse4 .cse5) (<= 3 .cse8) (= .cse5 (+ (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (+ .cse6 4)) 1)))))) [2018-11-10 13:35:56,542 INFO L425 ceAbstractionStarter]: For program point L620-1(line 620) no Hoare annotation was computed. [2018-11-10 13:35:56,542 INFO L425 ceAbstractionStarter]: For program point L620-2(lines 620 622) no Hoare annotation was computed. [2018-11-10 13:35:56,542 INFO L425 ceAbstractionStarter]: For program point L618-1(lines 618 623) no Hoare annotation was computed. [2018-11-10 13:35:56,542 INFO L421 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (let ((.cse7 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (.cse8 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (let ((.cse0 (= 0 .cse8)) (.cse5 (+ main_~new_data~0 1)) (.cse1 (<= (+ main_~len~0 main_~data~0) 3)) (.cse2 (not (= .cse7 main_~s~0.base))) (.cse3 (<= main_~len~0 (+ main_~data~0 1))) (.cse6 (<= 2 (+ main_~s~0.offset main_~len~0))) (.cse4 (* 2 main_~len~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~i~0 1) (<= .cse4 .cse5) (<= (+ main_~s~0.offset main_~new_data~0) 3) .cse6 (<= 3 (+ main_~i~0 main_~len~0))) (and .cse0 (< main_~len~0 .cse5) (<= (+ main_~new_data~0 2) (+ main_~i~0 .cse4)) .cse1 .cse2 .cse3 (<= (* 2 main_~s~0.offset) 0) (<= main_~i~0 0) .cse6 (= .cse4 (+ (select (select |#memory_int| .cse7) (+ .cse8 4)) 1)))))) [2018-11-10 13:35:56,542 INFO L425 ceAbstractionStarter]: For program point L616-1(lines 614 617) no Hoare annotation was computed. [2018-11-10 13:35:56,542 INFO L425 ceAbstractionStarter]: For program point L618-3(lines 618 623) no Hoare annotation was computed. [2018-11-10 13:35:56,543 INFO L421 ceAbstractionStarter]: At program point L618-4(lines 618 623) the Hoare annotation is: (let ((.cse9 (+ main_~new_data~0 2)) (.cse14 (select |#memory_int| main_~s~0.base)) (.cse6 (* 2 main_~len~0))) (let ((.cse5 (< main_~len~0 (+ main_~new_data~0 1))) (.cse8 (<= (+ (select .cse14 (+ main_~s~0.offset 4)) 2) .cse6)) (.cse10 (<= (* 2 main_~s~0.offset) 0)) (.cse11 (= main_~data~0 1)) (.cse7 (select .cse14 (+ 0 4))) (.cse3 (<= .cse9 .cse6)) (.cse12 (+ main_~i~0 main_~len~0))) (or (let ((.cse2 (<= (+ main_~i~0 2) main_~len~0)) (.cse4 (and (and .cse10 .cse11 (<= 1 .cse12) (<= (+ main_~i~0 1) main_~len~0) (<= 2 (+ main_~s~0.offset main_~len~0))) (= main_~len~0 2)))) (or (and (exists ((main_~len~0 Int)) (let ((.cse0 (select (select |#memory_int| main_~s~0.base) (+ main_~s~0.offset 4))) (.cse1 (* 2 main_~len~0))) (and (< main_~len~0 (+ .cse0 1)) (<= main_~len~0 2) (< main_~len~0 (+ main_~expected~0 1)) (<= (+ .cse0 2) .cse1) (<= (+ main_~expected~0 2) .cse1)))) .cse2 .cse3 .cse4 .cse5) (and .cse2 (<= .cse6 (+ .cse7 2)) .cse4 .cse5 .cse8 (<= .cse9 (+ main_~i~0 .cse6))))) (let ((.cse13 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (and (= 0 .cse13) .cse5 .cse8 .cse10 .cse11 (<= main_~len~0 (+ main_~s~0.offset 2)) (<= .cse12 (+ .cse7 1)) .cse3 (<= 3 .cse12) (= .cse6 (+ (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (+ .cse13 4)) 1))))))) [2018-11-10 13:35:56,543 INFO L425 ceAbstractionStarter]: For program point L614-1(lines 614 617) no Hoare annotation was computed. [2018-11-10 13:35:56,543 INFO L428 ceAbstractionStarter]: At program point L618-5(lines 618 623) the Hoare annotation is: true [2018-11-10 13:35:56,543 INFO L421 ceAbstractionStarter]: At program point L612(line 612) the Hoare annotation is: (let ((.cse0 (+ main_~data~0 1))) (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (<= .cse0 main_~len~0) (<= main_~len~0 .cse0) (= main_~len~0 2))) [2018-11-10 13:35:56,543 INFO L425 ceAbstractionStarter]: For program point L612-1(line 612) no Hoare annotation was computed. [2018-11-10 13:35:56,543 INFO L421 ceAbstractionStarter]: At program point L614-3(lines 614 617) the Hoare annotation is: (let ((.cse2 (* 2 main_~len~0)) (.cse11 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (.cse12 (select (select |#memory_$Pointer$.offset| main_~s~0.base) main_~s~0.offset))) (let ((.cse3 (+ main_~new_data~0 1)) (.cse4 (= .cse2 (+ (select (select |#memory_int| .cse11) (+ .cse12 4)) 1))) (.cse0 (= 0 .cse12)) (.cse1 (not (= .cse11 main_~s~0.base))) (.cse6 (<= (* 2 main_~s~0.offset) 0)) (.cse7 (= main_~data~0 1)) (.cse9 (<= (+ main_~i~0 1) main_~len~0)) (.cse10 (<= main_~len~0 (+ main_~s~0.offset 2))) (.cse8 (+ main_~i~0 main_~len~0))) (or (and .cse0 (<= (+ main_~len~0 main_~data~0) 3) .cse1 (<= main_~len~0 (+ main_~data~0 1)) (<= .cse2 .cse3) (<= (+ main_~s~0.offset main_~new_data~0) 3) (<= main_~i~0 0) (<= main_~len~0 (+ main_~i~0 2)) (<= 4 .cse2) (<= 2 (+ main_~s~0.offset main_~len~0)) .cse4) (let ((.cse5 (+ (select (select |#memory_int| main_~s~0.base) (+ 0 4)) 2))) (and .cse0 (< main_~len~0 .cse3) (<= .cse5 .cse2) (<= .cse2 .cse5) .cse6 .cse7 (<= 1 .cse8) .cse9 .cse10 (<= (+ main_~new_data~0 2) .cse2) .cse4)) (and .cse0 .cse1 .cse6 .cse7 .cse9 .cse10 (<= 3 .cse8))))) [2018-11-10 13:35:56,543 INFO L425 ceAbstractionStarter]: For program point L614-4(lines 614 617) no Hoare annotation was computed. [2018-11-10 13:35:56,543 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 609 628) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) [2018-11-10 13:35:56,543 INFO L421 ceAbstractionStarter]: At program point L621(lines 609 628) the Hoare annotation is: false [2018-11-10 13:35:56,543 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 626) no Hoare annotation was computed. [2018-11-10 13:35:56,543 INFO L428 ceAbstractionStarter]: At program point sll_circular_destroyENTRY(lines 584 594) the Hoare annotation is: true [2018-11-10 13:35:56,543 INFO L425 ceAbstractionStarter]: For program point sll_circular_destroyEXIT(lines 584 594) no Hoare annotation was computed. [2018-11-10 13:35:56,543 INFO L425 ceAbstractionStarter]: For program point L587-1(lines 587 591) no Hoare annotation was computed. [2018-11-10 13:35:56,543 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 593) no Hoare annotation was computed. [2018-11-10 13:35:56,543 INFO L428 ceAbstractionStarter]: At program point L587-3(lines 587 591) the Hoare annotation is: true [2018-11-10 13:35:56,543 INFO L425 ceAbstractionStarter]: For program point L587-4(lines 587 591) no Hoare annotation was computed. [2018-11-10 13:35:56,544 INFO L425 ceAbstractionStarter]: For program point L585-2(lines 584 594) no Hoare annotation was computed. [2018-11-10 13:35:56,544 INFO L425 ceAbstractionStarter]: For program point sll_circular_update_atEXIT(lines 602 608) no Hoare annotation was computed. [2018-11-10 13:35:56,544 INFO L421 ceAbstractionStarter]: At program point sll_circular_update_atENTRY(lines 602 608) the Hoare annotation is: (let ((.cse4 (+ |sll_circular_update_at_#in~head.offset| |sll_circular_update_at_#in~data|))) (let ((.cse5 (= |#memory_int| |old(#memory_int)|)) (.cse1 (< 3 .cse4)) (.cse2 (< (+ |sll_circular_update_at_#in~head.offset| |sll_circular_update_at_#in~index|) 0)) (.cse3 (< (+ |sll_circular_update_at_#in~head.offset| 1) |sll_circular_update_at_#in~index|))) (and (or (or (< 0 (* 2 |sll_circular_update_at_#in~head.offset|)) (forall ((v_main_~s~0.offset_BEFORE_CALL_3 Int) (v_main_~s~0.base_BEFORE_CALL_3 Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) v_main_~s~0.offset_BEFORE_CALL_3))) (or (= .cse0 v_main_~s~0.base_BEFORE_CALL_3) (not (= (select (select |old(#memory_int)| .cse0) (+ (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) v_main_~s~0.offset_BEFORE_CALL_3) 4)) 3))))) .cse1 .cse2 .cse3 (< .cse4 1)) .cse5) (or .cse5 (forall ((v_main_~s~0.base_BEFORE_CALL_2 Int) (v_main_~s~0.offset_BEFORE_CALL_2 Int)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_2) v_main_~s~0.base_BEFORE_CALL_2)) .cse1 (< (+ |sll_circular_update_at_#in~index| 2) |sll_circular_update_at_#in~data|) .cse2 (< |sll_circular_update_at_#in~data| (+ |sll_circular_update_at_#in~head.offset| 3)) .cse3)))) [2018-11-10 13:35:56,544 INFO L425 ceAbstractionStarter]: For program point sll_circular_update_atFINAL(lines 602 608) no Hoare annotation was computed. [2018-11-10 13:35:56,544 INFO L425 ceAbstractionStarter]: For program point L603-1(lines 603 606) no Hoare annotation was computed. [2018-11-10 13:35:56,544 INFO L421 ceAbstractionStarter]: At program point L603-3(lines 603 606) the Hoare annotation is: (let ((.cse2 (+ sll_circular_update_at_~head.offset 1))) (let ((.cse11 (+ |sll_circular_update_at_#in~head.offset| |sll_circular_update_at_#in~data|)) (.cse3 (<= sll_circular_update_at_~index .cse2)) (.cse0 (* 2 sll_circular_update_at_~head.offset))) (let ((.cse6 (let ((.cse14 (* 2 sll_circular_update_at_~data)) (.cse15 (* 2 sll_circular_update_at_~index))) (let ((.cse12 (<= 0 .cse15)) (.cse13 (<= .cse14 6))) (or (and .cse3 (<= 1 (+ sll_circular_update_at_~head.offset sll_circular_update_at_~data)) .cse12 (<= .cse0 0) .cse13) (and (<= 2 .cse14) (<= .cse15 0) .cse12 .cse13))))) (.cse1 (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base)) (.cse7 (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data)) (.cse4 (= |#memory_int| |old(#memory_int)|)) (.cse5 (< 3 .cse11)) (.cse8 (< (+ |sll_circular_update_at_#in~head.offset| |sll_circular_update_at_#in~index|) 0)) (.cse9 (< (+ |sll_circular_update_at_#in~head.offset| 1) |sll_circular_update_at_#in~index|))) (and (or (and (<= 0 .cse0) .cse1 (= sll_circular_update_at_~data 3) (<= (+ sll_circular_update_at_~head.offset 3) sll_circular_update_at_~data) (<= .cse2 sll_circular_update_at_~index) .cse3 .cse4) (forall ((v_main_~s~0.base_BEFORE_CALL_2 Int) (v_main_~s~0.offset_BEFORE_CALL_2 Int)) (= (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_2) v_main_~s~0.offset_BEFORE_CALL_2) v_main_~s~0.base_BEFORE_CALL_2)) .cse5 (< (+ |sll_circular_update_at_#in~index| 2) |sll_circular_update_at_#in~data|) (and .cse6 (= sll_circular_update_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (<= (+ sll_circular_update_at_~index 1) |sll_circular_update_at_#in~index|) .cse7 .cse4 (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base)) .cse8 (< |sll_circular_update_at_#in~data| (+ |sll_circular_update_at_#in~head.offset| 3)) .cse9) (or (and (<= 1 |sll_circular_update_at_#in~index|) (and .cse6 .cse4)) (and .cse6 (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) .cse1 (<= sll_circular_update_at_~index 0) .cse7 .cse4) (or (< 0 (* 2 |sll_circular_update_at_#in~head.offset|)) (forall ((v_main_~s~0.offset_BEFORE_CALL_3 Int) (v_main_~s~0.base_BEFORE_CALL_3 Int)) (let ((.cse10 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) v_main_~s~0.offset_BEFORE_CALL_3))) (or (= .cse10 v_main_~s~0.base_BEFORE_CALL_3) (not (= (select (select |old(#memory_int)| .cse10) (+ (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) v_main_~s~0.offset_BEFORE_CALL_3) 4)) 3))))) .cse5 .cse8 .cse9 (< .cse11 1))))))) [2018-11-10 13:35:56,544 INFO L425 ceAbstractionStarter]: For program point L603-4(lines 603 606) no Hoare annotation was computed. [2018-11-10 13:35:56,544 INFO L421 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|)) (not (= |node_create_#in~data| 1))) [2018-11-10 13:35:56,544 INFO L425 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-11-10 13:35:56,544 INFO L428 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-11-10 13:35:56,544 INFO L425 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-11-10 13:35:56,544 INFO L425 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-11-10 13:35:56,544 INFO L425 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-11-10 13:35:56,546 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,547 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,548 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,549 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,550 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,551 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,551 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,552 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,553 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,553 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,554 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,554 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,554 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,554 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,555 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,555 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,555 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,556 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,556 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,556 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,556 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,556 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,557 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,557 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,557 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,557 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,557 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,557 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,558 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,558 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,559 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,559 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,559 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,559 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,559 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,560 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,560 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,560 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,560 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,561 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,561 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,561 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,561 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,562 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,562 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,562 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,562 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,562 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,562 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,563 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,563 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,563 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,565 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,565 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,565 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,566 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,566 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,566 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,566 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,566 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,566 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,567 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,567 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,567 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,567 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,567 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,568 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,568 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,568 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,568 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,568 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,568 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,569 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,569 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,569 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,569 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,569 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,569 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,570 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,570 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,570 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,571 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,571 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,571 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,575 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,575 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,575 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,575 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,576 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,576 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,576 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,577 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,577 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,577 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,577 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,577 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,577 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,578 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,578 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,578 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,578 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,578 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,579 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,579 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,579 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,579 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,579 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,579 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,580 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,580 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,580 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,580 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,580 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,580 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,581 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,582 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,583 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,584 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,584 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:35:56,585 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:35:56,585 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:35:56,585 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,585 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,586 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,586 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,586 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,586 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,586 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,586 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,587 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,587 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,587 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,587 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,588 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,588 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,588 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,588 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,589 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,589 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,589 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,589 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,589 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,589 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,590 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,590 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,590 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,590 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,590 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,591 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,591 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:35:56,591 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:35:56,591 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:35:56,592 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,592 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,592 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,592 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,593 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,593 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,593 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,593 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,593 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,593 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,594 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,594 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,595 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,595 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,595 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,595 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,595 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,595 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,596 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,596 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,596 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,596 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,596 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,596 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,596 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,597 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,597 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,598 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,598 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,598 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,598 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,598 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,599 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,599 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,599 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,599 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,600 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,600 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,600 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,600 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,600 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,600 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,601 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,601 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,601 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,601 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,601 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,602 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,602 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,602 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,602 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,602 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,602 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,603 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,603 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,603 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,603 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,603 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,604 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,604 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,604 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,604 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,604 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:35:56 BoogieIcfgContainer [2018-11-10 13:35:56,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:35:56,606 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:35:56,606 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:35:56,606 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:35:56,607 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:31:51" (3/4) ... [2018-11-10 13:35:56,610 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 13:35:56,613 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exit [2018-11-10 13:35:56,613 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 13:35:56,614 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_get_data_at [2018-11-10 13:35:56,614 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_create [2018-11-10 13:35:56,614 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 13:35:56,614 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_destroy [2018-11-10 13:35:56,614 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure sll_circular_update_at [2018-11-10 13:35:56,614 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2018-11-10 13:35:56,617 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 48 nodes and edges [2018-11-10 13:35:56,618 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2018-11-10 13:35:56,618 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 13:35:56,638 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((last == #memory_$Pointer$[head][head] && ((((!(last == 0) && data + len <= 2) && 1 <= head + len) && 1 <= data + last) && len + last <= 1) && 2 * head <= 0) && !(last == head)) && 0 == #memory_$Pointer$[head][head]) || ((((((((\valid[last] == 1 && last == head) && data + len <= 3) && len <= head + 2) && 1 <= data + last) && !(head == 0)) && len + last <= 2) && 4 <= 2 * len) && 2 * head <= 0)) || !(\old(data) == 1)) || 4 < 2 * \old(len)) || 2 * \old(len) < 4 [2018-11-10 13:35:56,638 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\exists main_~len~0 : int :: (((main_~len~0 < unknown-#memory_int-unknown[s][s + 4] + 1 && main_~len~0 <= 2) && main_~len~0 < expected + 1) && unknown-#memory_int-unknown[s][s + 4] + 2 <= 2 * main_~len~0) && expected + 2 <= 2 * main_~len~0) && i + 2 <= len) && new_data + 2 <= 2 * len) && ((((2 * s <= 0 && data == 1) && 1 <= i + len) && i + 1 <= len) && 2 <= s + len) && len == 2) && len < new_data + 1) || (((((i + 2 <= len && 2 * len <= unknown-#memory_int-unknown[s][0 + 4] + 2) && ((((2 * s <= 0 && data == 1) && 1 <= i + len) && i + 1 <= len) && 2 <= s + len) && len == 2) && len < new_data + 1) && unknown-#memory_int-unknown[s][s + 4] + 2 <= 2 * len) && new_data + 2 <= i + 2 * len)) || (((((((((0 == #memory_$Pointer$[s][s] && len < new_data + 1) && unknown-#memory_int-unknown[s][s + 4] + 2 <= 2 * len) && 2 * s <= 0) && data == 1) && len <= s + 2) && i + len <= unknown-#memory_int-unknown[s][0 + 4] + 1) && new_data + 2 <= 2 * len) && 3 <= i + len) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] + 1) [2018-11-10 13:35:56,638 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((0 <= 2 * head && head == head) && data == 3) && head + 3 <= data) && head + 1 <= index) && index <= head + 1) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) || (forall v_main_~s~0.base_BEFORE_CALL_2 : int, v_main_~s~0.offset_BEFORE_CALL_2 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][v_main_~s~0.offset_BEFORE_CALL_2] == v_main_~s~0.base_BEFORE_CALL_2)) || 3 < head + \old(data)) || \old(index) + 2 < \old(data)) || ((((((((((index <= head + 1 && 1 <= head + data) && 0 <= 2 * index) && 2 * head <= 0) && 2 * data <= 6) || (((2 <= 2 * data && 2 * index <= 0) && 0 <= 2 * index) && 2 * data <= 6)) && head == #memory_$Pointer$[head][head]) && index + 1 <= \old(index)) && \old(data) == data) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$[head][head] == head)) || head + \old(index) < 0) || \old(data) < head + 3) || head + 1 < \old(index)) && (((1 <= \old(index) && (((((index <= head + 1 && 1 <= head + data) && 0 <= 2 * index) && 2 * head <= 0) && 2 * data <= 6) || (((2 <= 2 * data && 2 * index <= 0) && 0 <= 2 * index) && 2 * data <= 6)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) || ((((((((((index <= head + 1 && 1 <= head + data) && 0 <= 2 * index) && 2 * head <= 0) && 2 * data <= 6) || (((2 <= 2 * data && 2 * index <= 0) && 0 <= 2 * index) && 2 * data <= 6)) && head == head) && head == head) && index <= 0) && \old(data) == data) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown))) || ((((0 < 2 * head || (forall v_main_~s~0.offset_BEFORE_CALL_3 : int, v_main_~s~0.base_BEFORE_CALL_3 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3] == v_main_~s~0.base_BEFORE_CALL_3 || !(\old(unknown-#memory_int-unknown)[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3] + 4] == 3))) || 3 < head + \old(data)) || head + \old(index) < 0) || head + 1 < \old(index)) || head + \old(data) < 1) [2018-11-10 13:35:56,638 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((2 <= \old(index) || (forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~s~0.base_BEFORE_CALL_7 : int, v_main_~len~0_BEFORE_CALL_21 : int :: (unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4] + 1 <= v_main_~len~0_BEFORE_CALL_21 || 2 * v_main_~len~0_BEFORE_CALL_21 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4] + 2) || 2 < v_main_~len~0_BEFORE_CALL_21)) || (((head == head && head == head) && index < 2) && (index <= 0 || 1 <= \old(index)))) || (index <= 0 && 1 <= \old(index))) && ((((((((forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~s~0.base_BEFORE_CALL_7 : int, v_main_~len~0_BEFORE_CALL_21 : int :: (unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4] + 1 <= v_main_~len~0_BEFORE_CALL_21 || 2 * v_main_~len~0_BEFORE_CALL_21 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4] + 2) || 2 < v_main_~len~0_BEFORE_CALL_21) || (head == #memory_$Pointer$[head][head] && #memory_$Pointer$[head][head] == head)) || (forall v_main_~s~0.offset_BEFORE_CALL_3 : int, v_main_~s~0.base_BEFORE_CALL_3 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3] == v_main_~s~0.base_BEFORE_CALL_3 || !(unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3] + 4] == 3))) || head + 1 < \old(index)) || (head + 1 <= index && 0 <= 2 * head)) || \old(index) < head + 1) || 2 * \old(index) < 2) || 2 < 2 * \old(index)) [2018-11-10 13:35:56,657 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6ee1b56e-edd4-494e-a107-f95f5c8a06f5/bin-2019/utaipan/witness.graphml [2018-11-10 13:35:56,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:35:56,657 INFO L168 Benchmark]: Toolchain (without parser) took 245878.65 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 493.9 MB). Free memory was 946.8 MB in the beginning and 811.5 MB in the end (delta: 135.3 MB). Peak memory consumption was 629.2 MB. Max. memory is 11.5 GB. [2018-11-10 13:35:56,658 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 974.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:35:56,658 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.22 ms. Allocated memory is still 1.0 GB. Free memory was 946.8 MB in the beginning and 922.6 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-11-10 13:35:56,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 922.6 MB in the beginning and 1.1 GB in the end (delta: -220.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:35:56,659 INFO L168 Benchmark]: Boogie Preprocessor took 20.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:35:56,659 INFO L168 Benchmark]: RCFGBuilder took 342.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:35:56,659 INFO L168 Benchmark]: TraceAbstraction took 245097.53 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 345.0 MB). Free memory was 1.1 GB in the beginning and 824.7 MB in the end (delta: 280.1 MB). Peak memory consumption was 664.1 MB. Max. memory is 11.5 GB. [2018-11-10 13:35:56,659 INFO L168 Benchmark]: Witness Printer took 50.60 ms. Allocated memory is still 1.5 GB. Free memory was 824.7 MB in the beginning and 811.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-10 13:35:56,661 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 974.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 292.22 ms. Allocated memory is still 1.0 GB. Free memory was 946.8 MB in the beginning and 922.6 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 922.6 MB in the beginning and 1.1 GB in the end (delta: -220.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 342.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 245097.53 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 345.0 MB). Free memory was 1.1 GB in the beginning and 824.7 MB in the end (delta: 280.1 MB). Peak memory consumption was 664.1 MB. Max. memory is 11.5 GB. * Witness Printer took 50.60 ms. Allocated memory is still 1.5 GB. Free memory was 824.7 MB in the beginning and 811.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 626]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 575]: Loop Invariant [2018-11-10 13:35:56,666 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,666 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,667 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,667 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,667 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,667 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,668 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,668 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((last == #memory_$Pointer$[head][head] && ((((!(last == 0) && data + len <= 2) && 1 <= head + len) && 1 <= data + last) && len + last <= 1) && 2 * head <= 0) && !(last == head)) && 0 == #memory_$Pointer$[head][head]) || ((((((((\valid[last] == 1 && last == head) && data + len <= 3) && len <= head + 2) && 1 <= data + last) && !(head == 0)) && len + last <= 2) && 4 <= 2 * len) && 2 * head <= 0)) || !(\old(data) == 1)) || 4 < 2 * \old(len)) || 2 * \old(len) < 4 - InvariantResult [Line: 587]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 614]: Loop Invariant [2018-11-10 13:35:56,668 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,668 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,668 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,669 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,669 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,669 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,669 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,669 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,669 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,670 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,670 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,670 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,670 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,670 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,670 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,670 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,671 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,671 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,671 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,671 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,671 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,671 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,671 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,672 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,672 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,672 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,672 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,672 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,672 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,673 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,673 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,673 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,673 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,673 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,674 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,674 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,674 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,674 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,674 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,674 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,674 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,675 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,675 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,675 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((0 == #memory_$Pointer$[s][s] && len + data <= 3) && !(#memory_$Pointer$[s][s] == s)) && len <= data + 1) && 2 * len <= new_data + 1) && s + new_data <= 3) && i <= 0) && len <= i + 2) && 4 <= 2 * len) && 2 <= s + len) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] + 1) || ((((((((((0 == #memory_$Pointer$[s][s] && len < new_data + 1) && unknown-#memory_int-unknown[s][0 + 4] + 2 <= 2 * len) && 2 * len <= unknown-#memory_int-unknown[s][0 + 4] + 2) && 2 * s <= 0) && data == 1) && 1 <= i + len) && i + 1 <= len) && len <= s + 2) && new_data + 2 <= 2 * len) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] + 1)) || ((((((0 == #memory_$Pointer$[s][s] && !(#memory_$Pointer$[s][s] == s)) && 2 * s <= 0) && data == 1) && i + 1 <= len) && len <= s + 2) && 3 <= i + len) - InvariantResult [Line: 609]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 596]: Loop Invariant [2018-11-10 13:35:56,675 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,675 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,676 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,676 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,676 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,676 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,676 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,676 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,676 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,677 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,677 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,677 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,677 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,677 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,677 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,677 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,677 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,678 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,678 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,678 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,678 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,678 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,678 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,678 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,679 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,679 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,679 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,679 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,679 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,679 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,680 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,680 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,680 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,680 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,680 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,680 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,681 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,682 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,691 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,691 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,691 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,691 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,691 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_7,QUANTIFIED] [2018-11-10 13:35:56,692 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~len~0_BEFORE_CALL_21,QUANTIFIED] [2018-11-10 13:35:56,692 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,692 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,692 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,692 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,692 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,692 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,693 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,693 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,693 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,693 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,693 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,693 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,693 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,693 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,694 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,694 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,694 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,694 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,694 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,694 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,694 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((2 <= \old(index) || (forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~s~0.base_BEFORE_CALL_7 : int, v_main_~len~0_BEFORE_CALL_21 : int :: (unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4] + 1 <= v_main_~len~0_BEFORE_CALL_21 || 2 * v_main_~len~0_BEFORE_CALL_21 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4] + 2) || 2 < v_main_~len~0_BEFORE_CALL_21)) || (((head == head && head == head) && index < 2) && (index <= 0 || 1 <= \old(index)))) || (index <= 0 && 1 <= \old(index))) && ((((((((forall v_main_~s~0.offset_BEFORE_CALL_7 : int, v_main_~s~0.base_BEFORE_CALL_7 : int, v_main_~len~0_BEFORE_CALL_21 : int :: (unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4] + 1 <= v_main_~len~0_BEFORE_CALL_21 || 2 * v_main_~len~0_BEFORE_CALL_21 < unknown-#memory_int-unknown[v_main_~s~0.base_BEFORE_CALL_7][v_main_~s~0.offset_BEFORE_CALL_7 + 4] + 2) || 2 < v_main_~len~0_BEFORE_CALL_21) || (head == #memory_$Pointer$[head][head] && #memory_$Pointer$[head][head] == head)) || (forall v_main_~s~0.offset_BEFORE_CALL_3 : int, v_main_~s~0.base_BEFORE_CALL_3 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3] == v_main_~s~0.base_BEFORE_CALL_3 || !(unknown-#memory_int-unknown[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3] + 4] == 3))) || head + 1 < \old(index)) || (head + 1 <= index && 0 <= 2 * head)) || \old(index) < head + 1) || 2 * \old(index) < 2) || 2 < 2 * \old(index)) - InvariantResult [Line: 603]: Loop Invariant [2018-11-10 13:35:56,695 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,695 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:35:56,695 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:35:56,696 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:35:56,696 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,696 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,696 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,696 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,696 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,697 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,697 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,697 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,697 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,697 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,697 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,697 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,698 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,698 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,698 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,699 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,699 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,699 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,699 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,699 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,699 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,699 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,700 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,700 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,700 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,700 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,700 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,701 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,701 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:35:56,701 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:35:56,701 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_2,QUANTIFIED] [2018-11-10 13:35:56,701 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,701 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,702 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,702 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,702 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,702 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,702 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,702 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,703 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,703 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,703 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.base_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,703 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0.offset_BEFORE_CALL_3,QUANTIFIED] [2018-11-10 13:35:56,704 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,704 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,704 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,704 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,704 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,704 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,704 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,705 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,705 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,705 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,705 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,705 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,705 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,705 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,705 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((((0 <= 2 * head && head == head) && data == 3) && head + 3 <= data) && head + 1 <= index) && index <= head + 1) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) || (forall v_main_~s~0.base_BEFORE_CALL_2 : int, v_main_~s~0.offset_BEFORE_CALL_2 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_2][v_main_~s~0.offset_BEFORE_CALL_2] == v_main_~s~0.base_BEFORE_CALL_2)) || 3 < head + \old(data)) || \old(index) + 2 < \old(data)) || ((((((((((index <= head + 1 && 1 <= head + data) && 0 <= 2 * index) && 2 * head <= 0) && 2 * data <= 6) || (((2 <= 2 * data && 2 * index <= 0) && 0 <= 2 * index) && 2 * data <= 6)) && head == #memory_$Pointer$[head][head]) && index + 1 <= \old(index)) && \old(data) == data) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && #memory_$Pointer$[head][head] == head)) || head + \old(index) < 0) || \old(data) < head + 3) || head + 1 < \old(index)) && (((1 <= \old(index) && (((((index <= head + 1 && 1 <= head + data) && 0 <= 2 * index) && 2 * head <= 0) && 2 * data <= 6) || (((2 <= 2 * data && 2 * index <= 0) && 0 <= 2 * index) && 2 * data <= 6)) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) || ((((((((((index <= head + 1 && 1 <= head + data) && 0 <= 2 * index) && 2 * head <= 0) && 2 * data <= 6) || (((2 <= 2 * data && 2 * index <= 0) && 0 <= 2 * index) && 2 * data <= 6)) && head == head) && head == head) && index <= 0) && \old(data) == data) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown))) || ((((0 < 2 * head || (forall v_main_~s~0.offset_BEFORE_CALL_3 : int, v_main_~s~0.base_BEFORE_CALL_3 : int :: #memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3] == v_main_~s~0.base_BEFORE_CALL_3 || !(\old(unknown-#memory_int-unknown)[#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3]][#memory_$Pointer$[v_main_~s~0.base_BEFORE_CALL_3][v_main_~s~0.offset_BEFORE_CALL_3] + 4] == 3))) || 3 < head + \old(data)) || head + \old(index) < 0) || head + 1 < \old(index)) || head + \old(data) < 1) - InvariantResult [Line: 618]: Loop Invariant [2018-11-10 13:35:56,706 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,706 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,706 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,706 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,707 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,710 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,710 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,710 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,711 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,711 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,711 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,711 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,711 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,712 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,712 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,712 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,712 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,712 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,712 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,713 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~len~0,QUANTIFIED] [2018-11-10 13:35:56,713 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,713 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-11-10 13:35:56,713 WARN L387 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-11-10 13:35:56,714 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,714 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,714 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,714 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,714 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,715 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,715 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,719 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:35:56,719 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-11-10 13:35:56,719 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((\exists main_~len~0 : int :: (((main_~len~0 < unknown-#memory_int-unknown[s][s + 4] + 1 && main_~len~0 <= 2) && main_~len~0 < expected + 1) && unknown-#memory_int-unknown[s][s + 4] + 2 <= 2 * main_~len~0) && expected + 2 <= 2 * main_~len~0) && i + 2 <= len) && new_data + 2 <= 2 * len) && ((((2 * s <= 0 && data == 1) && 1 <= i + len) && i + 1 <= len) && 2 <= s + len) && len == 2) && len < new_data + 1) || (((((i + 2 <= len && 2 * len <= unknown-#memory_int-unknown[s][0 + 4] + 2) && ((((2 * s <= 0 && data == 1) && 1 <= i + len) && i + 1 <= len) && 2 <= s + len) && len == 2) && len < new_data + 1) && unknown-#memory_int-unknown[s][s + 4] + 2 <= 2 * len) && new_data + 2 <= i + 2 * len)) || (((((((((0 == #memory_$Pointer$[s][s] && len < new_data + 1) && unknown-#memory_int-unknown[s][s + 4] + 2 <= 2 * len) && 2 * s <= 0) && data == 1) && len <= s + 2) && i + len <= unknown-#memory_int-unknown[s][0 + 4] + 1) && new_data + 2 <= 2 * len) && 3 <= i + len) && 2 * len == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 66 locations, 1 error locations. SAFE Result, 244.9s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 168.7s AutomataDifference, 0.0s DeadEndRemovalTime, 16.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 581 SDtfs, 677 SDslu, 3766 SDs, 0 SdLazy, 3071 SolverSat, 374 SolverUnsat, 49 SolverUnknown, 0 SolverNotchecked, 100.6s Time, PredicateUnifierStatistics: 4 DeclaredPredicates, 1345 GetRequests, 1022 SyntacticMatches, 33 SemanticMatches, 290 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3446 ImplicationChecksByTransitivity, 119.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 4 AbstIntIterations, 2 AbstIntStrong, 0.9399618927205132 AbsIntWeakeningRatio, 2.4363636363636365 AbsIntAvgWeakeningVarsNumRemoved, 134.3181818181818 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 99 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 74 PreInvPairs, 107 NumberOfFragments, 1660 HoareAnnotationTreeSize, 74 FomulaSimplifications, 2607 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 24 FomulaSimplificationsInter, 9009 FormulaSimplificationTreeSizeReductionInter, 16.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 55.3s InterpolantComputationTime, 1275 NumberOfCodeBlocks, 1237 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1773 ConstructedInterpolants, 65 QuantifiedInterpolants, 754557 SizeOfPredicates, 89 NumberOfNonLiveVariables, 3013 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 619/781 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...