./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78f95c70d702e3726c098ef8eec3c10bcd690c4e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 19:09:38,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 19:09:38,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 19:09:38,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 19:09:38,685 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 19:09:38,687 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 19:09:38,688 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 19:09:38,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 19:09:38,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 19:09:38,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 19:09:38,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 19:09:38,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 19:09:38,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 19:09:38,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 19:09:38,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 19:09:38,699 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 19:09:38,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 19:09:38,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 19:09:38,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 19:09:38,704 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 19:09:38,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 19:09:38,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 19:09:38,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 19:09:38,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 19:09:38,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 19:09:38,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 19:09:38,711 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 19:09:38,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 19:09:38,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 19:09:38,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 19:09:38,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 19:09:38,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 19:09:38,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 19:09:38,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 19:09:38,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 19:09:38,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 19:09:38,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 19:09:38,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 19:09:38,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 19:09:38,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 19:09:38,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 19:09:38,719 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 19:09:38,741 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 19:09:38,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 19:09:38,742 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 19:09:38,742 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 19:09:38,742 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 19:09:38,742 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 19:09:38,742 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 19:09:38,743 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 19:09:38,743 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 19:09:38,743 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 19:09:38,743 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 19:09:38,743 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 19:09:38,743 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 19:09:38,744 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 19:09:38,744 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 19:09:38,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 19:09:38,745 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 19:09:38,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 19:09:38,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 19:09:38,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 19:09:38,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 19:09:38,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 19:09:38,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 19:09:38,746 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 19:09:38,746 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 19:09:38,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 19:09:38,746 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 19:09:38,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 19:09:38,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 19:09:38,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 19:09:38,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 19:09:38,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 19:09:38,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 19:09:38,748 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 19:09:38,748 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 19:09:38,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 19:09:38,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 19:09:38,748 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 19:09:38,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 19:09:38,749 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/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(reach_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 -> 78f95c70d702e3726c098ef8eec3c10bcd690c4e [2020-12-09 19:09:38,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 19:09:38,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 19:09:38,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 19:09:38,951 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 19:09:38,952 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 19:09:38,953 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/../../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2020-12-09 19:09:38,996 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/data/8aa70263c/d5889b8160684eff8573e8954a99a2f4/FLAG414641b13 [2020-12-09 19:09:39,359 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 19:09:39,360 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2020-12-09 19:09:39,365 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/data/8aa70263c/d5889b8160684eff8573e8954a99a2f4/FLAG414641b13 [2020-12-09 19:09:39,375 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/data/8aa70263c/d5889b8160684eff8573e8954a99a2f4 [2020-12-09 19:09:39,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 19:09:39,378 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 19:09:39,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 19:09:39,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 19:09:39,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 19:09:39,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:09:39" (1/1) ... [2020-12-09 19:09:39,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28400d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:39, skipping insertion in model container [2020-12-09 19:09:39,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:09:39" (1/1) ... [2020-12-09 19:09:39,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 19:09:39,401 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 19:09:39,497 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2020-12-09 19:09:39,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:09:39,538 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 19:09:39,546 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2020-12-09 19:09:39,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:09:39,564 INFO L208 MainTranslator]: Completed translation [2020-12-09 19:09:39,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:39 WrapperNode [2020-12-09 19:09:39,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 19:09:39,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 19:09:39,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 19:09:39,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 19:09:39,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:39" (1/1) ... [2020-12-09 19:09:39,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:39" (1/1) ... [2020-12-09 19:09:39,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 19:09:39,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 19:09:39,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 19:09:39,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 19:09:39,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:39" (1/1) ... [2020-12-09 19:09:39,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:39" (1/1) ... [2020-12-09 19:09:39,616 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:39" (1/1) ... [2020-12-09 19:09:39,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:39" (1/1) ... [2020-12-09 19:09:39,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:39" (1/1) ... [2020-12-09 19:09:39,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:39" (1/1) ... [2020-12-09 19:09:39,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:39" (1/1) ... [2020-12-09 19:09:39,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 19:09:39,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 19:09:39,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 19:09:39,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 19:09:39,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/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 [2020-12-09 19:09:39,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-09 19:09:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-09 19:09:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 19:09:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-09 19:09:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 19:09:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 19:09:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 19:09:39,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 19:09:39,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-09 19:09:40,051 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 19:09:40,051 INFO L299 CfgBuilder]: Removed 27 assume(true) statements. [2020-12-09 19:09:40,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:09:40 BoogieIcfgContainer [2020-12-09 19:09:40,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 19:09:40,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 19:09:40,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 19:09:40,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 19:09:40,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:09:39" (1/3) ... [2020-12-09 19:09:40,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285de9fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:09:40, skipping insertion in model container [2020-12-09 19:09:40,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:39" (2/3) ... [2020-12-09 19:09:40,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285de9fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:09:40, skipping insertion in model container [2020-12-09 19:09:40,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:09:40" (3/3) ... [2020-12-09 19:09:40,059 INFO L111 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2020-12-09 19:09:40,069 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 19:09:40,072 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 19:09:40,083 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-09 19:09:40,103 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 19:09:40,103 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 19:09:40,103 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 19:09:40,103 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 19:09:40,103 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 19:09:40,104 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 19:09:40,104 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 19:09:40,104 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 19:09:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2020-12-09 19:09:40,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 19:09:40,116 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:09:40,116 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:09:40,117 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:09:40,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:09:40,121 INFO L82 PathProgramCache]: Analyzing trace with hash 642486663, now seen corresponding path program 1 times [2020-12-09 19:09:40,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:09:40,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744581607] [2020-12-09 19:09:40,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:09:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:09:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:09:40,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744581607] [2020-12-09 19:09:40,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:09:40,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:09:40,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487481036] [2020-12-09 19:09:40,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:09:40,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:09:40,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:09:40,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:09:40,264 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2020-12-09 19:09:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:09:40,284 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. [2020-12-09 19:09:40,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:09:40,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-09 19:09:40,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:09:40,291 INFO L225 Difference]: With dead ends: 49 [2020-12-09 19:09:40,291 INFO L226 Difference]: Without dead ends: 24 [2020-12-09 19:09:40,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:09:40,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-12-09 19:09:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-12-09 19:09:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-12-09 19:09:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2020-12-09 19:09:40,320 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 11 [2020-12-09 19:09:40,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:09:40,320 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2020-12-09 19:09:40,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:09:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2020-12-09 19:09:40,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 19:09:40,320 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:09:40,320 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:09:40,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 19:09:40,321 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:09:40,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:09:40,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1662249715, now seen corresponding path program 1 times [2020-12-09 19:09:40,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:09:40,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637260818] [2020-12-09 19:09:40,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:09:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:09:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:09:40,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637260818] [2020-12-09 19:09:40,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497674347] [2020-12-09 19:09:40,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:09:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:09:40,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 19:09:40,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:09:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:09:40,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:09:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:09:40,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 19:09:40,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 6 [2020-12-09 19:09:40,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143118698] [2020-12-09 19:09:40,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:09:40,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:09:40,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:09:40,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:09:40,469 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand 4 states. [2020-12-09 19:09:40,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:09:40,512 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2020-12-09 19:09:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:09:40,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-09 19:09:40,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:09:40,514 INFO L225 Difference]: With dead ends: 80 [2020-12-09 19:09:40,514 INFO L226 Difference]: Without dead ends: 62 [2020-12-09 19:09:40,514 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:09:40,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-12-09 19:09:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 30. [2020-12-09 19:09:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-12-09 19:09:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2020-12-09 19:09:40,520 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 12 [2020-12-09 19:09:40,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:09:40,520 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-12-09 19:09:40,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:09:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-12-09 19:09:40,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 19:09:40,521 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:09:40,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:09:40,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-09 19:09:40,722 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:09:40,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:09:40,724 INFO L82 PathProgramCache]: Analyzing trace with hash 2144689132, now seen corresponding path program 1 times [2020-12-09 19:09:40,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:09:40,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411341080] [2020-12-09 19:09:40,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:09:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:09:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:09:40,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411341080] [2020-12-09 19:09:40,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895212798] [2020-12-09 19:09:40,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:09:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:09:40,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 19:09:40,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:09:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:09:40,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:09:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:09:40,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [933296659] [2020-12-09 19:09:40,902 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2020-12-09 19:09:40,902 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:09:40,906 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:09:40,909 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:09:40,910 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:09:41,942 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:09:42,072 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:09:42,084 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:09:42,158 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 19:09:42,410 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2020-12-09 19:09:42,564 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2020-12-09 19:09:42,725 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2020-12-09 19:09:42,879 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2020-12-09 19:09:43,049 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2020-12-09 19:09:43,174 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2020-12-09 19:09:43,324 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2020-12-09 19:09:43,511 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2020-12-09 19:09:43,706 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2020-12-09 19:09:43,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 19:09:43,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [3, 3, 3] total 14 [2020-12-09 19:09:43,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108733563] [2020-12-09 19:09:43,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 19:09:43,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:09:43,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 19:09:43,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-12-09 19:09:43,708 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 13 states. [2020-12-09 19:09:43,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:09:43,935 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2020-12-09 19:09:43,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-09 19:09:43,936 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2020-12-09 19:09:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:09:43,937 INFO L225 Difference]: With dead ends: 62 [2020-12-09 19:09:43,937 INFO L226 Difference]: Without dead ends: 53 [2020-12-09 19:09:43,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-12-09 19:09:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-09 19:09:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 37. [2020-12-09 19:09:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-09 19:09:43,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2020-12-09 19:09:43,944 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 14 [2020-12-09 19:09:43,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:09:43,944 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2020-12-09 19:09:43,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 19:09:43,944 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2020-12-09 19:09:43,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-09 19:09:43,945 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:09:43,945 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:09:44,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:09:44,147 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:09:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:09:44,148 INFO L82 PathProgramCache]: Analyzing trace with hash 491983072, now seen corresponding path program 1 times [2020-12-09 19:09:44,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:09:44,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461513566] [2020-12-09 19:09:44,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:09:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:09:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 19:09:44,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461513566] [2020-12-09 19:09:44,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841886052] [2020-12-09 19:09:44,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:09:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:09:44,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 19:09:44,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:09:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 19:09:44,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:09:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 19:09:44,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1656699323] [2020-12-09 19:09:44,267 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2020-12-09 19:09:44,267 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:09:44,268 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:09:44,268 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:09:44,268 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:09:44,992 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:09:45,230 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 19:09:45,631 WARN L197 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 123 [2020-12-09 19:09:45,974 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2020-12-09 19:09:46,129 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2020-12-09 19:09:46,255 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-09 19:09:46,396 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-12-09 19:09:46,689 WARN L197 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 101 [2020-12-09 19:09:47,027 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 111 [2020-12-09 19:09:47,404 WARN L197 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 119 [2020-12-09 19:09:47,840 WARN L197 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 121 [2020-12-09 19:09:47,841 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 19:09:47,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 19:09:47,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2020-12-09 19:09:47,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266865432] [2020-12-09 19:09:47,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:09:47,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:09:47,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:09:47,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-12-09 19:09:47,843 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand 4 states. [2020-12-09 19:09:47,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:09:47,855 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2020-12-09 19:09:47,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:09:47,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-09 19:09:47,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:09:47,856 INFO L225 Difference]: With dead ends: 72 [2020-12-09 19:09:47,856 INFO L226 Difference]: Without dead ends: 38 [2020-12-09 19:09:47,857 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2020-12-09 19:09:47,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-09 19:09:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-12-09 19:09:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-09 19:09:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2020-12-09 19:09:47,861 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 16 [2020-12-09 19:09:47,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:09:47,862 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2020-12-09 19:09:47,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:09:47,862 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2020-12-09 19:09:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 19:09:47,862 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:09:47,862 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:09:48,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2020-12-09 19:09:48,064 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:09:48,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:09:48,065 INFO L82 PathProgramCache]: Analyzing trace with hash 976605466, now seen corresponding path program 2 times [2020-12-09 19:09:48,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:09:48,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479199999] [2020-12-09 19:09:48,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:09:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:09:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 19:09:48,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479199999] [2020-12-09 19:09:48,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510709946] [2020-12-09 19:09:48,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:09:48,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-12-09 19:09:48,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-09 19:09:48,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-09 19:09:48,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:09:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 19:09:49,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:09:50,290 WARN L838 $PredicateComparison]: unable to prove that (forall ((|~#pp~0.offset| Int) (v_DerPreprocessor_8 Int) (ULTIMATE.start_f_~i~1 Int)) (= (select (let ((.cse0 (* ULTIMATE.start_f_~i~1 4))) (store (select (store |c_#memory_int| |c_~#pp~0.base| (store (select |c_#memory_int| |c_~#pp~0.base|) (+ |~#pp~0.offset| .cse0) v_DerPreprocessor_8)) |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse0) 1)) |c_~#pstate~0.offset|) 1)) is different from false [2020-12-09 19:09:50,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_#memory_int_44| (Array Int (Array Int Int))) (|~#pp~0.offset| Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_f_~i~1_38 Int)) (= (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_38 4))) (store (select (let ((.cse0 (store |v_#memory_int_44| |c_~#pstate~0.base| (store (select |v_#memory_int_44| |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| (* c_ULTIMATE.start_f_~i~1 4)) 1)))) (store .cse0 |c_~#pp~0.base| (store (select .cse0 |c_~#pp~0.base|) (+ |~#pp~0.offset| .cse1) v_DerPreprocessor_8))) |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse1) 1)) |c_~#pstate~0.offset|) 1)) is different from false [2020-12-09 19:09:52,423 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_#memory_int_44| (Array Int (Array Int Int))) (|~#pp~0.offset| Int) (v_DerPreprocessor_8 Int) (v_ULTIMATE.start_f_~i~1_38 Int)) (= (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_38 4))) (store (select (let ((.cse0 (store |v_#memory_int_44| |c_~#pstate~0.base| (store (select |v_#memory_int_44| |c_~#pstate~0.base|) |c_~#pstate~0.offset| 1)))) (store .cse0 |c_~#pp~0.base| (store (select .cse0 |c_~#pp~0.base|) (+ |~#pp~0.offset| .cse1) v_DerPreprocessor_8))) |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse1) 1)) |c_~#pstate~0.offset|) 1)) is different from false [2020-12-09 19:09:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 19:09:52,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 19:09:52,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 14 [2020-12-09 19:09:52,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531434590] [2020-12-09 19:09:52,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-09 19:09:52,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:09:52,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-09 19:09:52,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=97, Unknown=3, NotChecked=66, Total=210 [2020-12-09 19:09:52,538 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand 13 states. [2020-12-09 19:09:52,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:09:52,815 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2020-12-09 19:09:52,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 19:09:52,815 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2020-12-09 19:09:52,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:09:52,816 INFO L225 Difference]: With dead ends: 114 [2020-12-09 19:09:52,816 INFO L226 Difference]: Without dead ends: 105 [2020-12-09 19:09:52,817 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=123, Invalid=266, Unknown=3, NotChecked=114, Total=506 [2020-12-09 19:09:52,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-12-09 19:09:52,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 47. [2020-12-09 19:09:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-09 19:09:52,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2020-12-09 19:09:52,824 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 17 [2020-12-09 19:09:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:09:52,824 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2020-12-09 19:09:52,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-09 19:09:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2020-12-09 19:09:52,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-09 19:09:52,824 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:09:52,825 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:09:53,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:09:53,025 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:09:53,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:09:53,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1274948947, now seen corresponding path program 1 times [2020-12-09 19:09:53,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:09:53,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478309981] [2020-12-09 19:09:53,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:09:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:09:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 19:09:53,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478309981] [2020-12-09 19:09:53,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:09:53,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-09 19:09:53,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544251688] [2020-12-09 19:09:53,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 19:09:53,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:09:53,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 19:09:53,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-12-09 19:09:53,197 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand 8 states. [2020-12-09 19:09:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:09:53,394 INFO L93 Difference]: Finished difference Result 95 states and 126 transitions. [2020-12-09 19:09:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 19:09:53,395 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-09 19:09:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:09:53,395 INFO L225 Difference]: With dead ends: 95 [2020-12-09 19:09:53,395 INFO L226 Difference]: Without dead ends: 71 [2020-12-09 19:09:53,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-12-09 19:09:53,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-09 19:09:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 47. [2020-12-09 19:09:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-12-09 19:09:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2020-12-09 19:09:53,402 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 18 [2020-12-09 19:09:53,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:09:53,402 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2020-12-09 19:09:53,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 19:09:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2020-12-09 19:09:53,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-09 19:09:53,403 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:09:53,403 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:09:53,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2020-12-09 19:09:53,403 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:09:53,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:09:53,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1443496990, now seen corresponding path program 1 times [2020-12-09 19:09:53,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:09:53,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590197899] [2020-12-09 19:09:53,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:09:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:09:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-09 19:09:53,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590197899] [2020-12-09 19:09:53,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635833494] [2020-12-09 19:09:53,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:09:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:09:53,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 30 conjunts are in the unsatisfiable core [2020-12-09 19:09:53,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:09:54,776 WARN L197 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2020-12-09 19:09:55,273 WARN L197 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2020-12-09 19:09:55,767 WARN L197 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-12-09 19:09:56,329 WARN L197 SmtUtils]: Spent 538.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-12-09 19:09:59,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:09:59,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:10:01,223 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_f_~i~1_42 Int) (v_DerPreprocessor_9 Int) (ULTIMATE.start_f_~pointer.offset Int)) (or (not (= c_ULTIMATE.start_main_~a~0.offset (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_42 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ .cse1 |c_~#pstate~0.offset|) v_DerPreprocessor_9)))) |c_~#pp~0.base|) |c_~#pp~0.offset|))) (< v_ULTIMATE.start_f_~i~1_42 (+ c_ULTIMATE.start_f_~i~1 1)))) is different from false [2020-12-09 19:10:02,615 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_f_~i~1_42 Int) (v_DerPreprocessor_9 Int) (ULTIMATE.start_f_~pointer.offset Int)) (or (not (= c_ULTIMATE.start_main_~a~0.offset (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_42 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ .cse1 |c_~#pstate~0.offset|) v_DerPreprocessor_9)))) |c_~#pp~0.base|) |c_~#pp~0.offset|))) (< v_ULTIMATE.start_f_~i~1_42 1))) is different from false [2020-12-09 19:10:04,645 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_f_~i~1_42 Int) (v_DerPreprocessor_9 Int) (v_prenex_1 Int) (ULTIMATE.start_f_~pointer.offset Int) (v_DerPreprocessor_10 Int)) (or (< v_ULTIMATE.start_f_~i~1_42 1) (not (= c_ULTIMATE.start_main_~a~0.offset (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_42 4))) (let ((.cse0 (let ((.cse2 (let ((.cse4 (* c_ULTIMATE.start_f_~i~1 4))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse4) ULTIMATE.start_f_~pointer.offset)))) (store .cse3 |c_~#pstate~0.base| (store (select .cse3 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse4) v_DerPreprocessor_10)))))) (store .cse2 |c_~#pp~0.base| (store (select .cse2 |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) v_prenex_1))))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ .cse1 |c_~#pstate~0.offset|) v_DerPreprocessor_9)))) |c_~#pp~0.base|) |c_~#pp~0.offset|))))) is different from false [2020-12-09 19:10:06,668 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_f_~i~1_42 Int) (v_ULTIMATE.start_f_~i~1_44 Int) (v_DerPreprocessor_9 Int) (v_prenex_1 Int) (ULTIMATE.start_f_~pointer.offset Int) (v_DerPreprocessor_10 Int)) (or (< v_ULTIMATE.start_f_~i~1_44 (+ c_ULTIMATE.start_f_~i~1 1)) (< v_ULTIMATE.start_f_~i~1_42 1) (not (= (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_42 4))) (let ((.cse0 (let ((.cse2 (let ((.cse4 (* v_ULTIMATE.start_f_~i~1_44 4))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse4 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse3 |c_~#pstate~0.base| (store (select .cse3 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse4) v_DerPreprocessor_10)))))) (store .cse2 |c_~#pp~0.base| (store (select .cse2 |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) v_prenex_1))))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ .cse1 |c_~#pstate~0.offset|) v_DerPreprocessor_9)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) c_ULTIMATE.start_main_~a~0.offset)))) is different from false [2020-12-09 19:10:08,704 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_f_~i~1_42 Int) (v_ULTIMATE.start_f_~i~1_44 Int) (v_DerPreprocessor_9 Int) (v_prenex_1 Int) (ULTIMATE.start_f_~pointer.offset Int) (v_DerPreprocessor_10 Int)) (or (< v_ULTIMATE.start_f_~i~1_42 1) (< v_ULTIMATE.start_f_~i~1_44 1) (not (= (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_42 4))) (let ((.cse0 (let ((.cse2 (let ((.cse4 (* v_ULTIMATE.start_f_~i~1_44 4))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse4 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse3 |c_~#pstate~0.base| (store (select .cse3 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse4) v_DerPreprocessor_10)))))) (store .cse2 |c_~#pp~0.base| (store (select .cse2 |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) v_prenex_1))))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ .cse1 |c_~#pstate~0.offset|) v_DerPreprocessor_9)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) c_ULTIMATE.start_main_~a~0.offset)))) is different from false [2020-12-09 19:10:10,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_f_~i~1_42 Int) (v_ULTIMATE.start_f_~i~1_44 Int) (v_DerPreprocessor_9 Int) (v_prenex_1 Int) (ULTIMATE.start_f_~pointer.offset Int) (v_DerPreprocessor_10 Int)) (or (< v_ULTIMATE.start_f_~i~1_42 1) (< v_ULTIMATE.start_f_~i~1_44 1) (not (= c_~counter~0 (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_42 4))) (let ((.cse0 (let ((.cse2 (let ((.cse4 (* v_ULTIMATE.start_f_~i~1_44 4))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse4 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse3 |c_~#pstate~0.base| (store (select .cse3 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse4) v_DerPreprocessor_10)))))) (store .cse2 |c_~#pp~0.base| (store (select .cse2 |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) v_prenex_1))))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ .cse1 |c_~#pstate~0.offset|) v_DerPreprocessor_9)))) |c_~#pp~0.base|) |c_~#pp~0.offset|))))) is different from false [2020-12-09 19:10:35,077 WARN L197 SmtUtils]: Spent 15.83 s on a formula simplification. DAG size of input: 6271 DAG size of output: 364 [2020-12-09 19:10:35,218 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 323 [2020-12-09 19:10:36,302 WARN L197 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 324 DAG size of output: 66 [2020-12-09 19:10:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-12-09 19:10:36,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [546185832] [2020-12-09 19:10:36,348 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2020-12-09 19:10:36,349 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:10:36,349 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:10:36,349 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:10:36,349 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:10:37,348 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 19:10:37,867 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2020-12-09 19:10:38,211 WARN L197 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2020-12-09 19:10:38,501 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 91 [2020-12-09 19:10:38,838 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 19:10:38,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 19:10:38,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 13, 13] total 30 [2020-12-09 19:10:38,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496902096] [2020-12-09 19:10:38,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-12-09 19:10:38,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:10:38,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-12-09 19:10:38,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1134, Unknown=16, NotChecked=438, Total=1722 [2020-12-09 19:10:38,840 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand 31 states. [2020-12-09 19:10:39,974 WARN L197 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2020-12-09 19:10:41,372 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|))) (and (<= 0 |c_~#pp~0.offset|) (<= 1 c_ULTIMATE.start_init_~i~0) (= (select .cse0 0) 0) (= (select .cse0 |c_~#pp~0.offset|) 0) (not (= |c_~#pp~0.base| |c_~#pstate~0.base|)) (forall ((v_ULTIMATE.start_f_~i~1_42 Int) (v_ULTIMATE.start_f_~i~1_44 Int) (v_DerPreprocessor_9 Int) (v_prenex_1 Int) (ULTIMATE.start_f_~pointer.offset Int) (v_DerPreprocessor_10 Int)) (or (< v_ULTIMATE.start_f_~i~1_42 1) (< v_ULTIMATE.start_f_~i~1_44 1) (not (= c_~counter~0 (select (select (let ((.cse2 (* v_ULTIMATE.start_f_~i~1_42 4))) (let ((.cse1 (let ((.cse3 (let ((.cse5 (* v_ULTIMATE.start_f_~i~1_44 4))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse5 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse4 |c_~#pstate~0.base| (store (select .cse4 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse5) v_DerPreprocessor_10)))))) (store .cse3 |c_~#pp~0.base| (store (select .cse3 |c_~#pp~0.base|) (+ .cse2 |c_~#pp~0.offset|) v_prenex_1))))) (store .cse1 |c_~#pstate~0.base| (store (select .cse1 |c_~#pstate~0.base|) (+ .cse2 |c_~#pstate~0.offset|) v_DerPreprocessor_9)))) |c_~#pp~0.base|) |c_~#pp~0.offset|))))) (<= |c_~#pp~0.offset| 0) (= c_~counter~0 1) (= (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) 0) 0) (exists ((v_ULTIMATE.start_init_~i~0_31 Int)) (and (<= 1 v_ULTIMATE.start_init_~i~0_31) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* v_ULTIMATE.start_init_~i~0_31 4) |c_~#pp~0.offset|))))) (= |c_~#pp~0.offset| 0))) is different from false [2020-12-09 19:10:43,208 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|))) (and (<= 0 |c_~#pp~0.offset|) (= (select .cse0 0) 0) (= (select .cse0 |c_~#pp~0.offset|) 0) (not (= |c_~#pp~0.base| |c_~#pstate~0.base|)) (forall ((v_ULTIMATE.start_f_~i~1_42 Int) (v_ULTIMATE.start_f_~i~1_44 Int) (v_DerPreprocessor_9 Int) (v_prenex_1 Int) (ULTIMATE.start_f_~pointer.offset Int) (v_DerPreprocessor_10 Int)) (or (< v_ULTIMATE.start_f_~i~1_42 1) (< v_ULTIMATE.start_f_~i~1_44 1) (not (= c_~counter~0 (select (select (let ((.cse2 (* v_ULTIMATE.start_f_~i~1_42 4))) (let ((.cse1 (let ((.cse3 (let ((.cse5 (* v_ULTIMATE.start_f_~i~1_44 4))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse5 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse4 |c_~#pstate~0.base| (store (select .cse4 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse5) v_DerPreprocessor_10)))))) (store .cse3 |c_~#pp~0.base| (store (select .cse3 |c_~#pp~0.base|) (+ .cse2 |c_~#pp~0.offset|) v_prenex_1))))) (store .cse1 |c_~#pstate~0.base| (store (select .cse1 |c_~#pstate~0.base|) (+ .cse2 |c_~#pstate~0.offset|) v_DerPreprocessor_9)))) |c_~#pp~0.base|) |c_~#pp~0.offset|))))) (<= |c_~#pp~0.offset| 0) (= c_~counter~0 1) (= (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) 0) 0) (exists ((v_ULTIMATE.start_init_~i~0_31 Int)) (and (<= 1 v_ULTIMATE.start_init_~i~0_31) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* v_ULTIMATE.start_init_~i~0_31 4) |c_~#pp~0.offset|))))) (= |c_~#pp~0.offset| 0))) is different from false [2020-12-09 19:10:45,214 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|))) (and (<= 0 |c_~#pp~0.offset|) (= c_ULTIMATE.start_main_~a~0.offset 1) (= (select .cse0 0) 0) (= (select .cse0 |c_~#pp~0.offset|) 0) (not (= |c_~#pp~0.base| |c_~#pstate~0.base|)) (<= |c_~#pp~0.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) 0) 0) (forall ((v_ULTIMATE.start_f_~i~1_42 Int) (v_ULTIMATE.start_f_~i~1_44 Int) (v_DerPreprocessor_9 Int) (v_prenex_1 Int) (ULTIMATE.start_f_~pointer.offset Int) (v_DerPreprocessor_10 Int)) (or (< v_ULTIMATE.start_f_~i~1_42 1) (< v_ULTIMATE.start_f_~i~1_44 1) (not (= (select (select (let ((.cse2 (* v_ULTIMATE.start_f_~i~1_42 4))) (let ((.cse1 (let ((.cse3 (let ((.cse5 (* v_ULTIMATE.start_f_~i~1_44 4))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse5 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse4 |c_~#pstate~0.base| (store (select .cse4 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse5) v_DerPreprocessor_10)))))) (store .cse3 |c_~#pp~0.base| (store (select .cse3 |c_~#pp~0.base|) (+ .cse2 |c_~#pp~0.offset|) v_prenex_1))))) (store .cse1 |c_~#pstate~0.base| (store (select .cse1 |c_~#pstate~0.base|) (+ .cse2 |c_~#pstate~0.offset|) v_DerPreprocessor_9)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) c_ULTIMATE.start_main_~a~0.offset)))) (exists ((v_ULTIMATE.start_init_~i~0_31 Int)) (and (<= 1 v_ULTIMATE.start_init_~i~0_31) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* v_ULTIMATE.start_init_~i~0_31 4) |c_~#pp~0.offset|))))) (= |c_~#pp~0.offset| 0))) is different from false [2020-12-09 19:10:47,105 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|)) (.cse1 (+ |c_~#pp~0.offset| (* c_ULTIMATE.start_f_~i~1 4)))) (and (= (select .cse0 .cse1) 0) (= c_ULTIMATE.start_f_~i~1 0) (= c_ULTIMATE.start_main_~a~0.offset 1) (= (select .cse0 |c_~#pp~0.offset|) 0) (not (= |c_~#pp~0.base| |c_~#pstate~0.base|)) (forall ((v_ULTIMATE.start_f_~i~1_42 Int) (v_ULTIMATE.start_f_~i~1_44 Int) (v_DerPreprocessor_9 Int) (v_prenex_1 Int) (ULTIMATE.start_f_~pointer.offset Int) (v_DerPreprocessor_10 Int)) (or (< v_ULTIMATE.start_f_~i~1_44 (+ c_ULTIMATE.start_f_~i~1 1)) (< v_ULTIMATE.start_f_~i~1_42 1) (not (= (select (select (let ((.cse3 (* v_ULTIMATE.start_f_~i~1_42 4))) (let ((.cse2 (let ((.cse4 (let ((.cse6 (* v_ULTIMATE.start_f_~i~1_44 4))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse6 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse5 |c_~#pstate~0.base| (store (select .cse5 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse6) v_DerPreprocessor_10)))))) (store .cse4 |c_~#pp~0.base| (store (select .cse4 |c_~#pp~0.base|) (+ .cse3 |c_~#pp~0.offset|) v_prenex_1))))) (store .cse2 |c_~#pstate~0.base| (store (select .cse2 |c_~#pstate~0.base|) (+ .cse3 |c_~#pstate~0.offset|) v_DerPreprocessor_9)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) c_ULTIMATE.start_main_~a~0.offset)))) (= (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) .cse1) 0) (= (+ |c_~#pp~0.offset| (* 4 c_ULTIMATE.start_f_~i~1)) 0) (exists ((v_ULTIMATE.start_init_~i~0_31 Int)) (and (<= 1 v_ULTIMATE.start_init_~i~0_31) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* v_ULTIMATE.start_init_~i~0_31 4) |c_~#pp~0.offset|))))) (= |c_~#pp~0.offset| 0))) is different from false [2020-12-09 19:10:48,885 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_f_#t~mem9.offset|) (= c_ULTIMATE.start_f_~i~1 0) (= c_ULTIMATE.start_main_~a~0.offset 1) (= |c_ULTIMATE.start_f_#t~mem9.base| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) |c_~#pp~0.offset|) 0) (not (= |c_~#pp~0.base| |c_~#pstate~0.base|)) (forall ((v_ULTIMATE.start_f_~i~1_42 Int) (v_ULTIMATE.start_f_~i~1_44 Int) (v_DerPreprocessor_9 Int) (v_prenex_1 Int) (ULTIMATE.start_f_~pointer.offset Int) (v_DerPreprocessor_10 Int)) (or (< v_ULTIMATE.start_f_~i~1_44 (+ c_ULTIMATE.start_f_~i~1 1)) (< v_ULTIMATE.start_f_~i~1_42 1) (not (= (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_42 4))) (let ((.cse0 (let ((.cse2 (let ((.cse4 (* v_ULTIMATE.start_f_~i~1_44 4))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse4 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse3 |c_~#pstate~0.base| (store (select .cse3 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse4) v_DerPreprocessor_10)))))) (store .cse2 |c_~#pp~0.base| (store (select .cse2 |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) v_prenex_1))))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ .cse1 |c_~#pstate~0.offset|) v_DerPreprocessor_9)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) c_ULTIMATE.start_main_~a~0.offset)))) (= (+ |c_~#pp~0.offset| (* 4 c_ULTIMATE.start_f_~i~1)) 0) (exists ((v_ULTIMATE.start_init_~i~0_31 Int)) (and (<= 1 v_ULTIMATE.start_init_~i~0_31) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ (* v_ULTIMATE.start_init_~i~0_31 4) |c_~#pp~0.offset|))))) (= |c_~#pp~0.offset| 0)) is different from false [2020-12-09 19:10:49,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:10:49,118 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2020-12-09 19:10:49,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 19:10:49,119 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 19 [2020-12-09 19:10:49,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:10:49,119 INFO L225 Difference]: With dead ends: 85 [2020-12-09 19:10:49,120 INFO L226 Difference]: Without dead ends: 51 [2020-12-09 19:10:49,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=153, Invalid=1202, Unknown=21, NotChecked=880, Total=2256 [2020-12-09 19:10:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-09 19:10:49,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-12-09 19:10:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-12-09 19:10:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2020-12-09 19:10:49,127 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 19 [2020-12-09 19:10:49,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:10:49,127 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2020-12-09 19:10:49,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-12-09 19:10:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2020-12-09 19:10:49,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 19:10:49,127 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:10:49,128 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:10:49,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable78 [2020-12-09 19:10:49,329 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:10:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:10:49,330 INFO L82 PathProgramCache]: Analyzing trace with hash -850812508, now seen corresponding path program 2 times [2020-12-09 19:10:49,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:10:49,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893986837] [2020-12-09 19:10:49,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:10:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:10:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 19:10:49,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893986837] [2020-12-09 19:10:49,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:10:49,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 19:10:49,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322976252] [2020-12-09 19:10:49,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:10:49,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:10:49,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:10:49,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:10:49,391 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand 5 states. [2020-12-09 19:10:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:10:49,404 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2020-12-09 19:10:49,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:10:49,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-12-09 19:10:49,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:10:49,405 INFO L225 Difference]: With dead ends: 81 [2020-12-09 19:10:49,405 INFO L226 Difference]: Without dead ends: 37 [2020-12-09 19:10:49,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:10:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-12-09 19:10:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-12-09 19:10:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-09 19:10:49,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2020-12-09 19:10:49,409 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 20 [2020-12-09 19:10:49,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:10:49,409 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2020-12-09 19:10:49,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:10:49,410 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2020-12-09 19:10:49,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 19:10:49,410 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:10:49,410 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:10:49,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2020-12-09 19:10:49,410 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:10:49,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:10:49,410 INFO L82 PathProgramCache]: Analyzing trace with hash 326164409, now seen corresponding path program 1 times [2020-12-09 19:10:49,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:10:49,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256708147] [2020-12-09 19:10:49,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:10:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:10:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 19:10:49,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256708147] [2020-12-09 19:10:49,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717290850] [2020-12-09 19:10:49,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:10:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:10:49,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-09 19:10:49,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:10:49,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 19:10:49,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:10:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-09 19:10:49,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1604836942] [2020-12-09 19:10:49,775 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 19:10:49,775 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:10:49,775 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:10:49,776 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:10:49,776 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:10:50,440 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:10:50,800 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 19:10:51,041 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-12-09 19:10:51,330 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2020-12-09 19:10:51,476 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2020-12-09 19:10:51,664 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2020-12-09 19:10:51,823 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-09 19:10:52,005 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-12-09 19:10:52,370 WARN L197 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 101 [2020-12-09 19:10:52,587 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-12-09 19:10:52,815 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-12-09 19:10:53,086 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-12-09 19:10:53,087 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 19:10:53,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 19:10:53,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 18 [2020-12-09 19:10:53,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989249339] [2020-12-09 19:10:53,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-09 19:10:53,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:10:53,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-09 19:10:53,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2020-12-09 19:10:53,088 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand 18 states. [2020-12-09 19:10:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:10:53,564 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2020-12-09 19:10:53,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 19:10:53,564 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 20 [2020-12-09 19:10:53,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:10:53,565 INFO L225 Difference]: With dead ends: 96 [2020-12-09 19:10:53,565 INFO L226 Difference]: Without dead ends: 84 [2020-12-09 19:10:53,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=206, Invalid=1200, Unknown=0, NotChecked=0, Total=1406 [2020-12-09 19:10:53,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-12-09 19:10:53,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2020-12-09 19:10:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-12-09 19:10:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2020-12-09 19:10:53,572 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 20 [2020-12-09 19:10:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:10:53,573 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2020-12-09 19:10:53,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-09 19:10:53,573 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2020-12-09 19:10:53,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-09 19:10:53,573 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:10:53,573 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:10:53,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:10:53,774 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:10:53,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:10:53,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1600416119, now seen corresponding path program 1 times [2020-12-09 19:10:53,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:10:53,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380031973] [2020-12-09 19:10:53,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:10:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:10:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:10:54,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380031973] [2020-12-09 19:10:54,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715044968] [2020-12-09 19:10:54,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:10:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:10:54,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 28 conjunts are in the unsatisfiable core [2020-12-09 19:10:54,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:10:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-09 19:10:54,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:10:56,528 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_f_~i~1_62 Int) (v_DerPreprocessor_18 Int) (ULTIMATE.start_f_~pointer.offset Int)) (or (< 0 v_ULTIMATE.start_f_~i~1_62) (not (= (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_62 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ .cse1 |c_~#pstate~0.offset|) v_DerPreprocessor_18)))) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) c_ULTIMATE.start_main_~a~0.offset)))) is different from false [2020-12-09 19:10:58,538 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_f_~i~1_62 Int) (v_DerPreprocessor_18 Int) (ULTIMATE.start_f_~pointer.offset Int)) (or (not (= c_~counter~0 (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_62 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ .cse1 |c_~#pstate~0.offset|) v_DerPreprocessor_18)))) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)))) (< 0 v_ULTIMATE.start_f_~i~1_62))) is different from false [2020-12-09 19:10:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2020-12-09 19:10:58,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1561753342] [2020-12-09 19:10:58,734 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 19:10:58,734 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:10:58,735 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:10:58,735 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:10:58,735 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:10:59,383 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:10:59,719 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 19:11:00,954 WARN L197 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 128 DAG size of output: 122 [2020-12-09 19:11:01,319 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2020-12-09 19:11:01,492 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2020-12-09 19:11:01,720 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2020-12-09 19:11:01,907 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-09 19:11:02,118 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-12-09 19:11:02,439 WARN L197 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2020-12-09 19:11:02,987 WARN L197 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2020-12-09 19:11:03,577 WARN L197 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 111 [2020-12-09 19:11:04,984 WARN L197 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 126 DAG size of output: 120 [2020-12-09 19:11:04,985 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 19:11:04,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 19:11:04,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 32 [2020-12-09 19:11:04,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279738180] [2020-12-09 19:11:04,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-12-09 19:11:04,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:11:04,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-12-09 19:11:04,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1665, Unknown=2, NotChecked=166, Total=1980 [2020-12-09 19:11:04,987 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand 33 states. [2020-12-09 19:11:05,943 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 c_ULTIMATE.start_init_~i~0) (not (= |c_~#pp~0.base| |c_~#pstate~0.base|)) (= c_~counter~0 1) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) 0) (forall ((v_ULTIMATE.start_f_~i~1_62 Int) (v_DerPreprocessor_18 Int) (ULTIMATE.start_f_~pointer.offset Int)) (or (not (= c_~counter~0 (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_62 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ .cse1 |c_~#pstate~0.offset|) v_DerPreprocessor_18)))) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)))) (< 0 v_ULTIMATE.start_f_~i~1_62)))) is different from false [2020-12-09 19:11:06,991 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_f_~i~1_62 Int) (v_DerPreprocessor_18 Int) (ULTIMATE.start_f_~pointer.offset Int)) (or (< 0 v_ULTIMATE.start_f_~i~1_62) (not (= (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_62 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ .cse1 |c_~#pstate~0.offset|) v_DerPreprocessor_18)))) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) c_ULTIMATE.start_main_~a~0.offset)))) (= c_ULTIMATE.start_main_~a~0.offset 1) (not (= |c_~#pp~0.base| |c_~#pstate~0.base|)) (= c_ULTIMATE.start_main_~a~0.base 0) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)) 0)) is different from false [2020-12-09 19:11:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:11:08,161 INFO L93 Difference]: Finished difference Result 134 states and 177 transitions. [2020-12-09 19:11:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 19:11:08,162 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 21 [2020-12-09 19:11:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:11:08,163 INFO L225 Difference]: With dead ends: 134 [2020-12-09 19:11:08,163 INFO L226 Difference]: Without dead ends: 83 [2020-12-09 19:11:08,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=304, Invalid=2678, Unknown=4, NotChecked=436, Total=3422 [2020-12-09 19:11:08,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-12-09 19:11:08,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2020-12-09 19:11:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-09 19:11:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2020-12-09 19:11:08,172 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 21 [2020-12-09 19:11:08,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:11:08,172 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2020-12-09 19:11:08,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-12-09 19:11:08,172 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2020-12-09 19:11:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 19:11:08,173 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:11:08,173 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:11:08,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable190 [2020-12-09 19:11:08,374 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:11:08,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:11:08,375 INFO L82 PathProgramCache]: Analyzing trace with hash -117339713, now seen corresponding path program 1 times [2020-12-09 19:11:08,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:11:08,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861722599] [2020-12-09 19:11:08,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:11:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 19:11:08,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861722599] [2020-12-09 19:11:08,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904880553] [2020-12-09 19:11:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:11:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:08,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 19:11:08,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:11:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 19:11:08,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:11:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 19:11:08,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2020-12-09 19:11:08,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 6 [2020-12-09 19:11:08,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649667297] [2020-12-09 19:11:08,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:11:08,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:11:08,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:11:08,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:11:08,513 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand 5 states. [2020-12-09 19:11:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:11:08,553 INFO L93 Difference]: Finished difference Result 118 states and 149 transitions. [2020-12-09 19:11:08,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:11:08,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-12-09 19:11:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:11:08,554 INFO L225 Difference]: With dead ends: 118 [2020-12-09 19:11:08,554 INFO L226 Difference]: Without dead ends: 63 [2020-12-09 19:11:08,555 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:11:08,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-09 19:11:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2020-12-09 19:11:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-12-09 19:11:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2020-12-09 19:11:08,561 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 25 [2020-12-09 19:11:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:11:08,562 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2020-12-09 19:11:08,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:11:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2020-12-09 19:11:08,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-09 19:11:08,562 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:11:08,562 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:11:08,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:11:08,764 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:11:08,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:11:08,765 INFO L82 PathProgramCache]: Analyzing trace with hash 721988503, now seen corresponding path program 1 times [2020-12-09 19:11:08,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:11:08,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643645181] [2020-12-09 19:11:08,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:11:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-09 19:11:09,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643645181] [2020-12-09 19:11:09,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141724282] [2020-12-09 19:11:09,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:11:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:09,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 35 conjunts are in the unsatisfiable core [2020-12-09 19:11:09,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:11:09,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-09 19:11:09,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:11:11,000 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_22 Int) (ULTIMATE.start_g_~i~2 Int)) (< (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| (* ULTIMATE.start_g_~i~2 4)) v_DerPreprocessor_22)) |c_~#pp~0.base|) |c_~#pp~0.offset|) c_ULTIMATE.start_main_~b~0.offset)) is different from false [2020-12-09 19:11:12,252 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_22 Int) (v_ULTIMATE.start_g_~i~2_50 Int)) (< (select (select (store |c_#memory_$Pointer$.offset| |c_~#pstate~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| (* v_ULTIMATE.start_g_~i~2_50 4)) v_DerPreprocessor_22)) |c_~#pp~0.base|) |c_~#pp~0.offset|) c_ULTIMATE.start_main_~b~0.offset)) is different from false [2020-12-09 19:11:14,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_22 Int) (v_DerPreprocessor_23 Int) (v_ULTIMATE.start_g_~i~2_50 Int) (v_ULTIMATE.start_f_~i~1_67 Int) (ULTIMATE.start_f_~pointer.offset Int)) (or (< v_ULTIMATE.start_f_~i~1_67 (+ c_ULTIMATE.start_f_~i~1 1)) (< (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_67 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse1) ULTIMATE.start_f_~pointer.offset)))) (store .cse0 |c_~#pstate~0.base| (store (store (select .cse0 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse1) v_DerPreprocessor_23) (+ |c_~#pstate~0.offset| (* v_ULTIMATE.start_g_~i~2_50 4)) v_DerPreprocessor_22)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) c_ULTIMATE.start_main_~b~0.offset))) is different from false [2020-12-09 19:11:16,635 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_22 Int) (v_DerPreprocessor_23 Int) (v_ULTIMATE.start_g_~i~2_50 Int) (v_ULTIMATE.start_f_~i~1_67 Int) (ULTIMATE.start_f_~pointer.offset Int)) (or (< v_ULTIMATE.start_f_~i~1_67 1) (< (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_67 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse1) ULTIMATE.start_f_~pointer.offset)))) (store .cse0 |c_~#pstate~0.base| (store (store (select .cse0 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse1) v_DerPreprocessor_23) (+ |c_~#pstate~0.offset| (* v_ULTIMATE.start_g_~i~2_50 4)) v_DerPreprocessor_22)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) c_ULTIMATE.start_main_~b~0.offset))) is different from false [2020-12-09 19:11:16,997 WARN L197 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 42 [2020-12-09 19:11:17,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 6 not checked. [2020-12-09 19:11:17,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1503055233] [2020-12-09 19:11:17,070 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2020-12-09 19:11:17,070 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:11:17,070 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:11:17,070 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:11:17,071 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:11:17,685 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:11:18,262 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:11:18,820 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 19:11:19,047 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-12-09 19:11:19,505 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2020-12-09 19:11:19,735 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2020-12-09 19:11:19,903 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-09 19:11:20,103 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-12-09 19:11:20,512 WARN L197 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 101 [2020-12-09 19:11:20,759 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-12-09 19:11:21,214 WARN L197 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 110 [2020-12-09 19:11:22,195 WARN L197 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2020-12-09 19:11:22,507 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-12-09 19:11:22,822 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 19:11:23,055 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-12-09 19:11:23,439 WARN L197 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 105 [2020-12-09 19:11:23,758 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2020-12-09 19:11:23,759 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 19:11:23,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 19:11:23,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2020-12-09 19:11:23,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060125924] [2020-12-09 19:11:23,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-12-09 19:11:23,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:11:23,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-12-09 19:11:23,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=2041, Unknown=4, NotChecked=380, Total=2652 [2020-12-09 19:11:23,761 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 35 states. [2020-12-09 19:11:24,748 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|))) (and (= (select .cse0 |c_~#pp~0.offset|) c_ULTIMATE.start_main_~a~0.offset) (<= 0 |c_~#pp~0.offset|) (< 0 (+ |c_~#pp~0.offset| (* 4 c_ULTIMATE.start_f_~i~1) 1)) (= c_ULTIMATE.start_main_~a~0.offset 1) (<= (+ c_ULTIMATE.start_main_~a~0.offset 1) c_ULTIMATE.start_main_~b~0.offset) (<= 0 c_ULTIMATE.start_f_~i~1) (<= |c_~#pp~0.offset| 0) (= c_ULTIMATE.start_f_~i~1 0) (= c_ULTIMATE.start_f_~pointer.base 0) (not (= |c_~#pp~0.base| |c_~#pstate~0.base|)) (= c_ULTIMATE.start_main_~a~0.base 0) (not (= c_ULTIMATE.start_main_~b~0.offset c_ULTIMATE.start_f_~pointer.offset)) (forall ((v_DerPreprocessor_22 Int) (v_DerPreprocessor_23 Int) (v_ULTIMATE.start_g_~i~2_50 Int) (v_ULTIMATE.start_f_~i~1_67 Int) (ULTIMATE.start_f_~pointer.offset Int)) (or (< v_ULTIMATE.start_f_~i~1_67 1) (< (select (select (let ((.cse2 (* v_ULTIMATE.start_f_~i~1_67 4))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse2) ULTIMATE.start_f_~pointer.offset)))) (store .cse1 |c_~#pstate~0.base| (store (store (select .cse1 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse2) v_DerPreprocessor_23) (+ |c_~#pstate~0.offset| (* v_ULTIMATE.start_g_~i~2_50 4)) v_DerPreprocessor_22)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) c_ULTIMATE.start_main_~b~0.offset))) (= c_ULTIMATE.start_main_~a~0.offset c_ULTIMATE.start_f_~pointer.offset) (= (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* c_ULTIMATE.start_f_~i~1 4))) 0) (= |c_~#pp~0.offset| 0) (not (= (select .cse0 0) c_ULTIMATE.start_main_~b~0.offset)))) is different from false [2020-12-09 19:11:26,225 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|))) (and (= (select .cse0 |c_~#pp~0.offset|) c_ULTIMATE.start_main_~a~0.offset) (= c_ULTIMATE.start_f_~i~1 0) (< 0 (+ |c_~#pp~0.offset| (* 4 c_ULTIMATE.start_f_~i~1) 1)) (= c_ULTIMATE.start_main_~a~0.offset 1) (not (= |c_~#pp~0.base| |c_~#pstate~0.base|)) (<= (+ c_ULTIMATE.start_main_~a~0.offset 1) c_ULTIMATE.start_main_~b~0.offset) (<= 0 c_ULTIMATE.start_f_~i~1) (<= |c_~#pp~0.offset| 0) (forall ((v_DerPreprocessor_22 Int) (v_DerPreprocessor_23 Int) (v_ULTIMATE.start_g_~i~2_50 Int) (v_ULTIMATE.start_f_~i~1_67 Int) (ULTIMATE.start_f_~pointer.offset Int)) (or (< v_ULTIMATE.start_f_~i~1_67 (+ c_ULTIMATE.start_f_~i~1 1)) (< (select (select (let ((.cse2 (* v_ULTIMATE.start_f_~i~1_67 4))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse2) ULTIMATE.start_f_~pointer.offset)))) (store .cse1 |c_~#pstate~0.base| (store (store (select .cse1 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse2) v_DerPreprocessor_23) (+ |c_~#pstate~0.offset| (* v_ULTIMATE.start_g_~i~2_50 4)) v_DerPreprocessor_22)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) c_ULTIMATE.start_main_~b~0.offset))) (= (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| (* c_ULTIMATE.start_f_~i~1 4))) 0) (= |c_~#pp~0.offset| 0) (not (= (select .cse0 0) c_ULTIMATE.start_main_~b~0.offset)))) is different from false [2020-12-09 19:11:27,562 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|))) (and (= (select .cse0 |c_~#pp~0.offset|) c_ULTIMATE.start_main_~a~0.offset) (< 0 (+ |c_~#pp~0.offset| (* 4 c_ULTIMATE.start_f_~i~1) 1)) (= c_ULTIMATE.start_main_~a~0.offset 1) (<= (+ c_ULTIMATE.start_main_~a~0.offset 1) c_ULTIMATE.start_main_~b~0.offset) (<= 0 c_ULTIMATE.start_f_~i~1) (<= |c_~#pp~0.offset| 0) (= (select .cse0 (+ |c_~#pp~0.offset| (* c_ULTIMATE.start_f_~i~1 4))) |c_ULTIMATE.start_f_#t~mem9.offset|) (= c_ULTIMATE.start_f_~i~1 0) (= |c_ULTIMATE.start_f_#t~mem9.base| 0) (not (= |c_~#pp~0.base| |c_~#pstate~0.base|)) (forall ((v_DerPreprocessor_22 Int) (v_DerPreprocessor_23 Int) (v_ULTIMATE.start_g_~i~2_50 Int) (v_ULTIMATE.start_f_~i~1_67 Int) (ULTIMATE.start_f_~pointer.offset Int)) (or (< v_ULTIMATE.start_f_~i~1_67 (+ c_ULTIMATE.start_f_~i~1 1)) (< (select (select (let ((.cse2 (* v_ULTIMATE.start_f_~i~1_67 4))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ |c_~#pp~0.offset| .cse2) ULTIMATE.start_f_~pointer.offset)))) (store .cse1 |c_~#pstate~0.base| (store (store (select .cse1 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse2) v_DerPreprocessor_23) (+ |c_~#pstate~0.offset| (* v_ULTIMATE.start_g_~i~2_50 4)) v_DerPreprocessor_22)))) |c_~#pp~0.base|) |c_~#pp~0.offset|) c_ULTIMATE.start_main_~b~0.offset))) (= |c_~#pp~0.offset| 0) (not (= (select .cse0 0) c_ULTIMATE.start_main_~b~0.offset)))) is different from false [2020-12-09 19:11:28,387 WARN L197 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 22 [2020-12-09 19:11:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:11:28,631 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2020-12-09 19:11:28,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 19:11:28,632 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 26 [2020-12-09 19:11:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:11:28,632 INFO L225 Difference]: With dead ends: 64 [2020-12-09 19:11:28,632 INFO L226 Difference]: Without dead ends: 51 [2020-12-09 19:11:28,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=316, Invalid=2461, Unknown=7, NotChecked=756, Total=3540 [2020-12-09 19:11:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-09 19:11:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2020-12-09 19:11:28,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-09 19:11:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2020-12-09 19:11:28,639 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 26 [2020-12-09 19:11:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:11:28,639 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2020-12-09 19:11:28,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-12-09 19:11:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-12-09 19:11:28,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 19:11:28,639 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:11:28,639 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:11:28,840 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable243 [2020-12-09 19:11:28,841 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:11:28,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:11:28,842 INFO L82 PathProgramCache]: Analyzing trace with hash -480910043, now seen corresponding path program 1 times [2020-12-09 19:11:28,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:11:28,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141215605] [2020-12-09 19:11:28,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:11:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-09 19:11:29,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141215605] [2020-12-09 19:11:29,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720529713] [2020-12-09 19:11:29,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:11:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:29,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 32 conjunts are in the unsatisfiable core [2020-12-09 19:11:29,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:11:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-09 19:11:29,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:11:30,912 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_f_~i~1_77 Int) (v_DerPreprocessor_27 Int) (ULTIMATE.start_f_~pointer.offset Int)) (or (not (= c_ULTIMATE.start_main_~b~0.offset (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_77 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse1) v_DerPreprocessor_27)))) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)))) (< 0 v_ULTIMATE.start_f_~i~1_77))) is different from false [2020-12-09 19:11:32,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_f_~i~1_77 Int) (v_DerPreprocessor_27 Int) (ULTIMATE.start_f_~pointer.offset Int)) (or (< 0 v_ULTIMATE.start_f_~i~1_77) (not (= (+ c_~counter~0 1) (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_77 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse1) v_DerPreprocessor_27)))) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)))))) is different from false [2020-12-09 19:11:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2020-12-09 19:11:33,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1184970706] [2020-12-09 19:11:33,099 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2020-12-09 19:11:33,099 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:11:33,099 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:11:33,099 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:11:33,099 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:11:33,727 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:11:34,285 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 19:11:35,479 WARN L197 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 127 DAG size of output: 118 [2020-12-09 19:11:35,810 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2020-12-09 19:11:35,975 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2020-12-09 19:11:36,191 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2020-12-09 19:11:36,362 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-09 19:11:36,569 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-12-09 19:11:36,869 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 82 [2020-12-09 19:11:37,412 WARN L197 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2020-12-09 19:11:37,981 WARN L197 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 111 [2020-12-09 19:11:39,131 WARN L197 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 99 [2020-12-09 19:11:40,336 WARN L197 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 121 DAG size of output: 112 [2020-12-09 19:11:41,744 WARN L197 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 125 DAG size of output: 116 [2020-12-09 19:11:41,745 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 19:11:41,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 19:11:41,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 10] total 27 [2020-12-09 19:11:41,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221783834] [2020-12-09 19:11:41,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-12-09 19:11:41,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:11:41,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-12-09 19:11:41,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1428, Unknown=2, NotChecked=154, Total=1722 [2020-12-09 19:11:41,747 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 28 states. [2020-12-09 19:11:42,674 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#pp~0.offset| 4))) (and (< 0 c_ULTIMATE.start_init_~i~0) (forall ((v_ULTIMATE.start_f_~i~1_77 Int) (v_DerPreprocessor_27 Int) (ULTIMATE.start_f_~pointer.offset Int)) (or (< 0 v_ULTIMATE.start_f_~i~1_77) (not (= (+ c_~counter~0 1) (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_77 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse1) v_DerPreprocessor_27)))) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)))))) (not (= |c_~#pp~0.base| |c_~#pstate~0.base|)) (= c_~counter~0 1) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) .cse2) 0) (= (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) .cse2) 0))) is different from false [2020-12-09 19:11:43,484 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#pp~0.offset| 4))) (and (= c_ULTIMATE.start_main_~b~0.offset 2) (not (= |c_~#pp~0.base| |c_~#pstate~0.base|)) (forall ((v_ULTIMATE.start_f_~i~1_77 Int) (v_DerPreprocessor_27 Int) (ULTIMATE.start_f_~pointer.offset Int)) (or (not (= c_ULTIMATE.start_main_~b~0.offset (select (select (let ((.cse1 (* v_ULTIMATE.start_f_~i~1_77 4))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) (+ .cse1 |c_~#pp~0.offset|) ULTIMATE.start_f_~pointer.offset)))) (store .cse0 |c_~#pstate~0.base| (store (select .cse0 |c_~#pstate~0.base|) (+ |c_~#pstate~0.offset| .cse1) v_DerPreprocessor_27)))) |c_~#pp~0.base|) (+ |c_~#pp~0.offset| 4)))) (< 0 v_ULTIMATE.start_f_~i~1_77))) (= (select (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) .cse2) 0) (= (select (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) .cse2) 0))) is different from false [2020-12-09 19:11:43,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:11:43,769 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-12-09 19:11:43,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-09 19:11:43,769 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2020-12-09 19:11:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:11:43,770 INFO L225 Difference]: With dead ends: 51 [2020-12-09 19:11:43,770 INFO L226 Difference]: Without dead ends: 32 [2020-12-09 19:11:43,770 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=194, Invalid=1888, Unknown=4, NotChecked=364, Total=2450 [2020-12-09 19:11:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-12-09 19:11:43,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-12-09 19:11:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-12-09 19:11:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2020-12-09 19:11:43,774 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2020-12-09 19:11:43,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:11:43,774 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2020-12-09 19:11:43,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-12-09 19:11:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2020-12-09 19:11:43,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-09 19:11:43,775 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:11:43,775 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:11:43,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable348,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:11:43,976 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:11:43,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:11:43,977 INFO L82 PathProgramCache]: Analyzing trace with hash -55505798, now seen corresponding path program 1 times [2020-12-09 19:11:43,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:11:43,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213700258] [2020-12-09 19:11:43,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:11:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:11:44,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213700258] [2020-12-09 19:11:44,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448263390] [2020-12-09 19:11:44,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:11:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:44,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 32 conjunts are in the unsatisfiable core [2020-12-09 19:11:44,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:11:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 19:11:45,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:11:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-09 19:11:45,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [56415244] [2020-12-09 19:11:45,503 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2020-12-09 19:11:45,503 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:11:45,503 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:11:45,504 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:11:45,504 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:11:46,182 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 19:11:47,585 INFO L180 IcfgInterpreter]: Interpretation finished [2020-12-09 19:11:48,293 WARN L197 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 118 [2020-12-09 19:11:48,658 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2020-12-09 19:11:48,873 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2020-12-09 19:11:49,156 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2020-12-09 19:11:49,371 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-09 19:11:49,615 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-12-09 19:11:50,060 WARN L197 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 101 [2020-12-09 19:11:50,344 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-12-09 19:11:50,841 WARN L197 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 110 [2020-12-09 19:11:51,931 WARN L197 SmtUtils]: Spent 877.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2020-12-09 19:11:52,280 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-12-09 19:11:52,648 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2020-12-09 19:11:53,344 WARN L197 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2020-12-09 19:11:54,140 WARN L197 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 112 [2020-12-09 19:11:54,962 WARN L197 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 116 [2020-12-09 19:11:54,963 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 19:11:54,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2020-12-09 19:11:54,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 34 [2020-12-09 19:11:54,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5866334] [2020-12-09 19:11:54,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 35 states [2020-12-09 19:11:54,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:11:54,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2020-12-09 19:11:54,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2435, Unknown=0, NotChecked=0, Total=2652 [2020-12-09 19:11:54,964 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2020-12-09 19:11:56,117 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 53 [2020-12-09 19:11:56,398 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2020-12-09 19:11:56,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:11:56,422 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2020-12-09 19:11:56,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-09 19:11:56,422 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 29 [2020-12-09 19:11:56,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:11:56,423 INFO L225 Difference]: With dead ends: 32 [2020-12-09 19:11:56,423 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 19:11:56,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=414, Invalid=3618, Unknown=0, NotChecked=0, Total=4032 [2020-12-09 19:11:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 19:11:56,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 19:11:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 19:11:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 19:11:56,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2020-12-09 19:11:56,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:11:56,424 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 19:11:56,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2020-12-09 19:11:56,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 19:11:56,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 19:11:56,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable417 [2020-12-09 19:11:56,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 19:11:57,548 WARN L197 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 88 [2020-12-09 19:12:23,113 WARN L197 SmtUtils]: Spent 25.56 s on a formula simplification. DAG size of input: 141 DAG size of output: 49 [2020-12-09 19:12:57,010 WARN L197 SmtUtils]: Spent 33.90 s on a formula simplification. DAG size of input: 148 DAG size of output: 82 [2020-12-09 19:12:57,518 WARN L197 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 100 [2020-12-09 19:14:23,714 WARN L197 SmtUtils]: Spent 1.44 m on a formula simplification. DAG size of input: 155 DAG size of output: 100 [2020-12-09 19:14:23,716 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-12-09 19:14:23,716 INFO L258 CegarLoopResult]: At program point L27-3(lines 27 33) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse1 (+ |~#pp~0.offset| 4)) (.cse3 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse2 (+ |~#pp~0.offset| (* ULTIMATE.start_f_~i~1 4)))) (and (<= 0 |~#pstate~0.base|) (= ULTIMATE.start_main_~b~0.base |ULTIMATE.start_malloc_#res.base|) (= |ULTIMATE.start_malloc_#in~size| 4) (= ~counter~0 3) (<= 0 |#t~string6.base|) (= |#t~string5.offset| 0) (<= 0 |#t~string5.base|) (= |~#pstate~0.offset| |~#pp~0.offset|) (= ULTIMATE.start_main_~a~0.base 0) (not (= ULTIMATE.start_init_~i~0 1)) (= |#NULL.offset| 0) (<= 0 |~#pp~0.base|) (= |ULTIMATE.start_f_#in~pointer.base| ULTIMATE.start_f_~pointer.base) (= 0 |#t~string4.offset|) (<= 0 |#StackHeapBarrier|) (= ULTIMATE.start_main_~b~0.offset 2) (= |#NULL.base| 0) (= ULTIMATE.start_main_~a~0.offset 1) (= ULTIMATE.start_main_~a~0.offset |ULTIMATE.start_f_#in~pointer.offset|) (= (select .cse0 .cse1) 0) (= |ULTIMATE.start_malloc_#res.base| 0) (<= 0 |#t~string4.base|) (= |ULTIMATE.start_malloc_#in~size| ULTIMATE.start_malloc_~size) (< 0 ULTIMATE.start_init_~i~0) (= (select .cse0 .cse2) 0) (= ULTIMATE.start_f_~i~1 0) (= (select (store .cse3 .cse2 ULTIMATE.start_f_~pointer.base) .cse1) 0) (= |ULTIMATE.start_malloc_#res.offset| ULTIMATE.start_main_~b~0.offset) (not (= |~#pp~0.base| |~#pstate~0.base|)) (= |ULTIMATE.start_f_#in~pointer.base| ULTIMATE.start_main_~a~0.base) (= .cse2 0) (= |#t~string6.offset| 0) (= ULTIMATE.start_main_~a~0.offset ULTIMATE.start_f_~pointer.offset) (= (select .cse3 .cse2) 0))) [2020-12-09 19:14:23,717 INFO L258 CegarLoopResult]: At program point L27-7(lines 27 33) the Hoare annotation is: (let ((.cse24 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse23 (select |#memory_$Pointer$.base| |~#pp~0.base|)) (.cse25 (+ |~#pp~0.offset| 4))) (let ((.cse0 (<= 0 |~#pstate~0.base|)) (.cse1 (= ULTIMATE.start_main_~b~0.base |ULTIMATE.start_malloc_#res.base|)) (.cse2 (= |ULTIMATE.start_malloc_#in~size| 4)) (.cse3 (= (select .cse23 .cse25) 0)) (.cse4 (<= 0 |#t~string6.base|)) (.cse6 (= |#t~string5.offset| 0)) (.cse5 (<= 0 |#t~string5.base|)) (.cse7 (= |#NULL.offset| 0)) (.cse8 (<= 0 |~#pp~0.base|)) (.cse9 (= 0 |#t~string4.offset|)) (.cse10 (<= 0 |#StackHeapBarrier|)) (.cse11 (= (select .cse24 |~#pp~0.offset|) ULTIMATE.start_main_~a~0.offset)) (.cse12 (= ULTIMATE.start_main_~b~0.offset 2)) (.cse14 (= |#NULL.base| 0)) (.cse13 (= ULTIMATE.start_main_~a~0.offset 1)) (.cse16 (= (select .cse24 .cse25) 0)) (.cse17 (= |ULTIMATE.start_malloc_#res.base| 0)) (.cse18 (<= 0 |#t~string4.base|)) (.cse19 (= |ULTIMATE.start_malloc_#in~size| ULTIMATE.start_malloc_~size)) (.cse15 (select |#memory_int| |~#pstate~0.base|)) (.cse20 (= |ULTIMATE.start_malloc_#res.offset| ULTIMATE.start_main_~b~0.offset)) (.cse21 (not (= |~#pp~0.base| |~#pstate~0.base|))) (.cse22 (= |#t~string6.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~counter~0 (+ |ULTIMATE.start_malloc_#res.offset| 1)) .cse5 .cse6 (= ULTIMATE.start_main_~a~0.base 0) .cse7 .cse8 (= 2 ULTIMATE.start_f_~pointer.offset) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= 2 ULTIMATE.start_init_~i~0) (= (select .cse15 0) 1) .cse16 .cse17 (< ULTIMATE.start_f_~i~1 2) .cse18 .cse19 (= |~#pstate~0.offset| 0) .cse20 (< 0 ULTIMATE.start_f_~i~1) .cse21 .cse22 (= |~#pp~0.offset| 0)) (and .cse0 .cse1 (<= |~#pp~0.offset| 0) .cse2 .cse3 (= ~counter~0 3) .cse4 .cse6 .cse5 (= |~#pstate~0.offset| |~#pp~0.offset|) (not (= ULTIMATE.start_init_~i~0 1)) (= |ULTIMATE.start_f_#in~pointer.base| ULTIMATE.start_main_~b~0.base) .cse7 .cse8 (= |ULTIMATE.start_f_#in~pointer.base| ULTIMATE.start_f_~pointer.base) .cse9 (= |ULTIMATE.start_f_#in~pointer.offset| ULTIMATE.start_f_~pointer.offset) (= (select .cse23 |~#pp~0.offset|) ULTIMATE.start_main_~a~0.base) .cse10 .cse11 .cse12 (<= 0 |~#pp~0.offset|) .cse14 .cse13 .cse16 .cse17 .cse18 .cse19 (< 0 ULTIMATE.start_init_~i~0) (= (select .cse15 |~#pstate~0.offset|) 1) (= ULTIMATE.start_f_~i~1 0) (= ULTIMATE.start_main_~b~0.offset |ULTIMATE.start_f_#in~pointer.offset|) .cse20 .cse21 .cse22 (= (select .cse23 (+ |~#pp~0.offset| (* ULTIMATE.start_f_~i~1 4))) 0))))) [2020-12-09 19:14:23,717 INFO L258 CegarLoopResult]: At program point L19-3(lines 19 22) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse1 (+ |~#pp~0.offset| 4)) (.cse2 (select |#memory_$Pointer$.base| |~#pp~0.base|))) (and (<= 0 |~#pstate~0.base|) (= |#NULL.base| 0) (= (select .cse0 |~#pp~0.offset|) 0) (= (select .cse0 .cse1) 0) (<= 0 |#t~string4.base|) (= (select .cse2 .cse1) 0) (= |~#pstate~0.offset| 0) (<= 0 |#t~string6.base|) (<= 0 |#t~string5.base|) (= |#t~string5.offset| 0) (<= 0 ULTIMATE.start_init_~i~0) (not (= |~#pp~0.base| |~#pstate~0.base|)) (= ~counter~0 1) (= |#NULL.offset| 0) (= (select .cse2 0) 0) (<= 0 |~#pp~0.base|) (= |#t~string6.offset| 0) (= 0 |#t~string4.offset|) (<= 0 |#StackHeapBarrier|) (= |~#pp~0.offset| 0))) [2020-12-09 19:14:23,717 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 19:14:23,717 INFO L262 CegarLoopResult]: For program point L28(lines 28 32) no Hoare annotation was computed. [2020-12-09 19:14:23,717 INFO L262 CegarLoopResult]: For program point L28-1(lines 28 32) no Hoare annotation was computed. [2020-12-09 19:14:23,717 INFO L265 CegarLoopResult]: At program point L70(lines 53 71) the Hoare annotation is: true [2020-12-09 19:14:23,717 INFO L262 CegarLoopResult]: For program point L38-2(lines 38 44) no Hoare annotation was computed. [2020-12-09 19:14:23,717 INFO L258 CegarLoopResult]: At program point L38-3(lines 38 44) the Hoare annotation is: (let ((.cse37 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse3 (select |#memory_int| |~#pstate~0.base|)) (.cse20 (+ |~#pp~0.offset| 4)) (.cse34 (* 4 ULTIMATE.start_f_~i~1)) (.cse36 (select .cse37 |~#pp~0.offset|))) (let ((.cse16 (= .cse36 ULTIMATE.start_main_~a~0.offset)) (.cse31 (< (+ |~#pstate~0.offset| .cse34) (+ |~#pp~0.offset| 5))) (.cse33 (<= 2 ULTIMATE.start_g_~i~2)) (.cse0 (<= 0 |~#pstate~0.base|)) (.cse1 (= ULTIMATE.start_main_~b~0.base |ULTIMATE.start_malloc_#res.base|)) (.cse2 (= |ULTIMATE.start_malloc_#in~size| 4)) (.cse4 (= ULTIMATE.start_g_~pointer.offset 1)) (.cse5 (= ~counter~0 3)) (.cse6 (<= 0 |#t~string6.base|)) (.cse7 (= ~counter~0 (+ |ULTIMATE.start_malloc_#res.offset| 1))) (.cse8 (<= 0 |#t~string5.base|)) (.cse9 (= |#t~string5.offset| 0)) (.cse10 (= ULTIMATE.start_main_~a~0.base 0)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (<= 0 |~#pp~0.base|)) (.cse13 (= 0 |#t~string4.offset|)) (.cse14 (= 2 ULTIMATE.start_f_~pointer.offset)) (.cse15 (<= 0 |#StackHeapBarrier|)) (.cse32 (= (select .cse3 .cse20) 1)) (.cse17 (= ULTIMATE.start_main_~a~0.offset 1)) (.cse18 (= |#NULL.base| 0)) (.cse19 (<= 2 ULTIMATE.start_init_~i~0)) (.cse35 (= (select .cse3 0) 1)) (.cse21 (= |ULTIMATE.start_malloc_#res.base| 0)) (.cse22 (<= 0 |#t~string4.base|)) (.cse23 (= |ULTIMATE.start_malloc_#in~size| ULTIMATE.start_malloc_~size)) (.cse24 (= |~#pstate~0.offset| 0)) (.cse25 (= |ULTIMATE.start_malloc_#res.offset| ULTIMATE.start_main_~b~0.offset)) (.cse26 (not (= |~#pp~0.base| |~#pstate~0.base|))) (.cse27 (= (+ |~#pstate~0.offset| (* ULTIMATE.start_f_~i~1 4)) .cse20)) (.cse28 (= |#t~string6.offset| 0)) (.cse29 (= (select .cse37 .cse20) 2)) (.cse30 (= |~#pp~0.offset| 0))) (or (and .cse0 .cse1 .cse2 (= (select .cse3 (+ |~#pstate~0.offset| 4)) 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= .cse20 (+ |~#pstate~0.offset| (* 4 ULTIMATE.start_g_~i~2))) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (and .cse0 .cse1 .cse2 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 ULTIMATE.start_f_~i~1) .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse32 .cse33 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse30) (and (<= .cse20 .cse34) .cse0 .cse1 .cse2 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse32 .cse33 .cse17 .cse18 .cse19 .cse35 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse28 .cse30) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse32 .cse17 .cse18 .cse19 .cse35 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (= ULTIMATE.start_g_~i~2 0) (= .cse36 1) .cse30))))) [2020-12-09 19:14:23,717 INFO L262 CegarLoopResult]: For program point L38-6(lines 38 44) no Hoare annotation was computed. [2020-12-09 19:14:23,717 INFO L258 CegarLoopResult]: At program point L38-7(lines 38 44) the Hoare annotation is: (let ((.cse28 (select |#memory_int| |~#pstate~0.base|)) (.cse29 (+ |~#pp~0.offset| 4)) (.cse30 (* 4 ULTIMATE.start_f_~i~1))) (let ((.cse25 (= ULTIMATE.start_g_~i~2 0)) (.cse0 (<= 0 |~#pstate~0.base|)) (.cse1 (= ULTIMATE.start_main_~b~0.base |ULTIMATE.start_malloc_#res.base|)) (.cse27 (<= .cse29 .cse30)) (.cse2 (= |ULTIMATE.start_malloc_#in~size| 4)) (.cse3 (< (+ |~#pstate~0.offset| .cse30) (+ |~#pp~0.offset| 5))) (.cse4 (= ~counter~0 3)) (.cse5 (<= 0 |#t~string6.base|)) (.cse6 (= ~counter~0 (+ |ULTIMATE.start_malloc_#res.offset| 1))) (.cse7 (<= 0 |#t~string5.base|)) (.cse8 (= |#t~string5.offset| 0)) (.cse9 (= ULTIMATE.start_main_~a~0.base 0)) (.cse10 (= |#NULL.offset| 0)) (.cse11 (<= 0 |~#pp~0.base|)) (.cse12 (= 0 |#t~string4.offset|)) (.cse13 (<= 0 |#StackHeapBarrier|)) (.cse14 (= (select .cse28 .cse29) 1)) (.cse15 (= ULTIMATE.start_main_~a~0.offset 1)) (.cse16 (= |#NULL.base| 0)) (.cse17 (<= 2 ULTIMATE.start_init_~i~0)) (.cse18 (= |ULTIMATE.start_malloc_#res.base| 0)) (.cse19 (<= 0 |#t~string4.base|)) (.cse20 (= |ULTIMATE.start_malloc_#in~size| ULTIMATE.start_malloc_~size)) (.cse21 (= |~#pstate~0.offset| 0)) (.cse22 (= |ULTIMATE.start_malloc_#res.offset| ULTIMATE.start_main_~b~0.offset)) (.cse23 (not (= |~#pp~0.base| |~#pstate~0.base|))) (.cse24 (= |#t~string6.offset| 0)) (.cse26 (= |~#pp~0.offset| 0))) (or (and .cse0 .cse1 (<= 2 ULTIMATE.start_g_~pointer.offset) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 1 ULTIMATE.start_f_~i~1) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (= (select (select |#memory_$Pointer$.offset| |~#pp~0.base|) |~#pp~0.offset|) 1) .cse26) (and .cse0 .cse1 .cse27 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 2 ULTIMATE.start_g_~i~2) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse26) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= (select .cse28 0) 1) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= .cse29 (+ |~#pstate~0.offset| (* 4 ULTIMATE.start_g_~i~2))) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse26)))) [2020-12-09 19:14:23,718 INFO L262 CegarLoopResult]: For program point L39(lines 39 43) no Hoare annotation was computed. [2020-12-09 19:14:23,718 INFO L262 CegarLoopResult]: For program point L6(lines 1 71) no Hoare annotation was computed. [2020-12-09 19:14:23,718 INFO L262 CegarLoopResult]: For program point L39-2(lines 39 43) no Hoare annotation was computed. [2020-12-09 19:14:23,718 INFO L262 CegarLoopResult]: For program point L6-1(lines 1 71) no Hoare annotation was computed. [2020-12-09 19:14:23,718 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-12-09 19:14:23,718 INFO L262 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-12-09 19:14:23,718 INFO L262 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-12-09 19:14:23,718 INFO L262 CegarLoopResult]: For program point L41-2(line 41) no Hoare annotation was computed. [2020-12-09 19:14:23,718 INFO L262 CegarLoopResult]: For program point L8-1(line 8) no Hoare annotation was computed. [2020-12-09 19:14:23,718 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 19:14:23,718 INFO L262 CegarLoopResult]: For program point L25(lines 25 34) no Hoare annotation was computed. [2020-12-09 19:14:23,718 INFO L262 CegarLoopResult]: For program point L25-1(lines 25 34) no Hoare annotation was computed. [2020-12-09 19:14:23,718 INFO L262 CegarLoopResult]: For program point L59(lines 59 60) no Hoare annotation was computed. [2020-12-09 19:14:23,725 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,734 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,738 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,738 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,738 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,738 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,739 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,739 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,739 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,739 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,740 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,740 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,740 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,741 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,742 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,742 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,742 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,742 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,743 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,743 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,744 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,744 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,744 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,747 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,747 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,747 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,748 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,748 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,750 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,750 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,750 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,750 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,751 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,751 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,751 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,751 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,752 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,752 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,753 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,753 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,753 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,753 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,753 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,753 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:14:23 BoogieIcfgContainer [2020-12-09 19:14:23,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 19:14:23,756 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 19:14:23,756 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 19:14:23,756 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 19:14:23,756 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:09:40" (3/4) ... [2020-12-09 19:14:23,758 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 19:14:23,765 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2020-12-09 19:14:23,766 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-09 19:14:23,766 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 19:14:23,766 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 19:14:23,782 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((0 <= pstate && b == \result) && \old(size) == 4) && counter == 3) && 0 <= "reach_error") && "ex3_forlist.i" == 0) && 0 <= "ex3_forlist.i") && pstate == pp) && a == 0) && !(i == 1)) && #NULL == 0) && 0 <= pp) && pointer == pointer) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && b == 2) && #NULL == 0) && a == 1) && a == pointer) && #memory_$Pointer$[pp][pp + 4] == 0) && \result == 0) && 0 <= "0") && \old(size) == size) && 0 < i) && #memory_$Pointer$[pp][pp + i * 4] == 0) && i == 0) && #memory_$Pointer$[pp][pp + i * 4 := pointer][pp + 4] == 0) && \result == b) && !(pp == pstate)) && pointer == a) && pp + i * 4 == 0) && "reach_error" == 0) && a == pointer) && #memory_$Pointer$[pp][pp + i * 4] == 0 [2020-12-09 19:14:23,783 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((0 <= pstate && b == \result) && \old(size) == 4) && #memory_$Pointer$[pp][pp + 4] == 0) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && a == 0) && #NULL == 0) && 0 <= pp) && 2 == pointer) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[pp][pp] == a) && b == 2) && a == 1) && #NULL == 0) && 2 <= i) && unknown-#memory_int-unknown[pstate][0] == 1) && #memory_$Pointer$[pp][pp + 4] == 0) && \result == 0) && i < 2) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && 0 < i) && !(pp == pstate)) && "reach_error" == 0) && pp == 0) || (((((((((((((((((((((((((((((((((((0 <= pstate && b == \result) && pp <= 0) && \old(size) == 4) && #memory_$Pointer$[pp][pp + 4] == 0) && counter == 3) && 0 <= "reach_error") && "ex3_forlist.i" == 0) && 0 <= "ex3_forlist.i") && pstate == pp) && !(i == 1)) && pointer == b) && #NULL == 0) && 0 <= pp) && pointer == pointer) && 0 == "0") && pointer == pointer) && #memory_$Pointer$[pp][pp] == a) && 0 <= unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[pp][pp] == a) && b == 2) && 0 <= pp) && #NULL == 0) && a == 1) && #memory_$Pointer$[pp][pp + 4] == 0) && \result == 0) && 0 <= "0") && \old(size) == size) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate] == 1) && i == 0) && b == pointer) && \result == b) && !(pp == pstate)) && "reach_error" == 0) && #memory_$Pointer$[pp][pp + i * 4] == 0) [2020-12-09 19:14:23,783 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((0 <= pstate && b == \result) && \old(size) == 4) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && pointer == 1) && counter == 3) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && a == 0) && #NULL == 0) && 0 <= pp) && 0 == "0") && 2 == pointer) && 0 <= unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[pp][pp] == a) && a == 1) && #NULL == 0) && 2 <= i) && pp + 4 <= pstate + 4 * i) && \result == 0) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && !(pp == pstate)) && pstate + i * 4 == pp + 4) && "reach_error" == 0) && #memory_$Pointer$[pp][pp + 4] == 2) && pp == 0) || ((((((((((((((((((((((((((((0 <= pstate && b == \result) && \old(size) == 4) && pstate + 4 * i < pp + 5) && counter == 3) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && 1 <= i) && a == 0) && #NULL == 0) && 0 <= pp) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[pp][pp] == a) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && 2 <= i) && a == 1) && #NULL == 0) && 2 <= i) && \result == 0) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && !(pp == pstate)) && "reach_error" == 0) && pp == 0)) || ((((((((((((((((((((((((((((pp + 4 <= 4 * i && 0 <= pstate) && b == \result) && \old(size) == 4) && pstate + 4 * i < pp + 5) && counter == 3) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && a == 0) && #NULL == 0) && 0 <= pp) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && 2 <= i) && a == 1) && #NULL == 0) && 2 <= i) && unknown-#memory_int-unknown[pstate][0] == 1) && \result == 0) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && !(pp == pstate)) && "reach_error" == 0) && pp == 0)) || (((((((((((((((((((((((((((((((0 <= pstate && b == \result) && \old(size) == 4) && pointer == 1) && counter == 3) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && a == 0) && #NULL == 0) && 0 <= pp) && 0 == "0") && 2 == pointer) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && a == 1) && #NULL == 0) && 2 <= i) && unknown-#memory_int-unknown[pstate][0] == 1) && \result == 0) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && !(pp == pstate)) && pstate + i * 4 == pp + 4) && "reach_error" == 0) && #memory_$Pointer$[pp][pp + 4] == 2) && i == 0) && #memory_$Pointer$[pp][pp] == 1) && pp == 0) [2020-12-09 19:14:23,783 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((0 <= pstate && b == \result) && 2 <= pointer) && \old(size) == 4) && pstate + 4 * i < pp + 5) && counter == 3) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && a == 0) && 1 <= i) && #NULL == 0) && 0 <= pp) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && a == 1) && #NULL == 0) && 2 <= i) && \result == 0) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && !(pp == pstate)) && "reach_error" == 0) && i == 0) && #memory_$Pointer$[pp][pp] == 1) && pp == 0) || (((((((((((((((((((((((((0 <= pstate && b == \result) && pp + 4 <= 4 * i) && \old(size) == 4) && counter == 3) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && a == 0) && #NULL == 0) && 0 <= pp) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= i) && a == 1) && #NULL == 0) && 2 <= i) && \result == 0) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && !(pp == pstate)) && "reach_error" == 0) && pp == 0)) || ((((((((((((((((((((((((((((0 <= pstate && b == \result) && pp + 4 <= 4 * i) && \old(size) == 4) && pstate + 4 * i < pp + 5) && counter == 3) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && a == 0) && #NULL == 0) && 0 <= pp) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && a == 1) && #NULL == 0) && 2 <= i) && unknown-#memory_int-unknown[pstate][0] == 1) && \result == 0) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && !(pp == pstate)) && "reach_error" == 0) && i == 0) && pp == 0)) || (((((((((((((((((((((((((((0 <= pstate && b == \result) && pp + 4 <= 4 * i) && \old(size) == 4) && pstate + 4 * i < pp + 5) && counter == 3) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && a == 0) && #NULL == 0) && 0 <= pp) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && a == 1) && #NULL == 0) && 2 <= i) && pp + 4 <= pstate + 4 * i) && \result == 0) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && !(pp == pstate)) && "reach_error" == 0) && pp == 0) [2020-12-09 19:14:23,793 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6c438a93-f101-49f6-ab5f-bca4c945f18b/bin/utaipan/witness.graphml [2020-12-09 19:14:23,793 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 19:14:23,794 INFO L168 Benchmark]: Toolchain (without parser) took 284415.52 ms. Allocated memory was 102.8 MB in the beginning and 740.3 MB in the end (delta: 637.5 MB). Free memory was 61.4 MB in the beginning and 496.5 MB in the end (delta: -435.1 MB). Peak memory consumption was 204.1 MB. Max. memory is 16.1 GB. [2020-12-09 19:14:23,794 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 102.8 MB. Free memory is still 77.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:14:23,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.05 ms. Allocated memory is still 102.8 MB. Free memory was 61.3 MB in the beginning and 79.3 MB in the end (delta: -18.0 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. [2020-12-09 19:14:23,794 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.84 ms. Allocated memory is still 102.8 MB. Free memory was 79.3 MB in the beginning and 77.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 19:14:23,794 INFO L168 Benchmark]: Boogie Preprocessor took 31.79 ms. Allocated memory is still 102.8 MB. Free memory was 77.5 MB in the beginning and 75.8 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:14:23,794 INFO L168 Benchmark]: RCFGBuilder took 418.15 ms. Allocated memory is still 102.8 MB. Free memory was 75.8 MB in the beginning and 58.0 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-09 19:14:23,794 INFO L168 Benchmark]: TraceAbstraction took 283701.11 ms. Allocated memory was 102.8 MB in the beginning and 740.3 MB in the end (delta: 637.5 MB). Free memory was 57.6 MB in the beginning and 499.7 MB in the end (delta: -442.1 MB). Peak memory consumption was 428.4 MB. Max. memory is 16.1 GB. [2020-12-09 19:14:23,794 INFO L168 Benchmark]: Witness Printer took 37.42 ms. Allocated memory is still 740.3 MB. Free memory was 499.7 MB in the beginning and 496.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 19:14:23,795 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 102.8 MB. Free memory is still 77.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 185.05 ms. Allocated memory is still 102.8 MB. Free memory was 61.3 MB in the beginning and 79.3 MB in the end (delta: -18.0 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 36.84 ms. Allocated memory is still 102.8 MB. Free memory was 79.3 MB in the beginning and 77.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.79 ms. Allocated memory is still 102.8 MB. Free memory was 77.5 MB in the beginning and 75.8 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 418.15 ms. Allocated memory is still 102.8 MB. Free memory was 75.8 MB in the beginning and 58.0 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 283701.11 ms. Allocated memory was 102.8 MB in the beginning and 740.3 MB in the end (delta: 637.5 MB). Free memory was 57.6 MB in the beginning and 499.7 MB in the end (delta: -442.1 MB). Peak memory consumption was 428.4 MB. Max. memory is 16.1 GB. * Witness Printer took 37.42 ms. Allocated memory is still 740.3 MB. Free memory was 499.7 MB in the beginning and 496.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 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$.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$.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$.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$.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$.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$.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$.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$.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$.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$.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 8]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant [2020-12-09 19:14:23,797 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,799 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((0 <= pstate && b == \result) && 2 <= pointer) && \old(size) == 4) && pstate + 4 * i < pp + 5) && counter == 3) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && a == 0) && 1 <= i) && #NULL == 0) && 0 <= pp) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && a == 1) && #NULL == 0) && 2 <= i) && \result == 0) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && !(pp == pstate)) && "reach_error" == 0) && i == 0) && #memory_$Pointer$[pp][pp] == 1) && pp == 0) || (((((((((((((((((((((((((0 <= pstate && b == \result) && pp + 4 <= 4 * i) && \old(size) == 4) && counter == 3) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && a == 0) && #NULL == 0) && 0 <= pp) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= i) && a == 1) && #NULL == 0) && 2 <= i) && \result == 0) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && !(pp == pstate)) && "reach_error" == 0) && pp == 0)) || ((((((((((((((((((((((((((((0 <= pstate && b == \result) && pp + 4 <= 4 * i) && \old(size) == 4) && pstate + 4 * i < pp + 5) && counter == 3) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && a == 0) && #NULL == 0) && 0 <= pp) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && a == 1) && #NULL == 0) && 2 <= i) && unknown-#memory_int-unknown[pstate][0] == 1) && \result == 0) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && !(pp == pstate)) && "reach_error" == 0) && i == 0) && pp == 0)) || (((((((((((((((((((((((((((0 <= pstate && b == \result) && pp + 4 <= 4 * i) && \old(size) == 4) && pstate + 4 * i < pp + 5) && counter == 3) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && a == 0) && #NULL == 0) && 0 <= pp) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && a == 1) && #NULL == 0) && 2 <= i) && pp + 4 <= pstate + 4 * i) && \result == 0) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && !(pp == pstate)) && "reach_error" == 0) && pp == 0) - InvariantResult [Line: 19]: Loop Invariant [2020-12-09 19:14:23,801 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,801 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,801 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,801 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,801 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,801 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,802 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,802 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((0 <= pstate && #NULL == 0) && #memory_$Pointer$[pp][pp] == 0) && #memory_$Pointer$[pp][pp + 4] == 0) && 0 <= "0") && #memory_$Pointer$[pp][pp + 4] == 0) && pstate == 0) && 0 <= "reach_error") && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && 0 <= i) && !(pp == pstate)) && counter == 1) && #NULL == 0) && #memory_$Pointer$[pp][0] == 0) && 0 <= pp) && "reach_error" == 0) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && pp == 0 - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant [2020-12-09 19:14:23,802 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,802 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,802 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,802 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,803 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,803 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,803 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,803 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((0 <= pstate && b == \result) && \old(size) == 4) && counter == 3) && 0 <= "reach_error") && "ex3_forlist.i" == 0) && 0 <= "ex3_forlist.i") && pstate == pp) && a == 0) && !(i == 1)) && #NULL == 0) && 0 <= pp) && pointer == pointer) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && b == 2) && #NULL == 0) && a == 1) && a == pointer) && #memory_$Pointer$[pp][pp + 4] == 0) && \result == 0) && 0 <= "0") && \old(size) == size) && 0 < i) && #memory_$Pointer$[pp][pp + i * 4] == 0) && i == 0) && #memory_$Pointer$[pp][pp + i * 4 := pointer][pp + 4] == 0) && \result == b) && !(pp == pstate)) && pointer == a) && pp + i * 4 == 0) && "reach_error" == 0) && a == pointer) && #memory_$Pointer$[pp][pp + i * 4] == 0 - InvariantResult [Line: 38]: Loop Invariant [2020-12-09 19:14:23,804 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,804 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,804 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,805 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,805 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,806 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,806 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,806 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,806 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,806 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((0 <= pstate && b == \result) && \old(size) == 4) && unknown-#memory_int-unknown[pstate][pstate + 4] == 1) && pointer == 1) && counter == 3) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && a == 0) && #NULL == 0) && 0 <= pp) && 0 == "0") && 2 == pointer) && 0 <= unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[pp][pp] == a) && a == 1) && #NULL == 0) && 2 <= i) && pp + 4 <= pstate + 4 * i) && \result == 0) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && !(pp == pstate)) && pstate + i * 4 == pp + 4) && "reach_error" == 0) && #memory_$Pointer$[pp][pp + 4] == 2) && pp == 0) || ((((((((((((((((((((((((((((0 <= pstate && b == \result) && \old(size) == 4) && pstate + 4 * i < pp + 5) && counter == 3) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && 1 <= i) && a == 0) && #NULL == 0) && 0 <= pp) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[pp][pp] == a) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && 2 <= i) && a == 1) && #NULL == 0) && 2 <= i) && \result == 0) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && !(pp == pstate)) && "reach_error" == 0) && pp == 0)) || ((((((((((((((((((((((((((((pp + 4 <= 4 * i && 0 <= pstate) && b == \result) && \old(size) == 4) && pstate + 4 * i < pp + 5) && counter == 3) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && a == 0) && #NULL == 0) && 0 <= pp) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && 2 <= i) && a == 1) && #NULL == 0) && 2 <= i) && unknown-#memory_int-unknown[pstate][0] == 1) && \result == 0) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && !(pp == pstate)) && "reach_error" == 0) && pp == 0)) || (((((((((((((((((((((((((((((((0 <= pstate && b == \result) && \old(size) == 4) && pointer == 1) && counter == 3) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && a == 0) && #NULL == 0) && 0 <= pp) && 0 == "0") && 2 == pointer) && 0 <= unknown-#StackHeapBarrier-unknown) && unknown-#memory_int-unknown[pstate][pp + 4] == 1) && a == 1) && #NULL == 0) && 2 <= i) && unknown-#memory_int-unknown[pstate][0] == 1) && \result == 0) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && !(pp == pstate)) && pstate + i * 4 == pp + 4) && "reach_error" == 0) && #memory_$Pointer$[pp][pp + 4] == 2) && i == 0) && #memory_$Pointer$[pp][pp] == 1) && pp == 0) - InvariantResult [Line: 27]: Loop Invariant [2020-12-09 19:14:23,807 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,808 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,808 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,808 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,808 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,808 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,808 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,808 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,809 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,809 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,809 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,809 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,810 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-09 19:14:23,810 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,810 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-09 19:14:23,810 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((0 <= pstate && b == \result) && \old(size) == 4) && #memory_$Pointer$[pp][pp + 4] == 0) && 0 <= "reach_error") && counter == \result + 1) && 0 <= "ex3_forlist.i") && "ex3_forlist.i" == 0) && a == 0) && #NULL == 0) && 0 <= pp) && 2 == pointer) && 0 == "0") && 0 <= unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[pp][pp] == a) && b == 2) && a == 1) && #NULL == 0) && 2 <= i) && unknown-#memory_int-unknown[pstate][0] == 1) && #memory_$Pointer$[pp][pp + 4] == 0) && \result == 0) && i < 2) && 0 <= "0") && \old(size) == size) && pstate == 0) && \result == b) && 0 < i) && !(pp == pstate)) && "reach_error" == 0) && pp == 0) || (((((((((((((((((((((((((((((((((((0 <= pstate && b == \result) && pp <= 0) && \old(size) == 4) && #memory_$Pointer$[pp][pp + 4] == 0) && counter == 3) && 0 <= "reach_error") && "ex3_forlist.i" == 0) && 0 <= "ex3_forlist.i") && pstate == pp) && !(i == 1)) && pointer == b) && #NULL == 0) && 0 <= pp) && pointer == pointer) && 0 == "0") && pointer == pointer) && #memory_$Pointer$[pp][pp] == a) && 0 <= unknown-#StackHeapBarrier-unknown) && #memory_$Pointer$[pp][pp] == a) && b == 2) && 0 <= pp) && #NULL == 0) && a == 1) && #memory_$Pointer$[pp][pp + 4] == 0) && \result == 0) && 0 <= "0") && \old(size) == size) && 0 < i) && unknown-#memory_int-unknown[pstate][pstate] == 1) && i == 0) && b == pointer) && \result == b) && !(pp == pstate)) && "reach_error" == 0) && #memory_$Pointer$[pp][pp + i * 4] == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 136.5s, OverallIterations: 14, TraceHistogramMax: 3, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 147.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 303 SDtfs, 923 SDslu, 1347 SDs, 0 SdLazy, 2233 SolverSat, 328 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 793 GetRequests, 395 SyntacticMatches, 19 SemanticMatches, 379 ConstructedPredicates, 29 IntricatePredicates, 0 DeprecatedPredicates, 3924 ImplicationChecksByTransitivity, 100.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 181 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 22 NumberOfFragments, 1376 HoareAnnotationTreeSize, 6 FomulaSimplifications, 21895 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 6 FomulaSimplificationsInter, 4293 FormulaSimplificationTreeSizeReductionInter, 146.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 66.6s InterpolantComputationTime, 503 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 694 ConstructedInterpolants, 50 QuantifiedInterpolants, 205282 SizeOfPredicates, 130 NumberOfNonLiveVariables, 1957 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 36 InterpolantComputations, 9 PerfectInterpolantSequences, 150/261 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME[ms]: 1257, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 13, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 15, TOOLS_POST_TIME[ms]: 1061, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 15, TOOLS_QUANTIFIERELIM_TIME[ms]: 1055, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 488, FLUID_QUERY_TIME[ms]: 2, FLUID_QUERIES: 35, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 0, DOMAIN_JOIN_TIME[ms]: 0, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 2, DOMAIN_WIDEN_TIME[ms]: 133, DOMAIN_ISSUBSETEQ_APPLICATIONS: 3, DOMAIN_ISSUBSETEQ_TIME[ms]: 10, DOMAIN_ISBOTTOM_APPLICATIONS: 13, DOMAIN_ISBOTTOM_TIME[ms]: 18, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 820, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 819, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 3, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 1, PATH_EXPR_TIME[ms]: 2, REGEX_TO_DAG_TIME[ms]: 2, DAG_COMPRESSION_TIME[ms]: 7, DAG_COMPRESSION_PROCESSED_NODES: 126, DAG_COMPRESSION_RETAINED_NODES: 34, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...