./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7 --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 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 18:49:06,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 18:49:06,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 18:49:06,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 18:49:06,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 18:49:06,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 18:49:06,727 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 18:49:06,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 18:49:06,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 18:49:06,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 18:49:06,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 18:49:06,736 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 18:49:06,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 18:49:06,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 18:49:06,740 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 18:49:06,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 18:49:06,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 18:49:06,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 18:49:06,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 18:49:06,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 18:49:06,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 18:49:06,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 18:49:06,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 18:49:06,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 18:49:06,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 18:49:06,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 18:49:06,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 18:49:06,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 18:49:06,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 18:49:06,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 18:49:06,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 18:49:06,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 18:49:06,767 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 18:49:06,768 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 18:49:06,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 18:49:06,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 18:49:06,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 18:49:06,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 18:49:06,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 18:49:06,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 18:49:06,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 18:49:06,775 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 18:49:06,800 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 18:49:06,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 18:49:06,801 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 18:49:06,802 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 18:49:06,803 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 18:49:06,803 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 18:49:06,804 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 18:49:06,804 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 18:49:06,805 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 18:49:06,805 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 18:49:06,805 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 18:49:06,806 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 18:49:06,806 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 18:49:06,807 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 18:49:06,807 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 18:49:06,808 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 18:49:06,808 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 18:49:06,809 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 18:49:06,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 18:49:06,810 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 18:49:06,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 18:49:06,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 18:49:06,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 18:49:06,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 18:49:06,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 18:49:06,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 18:49:06,813 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 18:49:06,814 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 18:49:06,814 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 18:49:06,814 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 18:49:06,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 18:49:06,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 18:49:06,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:49:06,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 18:49:06,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 18:49:06,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 18:49:06,817 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 18:49:06,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 18:49:06,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 18:49:06,818 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 18:49:06,818 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 18:49:06,818 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_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/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_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7 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 -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2021-11-25 18:49:07,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 18:49:07,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 18:49:07,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 18:49:07,125 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 18:49:07,126 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 18:49:07,127 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-11-25 18:49:07,223 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/data/12af241d5/eccbb6e98080490282ba391fb209643f/FLAG97e48b744 [2021-11-25 18:49:07,785 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 18:49:07,793 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2021-11-25 18:49:07,807 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/data/12af241d5/eccbb6e98080490282ba391fb209643f/FLAG97e48b744 [2021-11-25 18:49:08,110 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/data/12af241d5/eccbb6e98080490282ba391fb209643f [2021-11-25 18:49:08,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 18:49:08,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 18:49:08,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 18:49:08,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 18:49:08,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 18:49:08,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:49:08" (1/1) ... [2021-11-25 18:49:08,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a976fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:49:08, skipping insertion in model container [2021-11-25 18:49:08,125 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:49:08" (1/1) ... [2021-11-25 18:49:08,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 18:49:08,175 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 18:49:08,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2021-11-25 18:49:08,537 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:49:08,553 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 18:49:08,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2021-11-25 18:49:08,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 18:49:08,663 INFO L208 MainTranslator]: Completed translation [2021-11-25 18:49:08,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:49:08 WrapperNode [2021-11-25 18:49:08,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 18:49:08,665 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 18:49:08,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 18:49:08,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 18:49:08,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:49:08" (1/1) ... [2021-11-25 18:49:08,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:49:08" (1/1) ... [2021-11-25 18:49:08,744 INFO L137 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2021-11-25 18:49:08,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 18:49:08,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 18:49:08,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 18:49:08,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 18:49:08,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:49:08" (1/1) ... [2021-11-25 18:49:08,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:49:08" (1/1) ... [2021-11-25 18:49:08,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:49:08" (1/1) ... [2021-11-25 18:49:08,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:49:08" (1/1) ... [2021-11-25 18:49:08,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:49:08" (1/1) ... [2021-11-25 18:49:08,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:49:08" (1/1) ... [2021-11-25 18:49:08,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:49:08" (1/1) ... [2021-11-25 18:49:08,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 18:49:08,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 18:49:08,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 18:49:08,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 18:49:08,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:49:08" (1/1) ... [2021-11-25 18:49:08,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 18:49:08,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:49:08,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 18:49:08,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 18:49:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 18:49:08,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 18:49:08,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-25 18:49:08,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 18:49:08,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-25 18:49:08,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-25 18:49:08,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 18:49:08,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 18:49:08,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 18:49:08,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 18:49:09,019 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 18:49:09,021 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 18:49:09,239 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 18:49:09,314 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 18:49:09,315 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-11-25 18:49:09,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:49:09 BoogieIcfgContainer [2021-11-25 18:49:09,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 18:49:09,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 18:49:09,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 18:49:09,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 18:49:09,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:49:08" (1/3) ... [2021-11-25 18:49:09,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338c72ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:49:09, skipping insertion in model container [2021-11-25 18:49:09,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:49:08" (2/3) ... [2021-11-25 18:49:09,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338c72ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:49:09, skipping insertion in model container [2021-11-25 18:49:09,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:49:09" (3/3) ... [2021-11-25 18:49:09,326 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2021-11-25 18:49:09,332 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 18:49:09,332 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-25 18:49:09,392 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 18:49:09,399 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 18:49:09,400 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-25 18:49:09,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:09,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-25 18:49:09,431 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:49:09,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:49:09,432 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:49:09,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:49:09,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1963659983, now seen corresponding path program 1 times [2021-11-25 18:49:09,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:49:09,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097714483] [2021-11-25 18:49:09,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:09,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:49:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:49:09,647 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:49:09,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097714483] [2021-11-25 18:49:09,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097714483] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:49:09,648 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:49:09,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 18:49:09,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478810695] [2021-11-25 18:49:09,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:49:09,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 18:49:09,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:49:09,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 18:49:09,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:49:09,688 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:09,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:49:09,761 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2021-11-25 18:49:09,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 18:49:09,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-25 18:49:09,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:49:09,771 INFO L225 Difference]: With dead ends: 27 [2021-11-25 18:49:09,771 INFO L226 Difference]: Without dead ends: 12 [2021-11-25 18:49:09,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 18:49:09,780 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:49:09,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 16 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:49:09,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-25 18:49:09,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2021-11-25 18:49:09,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2021-11-25 18:49:09,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2021-11-25 18:49:09,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:49:09,821 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2021-11-25 18:49:09,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:09,824 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2021-11-25 18:49:09,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-25 18:49:09,825 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:49:09,825 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:49:09,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 18:49:09,826 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:49:09,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:49:09,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1491156930, now seen corresponding path program 1 times [2021-11-25 18:49:09,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:49:09,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118904909] [2021-11-25 18:49:09,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:09,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:49:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:49:09,946 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:49:09,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118904909] [2021-11-25 18:49:09,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118904909] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:49:09,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762491499] [2021-11-25 18:49:09,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:09,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:09,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:49:09,949 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:49:09,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 18:49:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:10,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-25 18:49:10,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:49:10,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:49:10,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:49:10,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:49:10,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762491499] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:49:10,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [452095593] [2021-11-25 18:49:10,225 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2021-11-25 18:49:10,226 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:49:10,229 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:49:10,234 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:49:10,234 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:49:10,379 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-11-25 18:49:10,380 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2021-11-25 18:49:10,457 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-25 18:49:10,458 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2021-11-25 18:49:10,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:10,583 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:10,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:10,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:10,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:10,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:10,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2021-11-25 18:49:10,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:10,660 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:10,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:10,945 INFO L354 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2021-11-25 18:49:10,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2021-11-25 18:49:11,013 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-25 18:49:11,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2021-11-25 18:49:11,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:11,546 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:11,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 238 [2021-11-25 18:49:11,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:11,603 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 18:49:11,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 204 [2021-11-25 18:49:11,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:11,714 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:11,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 232 [2021-11-25 18:49:11,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:11,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:11,765 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-25 18:49:11,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 209 [2021-11-25 18:49:11,794 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:11,829 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:11,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2021-11-25 18:49:11,855 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:11,888 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:11,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2021-11-25 18:49:12,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:12,201 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:12,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:12,244 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:12,245 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:12,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:12,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:12,266 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:12,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2021-11-25 18:49:12,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:12,289 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:12,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:12,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:12,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:12,363 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:49:12,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [452095593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:49:12,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:49:12,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 3, 3] total 7 [2021-11-25 18:49:12,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411007973] [2021-11-25 18:49:12,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:49:12,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:49:12,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:49:12,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:49:12,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:49:12,609 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:12,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:49:12,675 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2021-11-25 18:49:12,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:49:12,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-25 18:49:12,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:49:12,677 INFO L225 Difference]: With dead ends: 18 [2021-11-25 18:49:12,677 INFO L226 Difference]: Without dead ends: 13 [2021-11-25 18:49:12,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:49:12,679 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:49:12,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 12 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:49:12,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-25 18:49:12,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2021-11-25 18:49:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2021-11-25 18:49:12,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2021-11-25 18:49:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:49:12,685 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-11-25 18:49:12,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2021-11-25 18:49:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-25 18:49:12,686 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:49:12,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:49:12,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 18:49:12,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:12,902 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:49:12,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:49:12,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1766738179, now seen corresponding path program 1 times [2021-11-25 18:49:12,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:49:12,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154387039] [2021-11-25 18:49:12,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:12,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:49:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:49:12,988 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:49:12,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154387039] [2021-11-25 18:49:12,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154387039] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:49:12,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297791762] [2021-11-25 18:49:12,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:12,992 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:12,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:49:12,999 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:49:13,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 18:49:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:13,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-25 18:49:13,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:49:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:49:13,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:49:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:49:13,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297791762] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:49:13,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1741908050] [2021-11-25 18:49:13,156 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-25 18:49:13,156 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:49:13,156 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:49:13,157 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:49:13,157 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:49:13,218 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-25 18:49:13,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2021-11-25 18:49:13,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-25 18:49:13,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:13,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:13,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:13,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2021-11-25 18:49:13,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:13,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2021-11-25 18:49:13,303 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:13,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2021-11-25 18:49:13,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:13,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2021-11-25 18:49:13,333 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:13,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2021-11-25 18:49:13,466 INFO L354 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2021-11-25 18:49:13,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2021-11-25 18:49:13,507 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-25 18:49:13,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2021-11-25 18:49:13,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:13,924 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:13,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 238 [2021-11-25 18:49:13,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:13,962 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 18:49:13,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 204 [2021-11-25 18:49:13,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:14,055 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:14,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 232 [2021-11-25 18:49:14,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:14,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:14,099 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-25 18:49:14,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 209 [2021-11-25 18:49:14,133 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:14,162 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:14,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2021-11-25 18:49:14,186 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:14,206 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:14,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2021-11-25 18:49:14,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:14,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:14,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:14,419 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:14,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:14,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:14,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:14,436 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:14,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:14,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:14,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:14,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2021-11-25 18:49:14,509 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:14,515 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:14,518 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:14,554 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:14,558 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:14,563 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:14,593 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:14,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:14,605 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:49:14,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1741908050] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:49:14,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:49:14,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3, 3, 3] total 8 [2021-11-25 18:49:14,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391470247] [2021-11-25 18:49:14,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:49:14,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 18:49:14,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:49:14,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 18:49:14,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-25 18:49:14,976 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:15,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:49:15,054 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2021-11-25 18:49:15,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 18:49:15,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-25 18:49:15,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:49:15,055 INFO L225 Difference]: With dead ends: 21 [2021-11-25 18:49:15,055 INFO L226 Difference]: Without dead ends: 14 [2021-11-25 18:49:15,055 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-11-25 18:49:15,056 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 16 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:49:15,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 13 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:49:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-25 18:49:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2021-11-25 18:49:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2021-11-25 18:49:15,062 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 11 [2021-11-25 18:49:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:49:15,063 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2021-11-25 18:49:15,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2021-11-25 18:49:15,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-25 18:49:15,064 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:49:15,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:49:15,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 18:49:15,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:15,265 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:49:15,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:49:15,265 INFO L85 PathProgramCache]: Analyzing trace with hash 446479962, now seen corresponding path program 1 times [2021-11-25 18:49:15,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:49:15,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834657235] [2021-11-25 18:49:15,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:15,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:49:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:49:15,348 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:49:15,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834657235] [2021-11-25 18:49:15,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834657235] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:49:15,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397330358] [2021-11-25 18:49:15,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:15,349 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:15,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:49:15,354 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:49:15,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 18:49:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:15,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-25 18:49:15,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:49:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:49:15,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:49:15,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-25 18:49:15,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397330358] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:49:15,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1420994692] [2021-11-25 18:49:15,518 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-25 18:49:15,519 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:49:15,519 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:49:15,519 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:49:15,519 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:49:15,572 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-25 18:49:15,572 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2021-11-25 18:49:15,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2021-11-25 18:49:15,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:15,628 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:15,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:15,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:15,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:15,648 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:15,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2021-11-25 18:49:15,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:15,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2021-11-25 18:49:15,681 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:15,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2021-11-25 18:49:15,824 INFO L354 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2021-11-25 18:49:15,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2021-11-25 18:49:15,866 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-25 18:49:15,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2021-11-25 18:49:16,164 INFO L354 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2021-11-25 18:49:16,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 220 [2021-11-25 18:49:16,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:16,281 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:16,282 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 234 [2021-11-25 18:49:16,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:16,377 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:16,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 228 [2021-11-25 18:49:16,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:16,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:16,456 INFO L354 Elim1Store]: treesize reduction 74, result has 24.5 percent of original size [2021-11-25 18:49:16,457 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 245 treesize of output 235 [2021-11-25 18:49:16,497 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:16,518 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:16,518 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2021-11-25 18:49:16,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:16,567 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:16,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2021-11-25 18:49:16,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:16,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:16,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:16,796 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:16,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2021-11-25 18:49:16,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:16,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:16,816 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:16,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:16,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:16,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:16,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:16,900 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:16,904 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:16,908 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:16,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:16,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:17,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:17,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:17,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:17,191 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:17,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:17,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:17,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:17,396 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:17,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:17,408 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:49:17,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSifa [1420994692] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:49:17,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:49:17,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 10 [2021-11-25 18:49:17,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965692670] [2021-11-25 18:49:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:49:17,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 18:49:17,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:49:17,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 18:49:17,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-11-25 18:49:17,928 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:18,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:49:18,288 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2021-11-25 18:49:18,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-25 18:49:18,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-25 18:49:18,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:49:18,290 INFO L225 Difference]: With dead ends: 25 [2021-11-25 18:49:18,290 INFO L226 Difference]: Without dead ends: 20 [2021-11-25 18:49:18,290 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:49:18,291 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:49:18,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 8 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:49:18,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-25 18:49:18,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2021-11-25 18:49:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2021-11-25 18:49:18,308 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 12 [2021-11-25 18:49:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:49:18,308 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2021-11-25 18:49:18,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:18,309 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2021-11-25 18:49:18,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-25 18:49:18,309 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:49:18,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:49:18,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 18:49:18,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:18,522 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:49:18,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:49:18,523 INFO L85 PathProgramCache]: Analyzing trace with hash 954324368, now seen corresponding path program 1 times [2021-11-25 18:49:18,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:49:18,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97717652] [2021-11-25 18:49:18,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:18,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:49:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:49:18,582 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:49:18,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97717652] [2021-11-25 18:49:18,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97717652] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:49:18,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256714046] [2021-11-25 18:49:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:18,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:18,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:49:18,584 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:49:18,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 18:49:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:18,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-25 18:49:18,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:49:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:49:18,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:49:18,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-11-25 18:49:18,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256714046] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:49:18,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [222231668] [2021-11-25 18:49:18,752 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-25 18:49:18,752 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:49:18,752 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:49:18,753 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:49:18,753 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:49:18,801 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-11-25 18:49:18,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2021-11-25 18:49:18,843 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-25 18:49:18,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2021-11-25 18:49:18,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:18,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2021-11-25 18:49:18,894 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:18,895 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2021-11-25 18:49:18,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:18,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:18,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:18,917 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2021-11-25 18:49:18,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:18,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:18,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:19,056 INFO L354 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2021-11-25 18:49:19,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2021-11-25 18:49:19,092 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-25 18:49:19,093 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2021-11-25 18:49:19,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:19,312 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 18:49:19,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 228 treesize of output 210 [2021-11-25 18:49:19,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:19,415 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:19,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 238 [2021-11-25 18:49:19,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:19,505 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:19,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 232 [2021-11-25 18:49:19,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:19,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:19,541 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-25 18:49:19,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 232 treesize of output 209 [2021-11-25 18:49:19,562 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:19,577 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:19,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2021-11-25 18:49:19,599 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:19,629 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:19,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2021-11-25 18:49:19,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:19,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:19,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:19,833 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:19,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:19,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:19,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:19,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2021-11-25 18:49:19,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:19,866 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:19,867 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:19,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:19,921 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:19,926 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:19,929 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:20,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:20,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:20,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:20,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:20,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:20,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:20,229 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:20,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:20,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:20,381 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:20,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:20,389 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:49:20,943 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '551#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2021-11-25 18:49:20,944 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:49:20,944 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:49:20,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2021-11-25 18:49:20,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451782439] [2021-11-25 18:49:20,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:49:20,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-25 18:49:20,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:49:20,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-25 18:49:20,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:49:20,945 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:49:20,977 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2021-11-25 18:49:20,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-25 18:49:20,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-25 18:49:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:49:20,978 INFO L225 Difference]: With dead ends: 28 [2021-11-25 18:49:20,979 INFO L226 Difference]: Without dead ends: 17 [2021-11-25 18:49:20,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-11-25 18:49:20,980 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:49:20,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 12 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:49:20,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-25 18:49:20,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-25 18:49:20,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2021-11-25 18:49:20,987 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2021-11-25 18:49:20,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:49:20,987 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2021-11-25 18:49:20,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2021-11-25 18:49:20,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 18:49:20,988 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:49:20,988 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:49:21,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 18:49:21,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:21,215 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:49:21,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:49:21,215 INFO L85 PathProgramCache]: Analyzing trace with hash -694979649, now seen corresponding path program 2 times [2021-11-25 18:49:21,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:49:21,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139351531] [2021-11-25 18:49:21,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:21,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:49:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:49:21,309 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:49:21,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139351531] [2021-11-25 18:49:21,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139351531] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:49:21,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893136625] [2021-11-25 18:49:21,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:49:21,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:21,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:49:21,318 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:49:21,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 18:49:21,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:49:21,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:49:21,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-25 18:49:21,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:49:21,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:49:21,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:49:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:49:21,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893136625] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:49:21,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [495597181] [2021-11-25 18:49:21,496 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-25 18:49:21,496 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:49:21,497 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:49:21,497 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:49:21,497 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:49:21,540 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-11-25 18:49:21,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2021-11-25 18:49:21,585 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-25 18:49:21,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2021-11-25 18:49:21,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:21,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2021-11-25 18:49:21,632 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:21,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2021-11-25 18:49:21,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:21,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:21,650 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:21,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2021-11-25 18:49:21,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:21,677 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:21,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:21,818 INFO L354 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2021-11-25 18:49:21,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2021-11-25 18:49:21,866 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-25 18:49:21,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2021-11-25 18:49:22,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:22,191 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 18:49:22,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 314 treesize of output 288 [2021-11-25 18:49:22,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:22,295 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:22,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 308 treesize of output 317 [2021-11-25 18:49:22,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:22,391 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:22,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 337 treesize of output 346 [2021-11-25 18:49:22,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:22,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:22,432 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-25 18:49:22,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 381 treesize of output 366 [2021-11-25 18:49:22,452 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:22,477 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:22,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 379 treesize of output 372 [2021-11-25 18:49:22,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:22,530 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:22,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 385 treesize of output 378 [2021-11-25 18:49:22,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:22,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:22,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:22,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:22,928 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:22,929 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:22,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:22,948 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:22,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:22,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:22,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:22,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2021-11-25 18:49:23,013 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:23,016 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:23,019 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:23,100 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:23,107 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:23,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:23,222 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:23,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:23,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:23,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:23,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:23,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:23,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:23,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:23,529 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:49:24,486 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '733#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_#in~head#1.base|) (+ |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 4))) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| (+ |ULTIMATE.start_sll_get_data_at_~index#1| 1)) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_#in~head#1.base|) (+ |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 4)) |ULTIMATE.start_sll_get_data_at_~head#1.base|) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 0 |#NULL.offset|) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2021-11-25 18:49:24,486 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:49:24,486 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:49:24,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-25 18:49:24,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194422081] [2021-11-25 18:49:24,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:49:24,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-25 18:49:24,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:49:24,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-25 18:49:24,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:49:24,488 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:49:24,542 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2021-11-25 18:49:24,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-25 18:49:24,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 18:49:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:49:24,543 INFO L225 Difference]: With dead ends: 31 [2021-11-25 18:49:24,543 INFO L226 Difference]: Without dead ends: 24 [2021-11-25 18:49:24,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:49:24,545 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:49:24,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 15 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:49:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-11-25 18:49:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2021-11-25 18:49:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2021-11-25 18:49:24,558 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 15 [2021-11-25 18:49:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:49:24,558 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2021-11-25 18:49:24,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2021-11-25 18:49:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-11-25 18:49:24,560 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:49:24,560 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:49:24,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 18:49:24,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:24,771 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:49:24,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:49:24,771 INFO L85 PathProgramCache]: Analyzing trace with hash 706001952, now seen corresponding path program 3 times [2021-11-25 18:49:24,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:49:24,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498701826] [2021-11-25 18:49:24,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:24,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:49:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 18:49:25,279 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:49:25,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498701826] [2021-11-25 18:49:25,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498701826] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:49:25,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16039805] [2021-11-25 18:49:25,280 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:49:25,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:25,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:49:25,281 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:49:25,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 18:49:25,531 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:49:25,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:49:25,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 93 conjunts are in the unsatisfiable core [2021-11-25 18:49:25,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:49:25,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:25,581 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-11-25 18:49:25,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-11-25 18:49:25,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 18:49:25,750 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-11-25 18:49:25,751 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 65 [2021-11-25 18:49:25,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2021-11-25 18:49:25,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2021-11-25 18:49:25,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:25,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2021-11-25 18:49:25,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-11-25 18:49:25,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:25,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2021-11-25 18:49:25,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 47 [2021-11-25 18:49:26,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 31 [2021-11-25 18:49:26,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2021-11-25 18:49:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-25 18:49:26,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:49:26,268 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_404) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_404) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) 1)))) is different from false [2021-11-25 18:49:26,334 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (and (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_404) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) .cse0)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_400) .cse0))) 1))) (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= (+ (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_404) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) .cse1)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_400) .cse1))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)))))) is different from false [2021-11-25 18:49:26,355 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:49:26,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 86 [2021-11-25 18:49:26,385 INFO L354 Elim1Store]: treesize reduction 90, result has 30.8 percent of original size [2021-11-25 18:49:26,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 169 [2021-11-25 18:49:26,410 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 111 [2021-11-25 18:49:26,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 97 [2021-11-25 18:49:26,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (let ((.cse1 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((v_prenex_6 Int) (v_ArrVal_399 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_prenex_6) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_prenex_4 Int) (v_ArrVal_397 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_397) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_prenex_4) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) (forall ((v_prenex_6 Int) (v_ArrVal_399 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_prenex_6) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse1 .cse0) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))))))) is different from false [2021-11-25 18:49:26,652 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 18:49:26,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 145 [2021-11-25 18:49:26,660 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:26,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 129 [2021-11-25 18:49:26,725 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:26,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:26,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:26,745 INFO L354 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2021-11-25 18:49:26,746 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-11-25 18:49:26,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16039805] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:49:26,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1894252551] [2021-11-25 18:49:26,914 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-25 18:49:26,914 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:49:26,914 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:49:26,914 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:49:26,915 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:49:26,958 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-11-25 18:49:26,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2021-11-25 18:49:26,995 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-25 18:49:26,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2021-11-25 18:49:27,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:27,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:27,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:27,039 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2021-11-25 18:49:27,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:27,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2021-11-25 18:49:27,061 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:27,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2021-11-25 18:49:27,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:27,077 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:27,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:27,202 INFO L354 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2021-11-25 18:49:27,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2021-11-25 18:49:27,237 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-25 18:49:27,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2021-11-25 18:49:27,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:27,432 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 18:49:27,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 228 treesize of output 210 [2021-11-25 18:49:27,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:27,546 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:27,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 238 [2021-11-25 18:49:27,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:27,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:27,599 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-11-25 18:49:27,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 238 treesize of output 215 [2021-11-25 18:49:27,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:27,677 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:27,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 228 [2021-11-25 18:49:27,697 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:27,718 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:27,719 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2021-11-25 18:49:27,743 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:27,773 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:27,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2021-11-25 18:49:27,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:27,927 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:27,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:27,957 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:27,958 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:27,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:27,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:27,973 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:27,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2021-11-25 18:49:27,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:27,987 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:27,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:28,039 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:28,043 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:28,048 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:28,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:28,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:28,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:28,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:28,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:28,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:28,326 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:28,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:28,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:28,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:28,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:28,493 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:49:29,672 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '962#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2021-11-25 18:49:29,672 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:49:29,672 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:49:29,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 35 [2021-11-25 18:49:29,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871355461] [2021-11-25 18:49:29,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:49:29,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-11-25 18:49:29,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:49:29,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-11-25 18:49:29,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1435, Unknown=3, NotChecked=234, Total=1806 [2021-11-25 18:49:29,675 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:30,834 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (let ((.cse2 (* 2 |c_ULTIMATE.start_main_~len~0#1|)) (.cse1 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse1 .cse2) (forall ((v_prenex_6 Int) (v_ArrVal_399 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_prenex_6) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_prenex_4 Int) (v_ArrVal_397 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_397) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_prenex_4) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) (forall ((v_prenex_6 Int) (v_ArrVal_399 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_prenex_6) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (<= .cse2 .cse1) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))))))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0))) is different from false [2021-11-25 18:49:30,840 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse1 (+ (select (select |c_#memory_int| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) (.cse0 (* 2 |c_ULTIMATE.start_main_~len~0#1|))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (and (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= (* 2 |c_ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_404) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) .cse2)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_400) .cse2))) 1))) (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= (+ (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_404) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) .cse3)) (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_400) .cse3))) 1) (* 2 |c_ULTIMATE.start_main_~len~0#1|)))))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse4)) (<= .cse1 .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)))) is different from false [2021-11-25 18:49:31,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:49:31,414 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2021-11-25 18:49:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-25 18:49:31,415 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-11-25 18:49:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:49:31,417 INFO L225 Difference]: With dead ends: 41 [2021-11-25 18:49:31,418 INFO L226 Difference]: Without dead ends: 39 [2021-11-25 18:49:31,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=292, Invalid=2479, Unknown=5, NotChecked=530, Total=3306 [2021-11-25 18:49:31,421 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 75 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-25 18:49:31,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 86 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 367 Invalid, 0 Unknown, 60 Unchecked, 0.3s Time] [2021-11-25 18:49:31,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-11-25 18:49:31,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2021-11-25 18:49:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:31,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2021-11-25 18:49:31,447 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2021-11-25 18:49:31,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:49:31,447 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2021-11-25 18:49:31,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:31,453 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2021-11-25 18:49:31,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:49:31,454 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:49:31,454 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:49:31,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 18:49:31,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-25 18:49:31,676 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:49:31,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:49:31,677 INFO L85 PathProgramCache]: Analyzing trace with hash 409571466, now seen corresponding path program 4 times [2021-11-25 18:49:31,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:49:31,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218521128] [2021-11-25 18:49:31,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:31,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:49:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-25 18:49:31,765 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:49:31,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218521128] [2021-11-25 18:49:31,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218521128] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:49:31,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:49:31,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 18:49:31,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718918057] [2021-11-25 18:49:31,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:49:31,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 18:49:31,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:49:31,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 18:49:31,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-25 18:49:31,769 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:31,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:49:31,822 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-11-25 18:49:31,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 18:49:31,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-25 18:49:31,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:49:31,823 INFO L225 Difference]: With dead ends: 33 [2021-11-25 18:49:31,824 INFO L226 Difference]: Without dead ends: 28 [2021-11-25 18:49:31,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-11-25 18:49:31,827 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:49:31,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 9 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:49:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-11-25 18:49:31,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-11-25 18:49:31,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:31,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2021-11-25 18:49:31,841 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2021-11-25 18:49:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:49:31,842 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-11-25 18:49:31,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2021-11-25 18:49:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:49:31,844 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:49:31,845 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:49:31,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-25 18:49:31,845 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:49:31,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:49:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1554881251, now seen corresponding path program 5 times [2021-11-25 18:49:31,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:49:31,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279943072] [2021-11-25 18:49:31,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:31,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:49:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:49:31,945 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:49:31,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279943072] [2021-11-25 18:49:31,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279943072] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 18:49:31,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 18:49:31,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-25 18:49:31,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546469527] [2021-11-25 18:49:31,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 18:49:31,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-25 18:49:31,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:49:31,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-25 18:49:31,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 18:49:31,948 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:31,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:49:31,993 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2021-11-25 18:49:31,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 18:49:31,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-25 18:49:31,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:49:31,995 INFO L225 Difference]: With dead ends: 42 [2021-11-25 18:49:31,996 INFO L226 Difference]: Without dead ends: 32 [2021-11-25 18:49:31,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-11-25 18:49:31,999 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:49:31,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 16 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:49:32,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-11-25 18:49:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2021-11-25 18:49:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-11-25 18:49:32,016 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 18 [2021-11-25 18:49:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:49:32,016 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-11-25 18:49:32,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2021-11-25 18:49:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-11-25 18:49:32,018 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:49:32,018 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:49:32,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-25 18:49:32,018 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:49:32,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:49:32,019 INFO L85 PathProgramCache]: Analyzing trace with hash 823590399, now seen corresponding path program 6 times [2021-11-25 18:49:32,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:49:32,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541636108] [2021-11-25 18:49:32,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:32,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:49:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-25 18:49:32,123 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:49:32,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541636108] [2021-11-25 18:49:32,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541636108] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:49:32,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734706417] [2021-11-25 18:49:32,123 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 18:49:32,123 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:32,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:49:32,124 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:49:32,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 18:49:32,259 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-25 18:49:32,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:49:32,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-25 18:49:32,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:49:32,316 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 18:49:32,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:49:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 18:49:32,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734706417] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:49:32,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [620662414] [2021-11-25 18:49:32,377 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-25 18:49:32,377 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:49:32,377 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:49:32,377 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:49:32,377 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:49:32,419 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-11-25 18:49:32,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2021-11-25 18:49:32,451 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-25 18:49:32,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2021-11-25 18:49:32,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:32,491 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:32,491 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:32,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:32,506 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:32,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:32,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:32,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:32,526 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:32,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2021-11-25 18:49:32,618 INFO L354 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2021-11-25 18:49:32,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2021-11-25 18:49:32,685 INFO L354 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2021-11-25 18:49:32,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2021-11-25 18:49:32,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:32,970 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:32,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 238 [2021-11-25 18:49:32,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:33,131 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:33,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 232 [2021-11-25 18:49:33,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:33,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:33,172 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-11-25 18:49:33,172 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 216 treesize of output 198 [2021-11-25 18:49:33,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:33,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:33,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:33,230 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-25 18:49:33,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 232 treesize of output 209 [2021-11-25 18:49:33,252 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:33,272 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:33,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2021-11-25 18:49:33,293 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:33,320 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:33,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2021-11-25 18:49:33,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:33,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:33,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:33,491 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:33,492 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:33,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:33,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:33,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:33,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2021-11-25 18:49:33,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:33,523 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:33,524 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:33,578 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:33,581 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:33,586 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:33,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:33,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:33,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:33,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:33,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:33,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:33,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:33,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:33,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:34,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:34,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:34,014 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:49:34,723 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1496#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2021-11-25 18:49:34,724 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:49:34,724 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:49:34,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2021-11-25 18:49:34,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804376710] [2021-11-25 18:49:34,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:49:34,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 18:49:34,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:49:34,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 18:49:34,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2021-11-25 18:49:34,726 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:49:34,863 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2021-11-25 18:49:34,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-25 18:49:34,863 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-11-25 18:49:34,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:49:34,864 INFO L225 Difference]: With dead ends: 35 [2021-11-25 18:49:34,864 INFO L226 Difference]: Without dead ends: 23 [2021-11-25 18:49:34,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2021-11-25 18:49:34,865 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:49:34,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 26 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:49:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-11-25 18:49:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2021-11-25 18:49:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-11-25 18:49:34,875 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2021-11-25 18:49:34,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:49:34,875 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-11-25 18:49:34,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-11-25 18:49:34,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-25 18:49:34,876 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:49:34,876 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:49:34,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 18:49:35,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:35,095 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:49:35,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:49:35,095 INFO L85 PathProgramCache]: Analyzing trace with hash 74992768, now seen corresponding path program 1 times [2021-11-25 18:49:35,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:49:35,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449486807] [2021-11-25 18:49:35,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:35,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:49:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:35,288 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:49:35,289 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:49:35,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449486807] [2021-11-25 18:49:35,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449486807] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:49:35,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709631550] [2021-11-25 18:49:35,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:35,289 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:35,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:49:35,290 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:49:35,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 18:49:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:35,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 63 conjunts are in the unsatisfiable core [2021-11-25 18:49:35,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:49:35,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-11-25 18:49:35,654 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-11-25 18:49:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-25 18:49:35,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:49:35,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2021-11-25 18:49:35,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:35,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-25 18:49:35,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709631550] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:49:35,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1490337436] [2021-11-25 18:49:35,898 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-25 18:49:35,898 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:49:35,898 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:49:35,898 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:49:35,898 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:49:35,940 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-11-25 18:49:35,941 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2021-11-25 18:49:35,982 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-25 18:49:35,982 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2021-11-25 18:49:36,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:36,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2021-11-25 18:49:36,025 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:36,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2021-11-25 18:49:36,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:36,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:36,041 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:36,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2021-11-25 18:49:36,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:36,062 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:36,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:36,176 INFO L354 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2021-11-25 18:49:36,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2021-11-25 18:49:36,214 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-25 18:49:36,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2021-11-25 18:49:36,432 INFO L354 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2021-11-25 18:49:36,432 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 220 [2021-11-25 18:49:36,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:36,551 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:36,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 234 [2021-11-25 18:49:36,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:36,646 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:36,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 228 [2021-11-25 18:49:36,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:36,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:36,711 INFO L354 Elim1Store]: treesize reduction 74, result has 24.5 percent of original size [2021-11-25 18:49:36,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 245 treesize of output 235 [2021-11-25 18:49:36,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:36,763 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:36,764 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2021-11-25 18:49:36,795 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:36,820 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:36,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2021-11-25 18:49:36,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:36,963 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:36,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:36,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:36,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:37,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:37,003 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:37,004 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:37,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:37,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:37,018 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:37,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2021-11-25 18:49:37,074 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:37,077 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:37,086 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:37,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:37,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:37,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:37,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:37,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:37,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:37,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:37,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:37,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:37,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:37,684 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:37,685 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:49:38,271 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1757#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2021-11-25 18:49:38,272 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:49:38,272 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:49:38,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 25 [2021-11-25 18:49:38,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173339399] [2021-11-25 18:49:38,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:49:38,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 18:49:38,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:49:38,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 18:49:38,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2021-11-25 18:49:38,274 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:38,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:49:38,656 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2021-11-25 18:49:38,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-25 18:49:38,656 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-11-25 18:49:38,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:49:38,657 INFO L225 Difference]: With dead ends: 28 [2021-11-25 18:49:38,657 INFO L226 Difference]: Without dead ends: 26 [2021-11-25 18:49:38,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=263, Invalid=1377, Unknown=0, NotChecked=0, Total=1640 [2021-11-25 18:49:38,658 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 59 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 18:49:38,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 54 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 18:49:38,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-25 18:49:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2021-11-25 18:49:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-11-25 18:49:38,666 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 20 [2021-11-25 18:49:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:49:38,666 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-11-25 18:49:38,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:38,666 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-11-25 18:49:38,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-25 18:49:38,667 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 18:49:38,667 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 18:49:38,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 18:49:38,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:38,871 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-25 18:49:38,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 18:49:38,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1971844054, now seen corresponding path program 2 times [2021-11-25 18:49:38,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 18:49:38,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911947298] [2021-11-25 18:49:38,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 18:49:38,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 18:49:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 18:49:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-25 18:49:38,945 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 18:49:38,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911947298] [2021-11-25 18:49:38,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911947298] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 18:49:38,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447668098] [2021-11-25 18:49:38,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 18:49:38,946 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 18:49:38,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 18:49:38,963 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 18:49:38,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-25 18:49:39,080 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-25 18:49:39,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 18:49:39,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 18:49:39,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 18:49:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-25 18:49:39,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 18:49:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-25 18:49:39,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447668098] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 18:49:39,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [273715933] [2021-11-25 18:49:39,170 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2021-11-25 18:49:39,170 INFO L166 IcfgInterpreter]: Building call graph [2021-11-25 18:49:39,170 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-25 18:49:39,170 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-25 18:49:39,170 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-25 18:49:39,221 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-11-25 18:49:39,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2021-11-25 18:49:39,255 INFO L354 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2021-11-25 18:49:39,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2021-11-25 18:49:39,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:39,291 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:39,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:39,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:39,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:39,306 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:39,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2021-11-25 18:49:39,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:39,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2021-11-25 18:49:39,328 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:39,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2021-11-25 18:49:39,444 INFO L354 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2021-11-25 18:49:39,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2021-11-25 18:49:39,478 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-25 18:49:39,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2021-11-25 18:49:39,711 INFO L354 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2021-11-25 18:49:39,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 220 [2021-11-25 18:49:39,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:39,842 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:39,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 225 treesize of output 234 [2021-11-25 18:49:39,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:39,932 INFO L354 Elim1Store]: treesize reduction 60, result has 30.2 percent of original size [2021-11-25 18:49:39,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 228 [2021-11-25 18:49:39,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:39,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:40,016 INFO L354 Elim1Store]: treesize reduction 74, result has 24.5 percent of original size [2021-11-25 18:49:40,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 245 treesize of output 235 [2021-11-25 18:49:40,046 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:40,067 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:40,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2021-11-25 18:49:40,089 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:40,107 INFO L354 Elim1Store]: treesize reduction 51, result has 15.0 percent of original size [2021-11-25 18:49:40,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2021-11-25 18:49:40,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:40,263 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:40,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:40,292 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:40,292 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:40,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:40,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:40,307 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:40,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2021-11-25 18:49:40,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 18:49:40,321 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 18:49:40,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2021-11-25 18:49:40,369 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:40,375 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:40,378 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-11-25 18:49:40,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:40,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:40,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:40,597 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:40,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:40,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:40,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:40,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-11-25 18:49:40,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-11-25 18:49:41,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2021-11-25 18:49:41,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-11-25 18:49:41,019 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-25 18:49:41,578 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2001#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2021-11-25 18:49:41,578 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-25 18:49:41,578 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 18:49:41,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-11-25 18:49:41,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154534871] [2021-11-25 18:49:41,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 18:49:41,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-25 18:49:41,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 18:49:41,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-25 18:49:41,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-11-25 18:49:41,580 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 18:49:41,647 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2021-11-25 18:49:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-25 18:49:41,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-11-25 18:49:41,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 18:49:41,648 INFO L225 Difference]: With dead ends: 26 [2021-11-25 18:49:41,648 INFO L226 Difference]: Without dead ends: 0 [2021-11-25 18:49:41,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2021-11-25 18:49:41,649 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 18:49:41,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 10 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 18:49:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-25 18:49:41,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-25 18:49:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-25 18:49:41,650 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2021-11-25 18:49:41,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 18:49:41,651 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-25 18:49:41,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 18:49:41,651 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-25 18:49:41,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-25 18:49:41,653 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-25 18:49:41,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-25 18:49:41,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-25 18:49:41,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-25 18:49:50,018 WARN L227 SmtUtils]: Spent 6.91s on a formula simplification. DAG size of input: 129 DAG size of output: 124 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-11-25 18:51:20,292 WARN L227 SmtUtils]: Spent 1.49m on a formula simplification. DAG size of input: 203 DAG size of output: 153 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-11-25 18:51:20,294 INFO L861 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2021-11-25 18:51:20,295 INFO L854 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse29 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse30 (* 2 |ULTIMATE.start_main_~len~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse1 (= .cse30 (+ 2 |ULTIMATE.start_sll_update_at_~data#1|))) (.cse2 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse3 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse4 (<= (+ .cse29 2) .cse30)) (.cse5 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse6 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse7 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse8 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse9 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse10 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse11 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse12 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse13 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse14 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse15 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse16 (= |#NULL.offset| 0)) (.cse17 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse18 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse19 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse20 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse21 (<= 0 |#StackHeapBarrier|)) (.cse22 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse23 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse24 (<= |ULTIMATE.start_main_~len~0#1| .cse29)) (.cse25 (= |#NULL.base| 0))) (or (and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) .cse10 (<= |ULTIMATE.start_sll_update_at_~data#1| 3) (<= (+ |ULTIMATE.start_sll_update_at_~index#1| 2) |ULTIMATE.start_main_~len~0#1|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (<= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse23 .cse24 .cse25) (let ((.cse26 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse28 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse27 (select (select |#memory_int| (select .cse26 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= (select .cse26 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (<= .cse27 .cse28) .cse11 .cse12 .cse13 .cse14 (= |ULTIMATE.start_main_~len~0#1| 2) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= (+ |ULTIMATE.start_sll_update_at_~index#1| 1) |ULTIMATE.start_main_~i~0#1|) (<= .cse28 .cse27) .cse21 .cse22 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse23 (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse24 .cse25)))))) [2021-11-25 18:51:20,295 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-25 18:51:20,295 INFO L861 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2021-11-25 18:51:20,296 INFO L854 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse33 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (let ((.cse9 (= |ULTIMATE.start_sll_update_at_~data#1| .cse33)) (.cse16 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse18 (= |ULTIMATE.start_sll_update_at_~index#1| |ULTIMATE.start_main_~i~0#1|)) (.cse19 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse0 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse31 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse1 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse32 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse4 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse5 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse6 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse7 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse8 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse10 (<= |ULTIMATE.start_sll_update_at_~index#1| 1)) (.cse11 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse12 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse13 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse14 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse15 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse17 (= |#NULL.offset| 0)) (.cse21 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse22 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse23 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse24 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse26 (<= 0 |#StackHeapBarrier|)) (.cse27 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse34 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))) (.cse35 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|))) (.cse28 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse29 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse30 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) .cse8 (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= (+ (let ((.cse20 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |#memory_int| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_404) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) |ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_403)) |ULTIMATE.start_main_~s~0#1.base|) .cse20)) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base|) |ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_400)) |ULTIMATE.start_main_~s~0#1.base|) .cse20))) 1) (* 2 |ULTIMATE.start_main_~len~0#1|))) .cse21 .cse22 .cse23 .cse24 (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= (* 2 |ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse25 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |#memory_int| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_404) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) |ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_403)) |ULTIMATE.start_main_~s~0#1.base|) .cse25)) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base|) |ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_400)) |ULTIMATE.start_main_~s~0#1.base|) .cse25))) 1))) .cse26 .cse27 .cse28 .cse29 .cse30) (and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) .cse31 .cse32 .cse2 .cse3 .cse4 .cse6 .cse8 (= |ULTIMATE.start_sll_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_update_at_#in~head#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|) .cse9 .cse11 .cse13 (= |ULTIMATE.start_sll_update_at_~data#1| |ULTIMATE.start_sll_update_at_#in~data#1|) .cse14 (= .cse33 |ULTIMATE.start_main_~new_data~0#1|) .cse16 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) .cse17 .cse18 .cse19 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse24 (< 0 |ULTIMATE.start_sll_update_at_~index#1|) .cse26 .cse27 .cse34 (= |ULTIMATE.start_sll_update_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) .cse35 .cse29 .cse30) (and .cse0 .cse31 .cse1 .cse32 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse21 .cse22 .cse23 .cse24 (<= (+ |ULTIMATE.start_sll_update_at_~index#1| 1) |ULTIMATE.start_main_~i~0#1|) .cse26 .cse27 .cse34 (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (let ((.cse37 (* 2 |ULTIMATE.start_main_~len~0#1|)) (.cse36 (+ |ULTIMATE.start_sll_update_at_~data#1| 1))) (and (<= .cse36 .cse37) (forall ((v_prenex_6 Int) (v_ArrVal_399 (Array Int Int))) (= |ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_prenex_6) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_prenex_4 Int) (v_ArrVal_397 (Array Int Int))) (= (select (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_397) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_prenex_4) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_sll_update_at_~head#1.offset|)) (forall ((v_prenex_6 Int) (v_ArrVal_399 (Array Int Int))) (not (= (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_prenex_6) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|))) (<= .cse37 .cse36) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int)) (not (= (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|))))))) .cse35 .cse28 .cse29 .cse30)))) [2021-11-25 18:51:20,296 INFO L858 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2021-11-25 18:51:20,296 INFO L854 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse16 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse45 (select (select |#memory_int| (select .cse16 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4))) (.cse41 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse44 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse46 (* 2 |ULTIMATE.start_main_~len~0#1|)) (.cse40 (+ 2 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0)) (.cse1 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse4 (<= |ULTIMATE.start_main_~len~0#1| .cse40)) (.cse39 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|)) (.cse15 (<= |ULTIMATE.start_sll_update_at_~data#1| 3)) (.cse17 (<= |ULTIMATE.start_sll_update_at_~index#1| 1)) (.cse28 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse34 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse2 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse3 (= .cse46 (+ 2 |ULTIMATE.start_sll_update_at_~data#1|))) (.cse5 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse6 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse7 (<= (+ .cse44 2) .cse46)) (.cse8 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse9 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse10 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse11 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse12 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse14 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse18 (<= .cse45 .cse41)) (.cse19 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse20 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse21 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse22 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse23 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse24 (= |#NULL.offset| 0)) (.cse25 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse26 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse27 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse29 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse30 (<= (+ |ULTIMATE.start_sll_update_at_~index#1| 1) |ULTIMATE.start_main_~i~0#1|)) (.cse31 (<= .cse41 .cse45)) (.cse32 (<= 0 |#StackHeapBarrier|)) (.cse33 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse35 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))) (.cse36 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse37 (<= |ULTIMATE.start_main_~len~0#1| .cse44)) (.cse38 (= |#NULL.base| 0))) (or (let ((.cse13 (+ .cse39 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= (+ (* 2 (div .cse13 (- 2))) |ULTIMATE.start_main_~expected~0#1| 1) 0) .cse14 .cse15 (not (= (select .cse16 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (= (mod .cse13 (- 2)) 0) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38)) (and .cse0 (<= 2 .cse39) .cse1 .cse2 .cse4 .cse5 .cse6 (<= .cse39 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse40 |ULTIMATE.start_main_~len~0#1|) .cse14 .cse15 (= 2 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_sll_update_at_~data#1| .cse41) .cse17 (<= (+ |ULTIMATE.start_sll_update_at_~index#1| 2) |ULTIMATE.start_main_~len~0#1|) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38) (let ((.cse43 (+ |ULTIMATE.start_sll_get_data_at_~head#1.offset| 4))) (let ((.cse42 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse43))) (and .cse2 .cse3 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) .cse5 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 (not (= |ULTIMATE.start_sll_get_data_at_~head#1.base| .cse42)) .cse18 .cse19 .cse20 .cse21 .cse22 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| 2) .cse23 (= 0 (+ |ULTIMATE.start_main_~expected~0#1| (* 2 (div (+ (select (select |#memory_int| .cse42) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse43)) 1) (- 2))) 1)) .cse24 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse25 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) .cse26 .cse27 .cse29 .cse30 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse31 .cse32 .cse33 .cse35 .cse36 (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse37 .cse38))))))) [2021-11-25 18:51:20,297 INFO L854 garLoopResultBuilder]: At program point L625(lines 613 632) the Hoare annotation is: false [2021-11-25 18:51:20,297 INFO L854 garLoopResultBuilder]: At program point L576(lines 576 578) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_node_create_~data#1| |ULTIMATE.start_node_create_#in~data#1|)) (.cse1 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|))) (.cse4 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse6 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse7 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse8 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse9 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse10 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|)) (.cse13 (= |#NULL.offset| 0)) (.cse14 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_node_create_#in~data#1|)) (.cse15 (<= 0 |#StackHeapBarrier|)) (.cse16 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse17 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))) (.cse18 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse19 (= |#NULL.base| 0))) (or (and .cse0 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_sll_create_~len#1| 2) .cse19) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2021-11-25 18:51:20,297 INFO L861 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2021-11-25 18:51:20,297 INFO L854 garLoopResultBuilder]: At program point L618-3(lines 618 621) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse3 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse7 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse10 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse8 (+ 2 |ULTIMATE.start_main_~i~0#1|)) (.cse12 (<= (+ |ULTIMATE.start_sll_update_at_~index#1| 2) |ULTIMATE.start_main_~len~0#1|)) (.cse14 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse19 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse20 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse21 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse24 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse4 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse5 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse6 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse9 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse11 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse13 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse15 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse16 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse17 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse18 (= |#NULL.offset| 0)) (.cse22 (<= 0 |#StackHeapBarrier|)) (.cse23 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse25 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse26 (= |#NULL.base| 0))) (or (and .cse0 (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (and (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= (* 2 |ULTIMATE.start_main_~len~0#1|) (+ (let ((.cse1 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~s~0#1.base| v_ArrVal_404) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) .cse1)) (select (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_400) .cse1))) 1))) (forall ((v_ArrVal_400 Int) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_403 Int)) (<= (+ (let ((.cse2 (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~s~0#1.base| v_ArrVal_404) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_403) .cse2)) (select (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_400) .cse2))) 1) (* 2 |ULTIMATE.start_main_~len~0#1|)))))) .cse3 .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~len~0#1| .cse8) .cse9 .cse10 .cse11 (<= |ULTIMATE.start_sll_update_at_~data#1| 3) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse29 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse28 (+ (select (select |#memory_int| .cse29) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) 1)) (.cse27 (* 2 |ULTIMATE.start_main_~len~0#1|)) (.cse30 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (and (<= .cse27 .cse28) .cse0 (= .cse27 (+ 2 |ULTIMATE.start_sll_update_at_~data#1|)) (not (= |ULTIMATE.start_main_~s~0#1.base| .cse29)) .cse3 .cse4 (<= (+ .cse30 2) .cse27) .cse5 .cse6 .cse7 .cse9 (<= .cse28 .cse27) .cse10 (<= .cse8 |ULTIMATE.start_main_~len~0#1|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|) .cse18 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= |ULTIMATE.start_main_~len~0#1| .cse30) .cse26))) (and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse4 .cse5 .cse6 .cse9 .cse11 .cse13 .cse15 .cse16 .cse17 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) .cse18 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse22 .cse23 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse25 .cse26))) [2021-11-25 18:51:20,297 INFO L854 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse5 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse14 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse0 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse4 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse6 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse9 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse10 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (<= 0 |#StackHeapBarrier|)) (.cse13 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse15 (<= |ULTIMATE.start_sll_create_~len#1| 2)) (.cse16 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_create_~len#1|) .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse15 .cse16))) [2021-11-25 18:51:20,297 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2021-11-25 18:51:20,298 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-25 18:51:20,300 INFO L732 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1] [2021-11-25 18:51:20,302 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-25 18:51:20,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,328 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,329 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,329 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,329 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,348 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,348 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,349 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,349 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,356 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,358 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,361 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,374 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2021-11-25 18:51:20,375 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,375 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,375 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,376 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,376 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2021-11-25 18:51:20,376 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,377 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2021-11-25 18:51:20,377 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,377 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,378 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,378 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,378 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2021-11-25 18:51:20,378 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,379 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,379 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,380 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,380 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,380 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,381 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,384 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,385 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2021-11-25 18:51:20,385 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,392 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,392 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,392 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,393 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2021-11-25 18:51:20,393 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,393 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2021-11-25 18:51:20,394 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,394 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,394 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,394 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,395 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2021-11-25 18:51:20,395 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,395 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,396 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,396 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,396 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,397 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,397 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,402 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,402 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,402 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,402 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,405 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,408 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,409 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,409 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,409 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,410 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,410 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,411 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,411 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,411 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,411 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,412 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,412 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,417 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2021-11-25 18:51:20,418 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,418 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,418 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,418 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,419 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2021-11-25 18:51:20,419 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2021-11-25 18:51:20,419 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,420 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,420 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,420 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,420 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,421 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2021-11-25 18:51:20,421 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,421 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,422 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2021-11-25 18:51:20,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2021-11-25 18:51:20,422 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,422 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,423 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_397,QUANTIFIED] [2021-11-25 18:51:20,423 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2021-11-25 18:51:20,423 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,423 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,423 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2021-11-25 18:51:20,424 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2021-11-25 18:51:20,424 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,424 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,424 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2021-11-25 18:51:20,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,425 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,425 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,428 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2021-11-25 18:51:20,428 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,428 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,429 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,429 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,429 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2021-11-25 18:51:20,430 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2021-11-25 18:51:20,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,430 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,430 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,431 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,431 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,431 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2021-11-25 18:51:20,431 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,432 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2021-11-25 18:51:20,432 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2021-11-25 18:51:20,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,433 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_397,QUANTIFIED] [2021-11-25 18:51:20,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2021-11-25 18:51:20,433 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,434 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2021-11-25 18:51:20,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2021-11-25 18:51:20,434 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,435 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2021-11-25 18:51:20,435 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,435 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,435 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:51:20 BoogieIcfgContainer [2021-11-25 18:51:20,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-25 18:51:20,439 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-25 18:51:20,439 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-25 18:51:20,439 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-25 18:51:20,439 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:49:09" (3/4) ... [2021-11-25 18:51:20,442 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-25 18:51:20,453 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2021-11-25 18:51:20,457 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-11-25 18:51:20,457 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-11-25 18:51:20,457 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-25 18:51:20,484 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((1 <= \old(data) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && len == len) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && #NULL == 0)) || ((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head == 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(#memory_$Pointer$[head][4] == head)) && len <= 2) && #NULL == 0) [2021-11-25 18:51:20,485 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((data == \old(data) && !(temp == head)) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && len <= 2) && #NULL == 0) || ((((((((((((((((((((2 == len && data == \old(data)) && \valid[temp] == 1) && 1 <= \old(data)) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && #NULL == 0) [2021-11-25 18:51:20,485 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((\old(data) <= 3 && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || ((forall v_ArrVal_400 : int, v_ArrVal_404 : [int]int, v_ArrVal_403 : int :: 2 * len <= unknown-#memory_int-unknown[s := v_ArrVal_404][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_403][s + 4]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_400][s + 4]] + 1) && (forall v_ArrVal_400 : int, v_ArrVal_404 : [int]int, v_ArrVal_403 : int :: unknown-#memory_int-unknown[s := v_ArrVal_404][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_403][s + 4]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_400][s + 4]] + 1 <= 2 * len)))) && 0 <= head) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len == 2 + i) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && index + 2 <= len) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((((2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 && \old(data) <= 3) && 2 * len == 2 + data) && !(s == #memory_$Pointer$[s][4])) && 0 <= head) && 1 <= \old(data)) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 <= 2 * len) && \result <= 0) && 2 + i <= len) && 1 <= data) && index + 2 <= len) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0)) || (((((((((((((((((((((s == \result && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && len <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && \result == head) && #NULL == 0) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && !(#memory_$Pointer$[head][4] == head)) && s == 0) && #NULL == 0) [2021-11-25 18:51:20,485 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && \old(data) <= 3) && 2 * len == 2 + data) && 0 <= head) && 1 <= \old(data)) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 + i <= len) && 1 <= data) && data <= 3) && index + 2 <= len) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && s == head) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || ((((((((((((((((((((((((((((((((\old(data) <= 3 && 2 * len == 2 + data) && 0 <= head) && 1 <= \old(data)) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && !(#memory_$Pointer$[s][s + 4] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + i) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && index + 1 <= i) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) [2021-11-25 18:51:20,486 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((\old(data) <= 3 && 0 <= head) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 + i <= len) && 1 <= data) && 0 <= i) && data == len + i) && index <= 1) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && index == i) && head == s) && (forall v_ArrVal_400 : int, v_ArrVal_404 : [int]int, v_ArrVal_403 : int :: unknown-#memory_int-unknown[head := v_ArrVal_404][#memory_$Pointer$[head := #memory_$Pointer$[head][head := v_ArrVal_403]][s][s + 4]][#memory_$Pointer$[head := #memory_$Pointer$[head][head := v_ArrVal_400]][s][s + 4]] + 1 <= 2 * len)) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && (forall v_ArrVal_400 : int, v_ArrVal_404 : [int]int, v_ArrVal_403 : int :: 2 * len <= unknown-#memory_int-unknown[head := v_ArrVal_404][#memory_$Pointer$[head := #memory_$Pointer$[head][head := v_ArrVal_403]][s][s + 4]][#memory_$Pointer$[head := #memory_$Pointer$[head][head := v_ArrVal_400]][s][s + 4]] + 1)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && #NULL == 0) || (((((((((((((((((((((((((((((((s == \result && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && len <= 0) && 1 <= data) && head == s) && head == head) && data == len + i) && data == 1) && data <= 1) && data == \old(data)) && \old(len) <= 2) && len + i == new_data) && s == head) && \result == head) && #NULL == 0) && index == i) && head == s) && \result == s) && new_data <= 3) && 0 < index) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && \old(index) == i) && !(#memory_$Pointer$[head][4] == head)) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((\old(data) <= 3 && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 1) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || (((((data + 1 <= 2 * len && (forall v_prenex_6 : int, v_ArrVal_399 : [int]int :: head == #memory_$Pointer$[head := v_ArrVal_399][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_prenex_6][s + 4])) && (forall v_prenex_4 : int, v_ArrVal_397 : [int]int :: #memory_$Pointer$[head := v_ArrVal_397][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_prenex_4][s + 4] == head)) && (forall v_prenex_6 : int, v_ArrVal_399 : [int]int :: !(#memory_$Pointer$[head := v_ArrVal_399][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_prenex_6][s + 4] == s))) && 2 * len <= data + 1) && (forall v_ArrVal_399 : [int]int, v_ArrVal_403 : int :: !(#memory_$Pointer$[head := v_ArrVal_399][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_403][s + 4] == s))))) && !(#memory_$Pointer$[head][4] == head)) && 0 <= head) && s == 0) && #NULL == 0) [2021-11-25 18:51:20,487 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && \old(data) <= 3) && 2 * len == 2 + data) && len <= 2 + i) && 0 <= head) && 1 <= \old(data)) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 * ((unknown-#memory_int-unknown[head][head] + 1) / -2) + expected + 1 == 0) && 1 <= data) && data <= 3) && !(#memory_$Pointer$[s][s + 4] == s)) && (unknown-#memory_int-unknown[head][head] + 1) % -2 == 0) && index <= 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + i) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && s == head) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && index + 1 <= i) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && len == i + 1) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((index <= 0 && 2 <= unknown-#memory_int-unknown[head][head]) && 0 <= s) && \old(data) <= 3) && len <= 2 + i) && 0 <= head) && 1 <= \old(data)) && unknown-#memory_int-unknown[head][head] <= 2) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 + i <= len) && 1 <= data) && data <= 3) && 2 == expected) && data == len + i) && index <= 1) && index + 2 <= len) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && s == head) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((\old(data) <= 3 && 2 * len == 2 + data) && head == head) && 0 <= head) && \old(index) == i) && 1 <= \old(data)) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && !(head == #memory_$Pointer$[head][head + 4])) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + i) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && head == s) && len == 2) && s == head) && 0 == expected + 2 * ((unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] + 1) / -2) + 1) && #NULL == 0) && head == s) && head == s) && \old(index) == index) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && index + 1 <= i) && head == head) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) [2021-11-25 18:51:20,511 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/witness.graphml [2021-11-25 18:51:20,511 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-25 18:51:20,512 INFO L158 Benchmark]: Toolchain (without parser) took 132397.72ms. Allocated memory was 92.3MB in the beginning and 255.9MB in the end (delta: 163.6MB). Free memory was 57.5MB in the beginning and 187.1MB in the end (delta: -129.6MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2021-11-25 18:51:20,512 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 92.3MB. Free memory was 48.8MB in the beginning and 48.7MB in the end (delta: 38.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 18:51:20,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.55ms. Allocated memory is still 92.3MB. Free memory was 57.3MB in the beginning and 61.0MB in the end (delta: -3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-25 18:51:20,513 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.40ms. Allocated memory is still 92.3MB. Free memory was 61.0MB in the beginning and 58.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-25 18:51:20,513 INFO L158 Benchmark]: Boogie Preprocessor took 70.27ms. Allocated memory is still 92.3MB. Free memory was 58.7MB in the beginning and 57.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-25 18:51:20,514 INFO L158 Benchmark]: RCFGBuilder took 500.81ms. Allocated memory is still 92.3MB. Free memory was 57.3MB in the beginning and 42.3MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-11-25 18:51:20,514 INFO L158 Benchmark]: TraceAbstraction took 131118.65ms. Allocated memory was 92.3MB in the beginning and 255.9MB in the end (delta: 163.6MB). Free memory was 41.6MB in the beginning and 190.2MB in the end (delta: -148.6MB). Peak memory consumption was 131.6MB. Max. memory is 16.1GB. [2021-11-25 18:51:20,514 INFO L158 Benchmark]: Witness Printer took 72.89ms. Allocated memory is still 255.9MB. Free memory was 190.2MB in the beginning and 187.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-25 18:51:20,523 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.26ms. Allocated memory is still 92.3MB. Free memory was 48.8MB in the beginning and 48.7MB in the end (delta: 38.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.55ms. Allocated memory is still 92.3MB. Free memory was 57.3MB in the beginning and 61.0MB in the end (delta: -3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.40ms. Allocated memory is still 92.3MB. Free memory was 61.0MB in the beginning and 58.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.27ms. Allocated memory is still 92.3MB. Free memory was 58.7MB in the beginning and 57.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 500.81ms. Allocated memory is still 92.3MB. Free memory was 57.3MB in the beginning and 42.3MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 131118.65ms. Allocated memory was 92.3MB in the beginning and 255.9MB in the end (delta: 163.6MB). Free memory was 41.6MB in the beginning and 190.2MB in the end (delta: -148.6MB). Peak memory consumption was 131.6MB. Max. memory is 16.1GB. * Witness Printer took 72.89ms. Allocated memory is still 255.9MB. Free memory was 190.2MB in the beginning and 187.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_397,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_397,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - 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: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 630]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 130.9s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 98.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 277 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 60 IncrementalHoareTripleChecker+Unchecked, 278 mSDsCounter, 176 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 870 IncrementalHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 176 mSolverCounterUnsat, 57 mSDtfsCounter, 870 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 495 GetRequests, 288 SyntacticMatches, 12 SemanticMatches, 195 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1437 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=8, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 34 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 27 NumberOfFragments, 2014 HoareAnnotationTreeSize, 10 FomulaSimplifications, 366 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 10 FomulaSimplificationsInter, 9713 FormulaSimplificationTreeSizeReductionInter, 98.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 315 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 421 ConstructedInterpolants, 3 QuantifiedInterpolants, 2716 SizeOfPredicates, 85 NumberOfNonLiveVariables, 1935 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 30 InterpolantComputations, 3 PerfectInterpolantSequences, 172/252 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: 5.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 21, DAG_INTERPRETER_EARLY_EXITS: 4, TOOLS_POST_APPLICATIONS: 47, TOOLS_POST_TIME: 5.1s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 45, TOOLS_QUANTIFIERELIM_TIME: 5.1s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.8s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 100, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 5, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 8, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 13, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 21, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 5, LOOP_SUMMARIZER_CACHE_MISSES: 5, LOOP_SUMMARIZER_OVERALL_TIME: 5.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 5.1s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 13, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 298, DAG_COMPRESSION_RETAINED_NODES: 91, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 622]: Loop Invariant [2021-11-25 18:51:20,547 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,550 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,551 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,551 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,552 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,553 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,554 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && \old(data) <= 3) && 2 * len == 2 + data) && 0 <= head) && 1 <= \old(data)) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 + i <= len) && 1 <= data) && data <= 3) && index + 2 <= len) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && s == head) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || ((((((((((((((((((((((((((((((((\old(data) <= 3 && 2 * len == 2 + data) && 0 <= head) && 1 <= \old(data)) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && !(#memory_$Pointer$[s][s + 4] == s)) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + i) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && index + 1 <= i) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((data == \old(data) && !(temp == head)) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && len <= 2) && #NULL == 0) || ((((((((((((((((((((2 == len && data == \old(data)) && \valid[temp] == 1) && 1 <= \old(data)) && 8 == unknown-#length-unknown[temp]) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == \old(data)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(temp == 0)) && 0 <= head) && #NULL == 0) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant [2021-11-25 18:51:20,558 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,559 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((1 <= \old(data) && \old(data) <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && len == len) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && #NULL == 0)) || ((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head == 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && !(#memory_$Pointer$[head][4] == head)) && len <= 2) && #NULL == 0) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant [2021-11-25 18:51:20,560 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,560 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2021-11-25 18:51:20,560 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,560 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,561 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,561 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,561 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2021-11-25 18:51:20,561 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,562 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2021-11-25 18:51:20,562 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,562 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,563 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,563 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,563 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2021-11-25 18:51:20,563 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,564 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,564 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,565 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,565 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,566 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,566 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,568 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,568 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2021-11-25 18:51:20,568 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,569 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,569 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,569 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,569 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2021-11-25 18:51:20,570 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,570 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2021-11-25 18:51:20,570 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,571 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,571 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,571 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,572 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2021-11-25 18:51:20,572 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,574 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,574 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,574 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,575 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,575 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,576 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((\old(data) <= 3 && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || ((forall v_ArrVal_400 : int, v_ArrVal_404 : [int]int, v_ArrVal_403 : int :: 2 * len <= unknown-#memory_int-unknown[s := v_ArrVal_404][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_403][s + 4]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_400][s + 4]] + 1) && (forall v_ArrVal_400 : int, v_ArrVal_404 : [int]int, v_ArrVal_403 : int :: unknown-#memory_int-unknown[s := v_ArrVal_404][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_403][s + 4]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_400][s + 4]] + 1 <= 2 * len)))) && 0 <= head) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len == 2 + i) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && index + 2 <= len) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((((2 * len <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 && \old(data) <= 3) && 2 * len == 2 + data) && !(s == #memory_$Pointer$[s][4])) && 0 <= head) && 1 <= \old(data)) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] + 1 <= 2 * len) && \result <= 0) && 2 + i <= len) && 1 <= data) && index + 2 <= len) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0)) || (((((((((((((((((((((s == \result && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && len <= 0) && 1 <= data) && data == 1) && data <= 1) && \old(len) <= 2) && len == 2) && \result == head) && #NULL == 0) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && !(#memory_$Pointer$[head][4] == head)) && s == 0) && #NULL == 0) - InvariantResult [Line: 600]: Loop Invariant [2021-11-25 18:51:20,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,579 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,580 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,580 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,581 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,582 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,584 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,585 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,586 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,587 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && \old(data) <= 3) && 2 * len == 2 + data) && len <= 2 + i) && 0 <= head) && 1 <= \old(data)) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 * ((unknown-#memory_int-unknown[head][head] + 1) / -2) + expected + 1 == 0) && 1 <= data) && data <= 3) && !(#memory_$Pointer$[s][s + 4] == s)) && (unknown-#memory_int-unknown[head][head] + 1) % -2 == 0) && index <= 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + i) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && s == head) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && index + 1 <= i) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && len == i + 1) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((index <= 0 && 2 <= unknown-#memory_int-unknown[head][head]) && 0 <= s) && \old(data) <= 3) && len <= 2 + i) && 0 <= head) && 1 <= \old(data)) && unknown-#memory_int-unknown[head][head] <= 2) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 + i <= len) && 1 <= data) && data <= 3) && 2 == expected) && data == len + i) && index <= 1) && index + 2 <= len) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && s == head) && #NULL == 0) && head == s) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && s <= 0) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((\old(data) <= 3 && 2 * len == 2 + data) && head == head) && 0 <= head) && \old(index) == i) && 1 <= \old(data)) && unknown-#memory_int-unknown[s][s] + 2 <= 2 * len) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && !(head == #memory_$Pointer$[head][head + 4])) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + i) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && head == s) && len == 2) && s == head) && 0 == expected + 2 * ((unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] + 1) / -2) + 1) && #NULL == 0) && head == s) && head == s) && \old(index) == index) && 0 <= \result) && \old(index) <= 1) && new_data <= 3) && index + 1 <= i) && head == head) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) - InvariantResult [Line: 607]: Loop Invariant [2021-11-25 18:51:20,589 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2021-11-25 18:51:20,590 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,590 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,590 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,590 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,591 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,591 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2021-11-25 18:51:20,591 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2021-11-25 18:51:20,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,592 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,592 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,593 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2021-11-25 18:51:20,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,593 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,593 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,593 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2021-11-25 18:51:20,594 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2021-11-25 18:51:20,595 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,595 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,595 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_397,QUANTIFIED] [2021-11-25 18:51:20,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2021-11-25 18:51:20,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,596 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2021-11-25 18:51:20,596 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2021-11-25 18:51:20,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,597 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2021-11-25 18:51:20,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,597 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,598 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,599 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2021-11-25 18:51:20,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,600 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,601 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,601 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,602 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2021-11-25 18:51:20,602 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_404,QUANTIFIED] [2021-11-25 18:51:20,603 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,603 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,603 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,603 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,604 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,604 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_400,QUANTIFIED] [2021-11-25 18:51:20,604 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,604 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,604 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,605 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2021-11-25 18:51:20,605 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2021-11-25 18:51:20,605 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,605 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2021-11-25 18:51:20,605 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_397,QUANTIFIED] [2021-11-25 18:51:20,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_4,QUANTIFIED] [2021-11-25 18:51:20,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,606 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2021-11-25 18:51:20,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2021-11-25 18:51:20,606 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,607 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2021-11-25 18:51:20,607 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2021-11-25 18:51:20,607 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_403,QUANTIFIED] [2021-11-25 18:51:20,607 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2021-11-25 18:51:20,607 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((((((((((((((((((((\old(data) <= 3 && 0 <= head) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 + i <= len) && 1 <= data) && 0 <= i) && data == len + i) && index <= 1) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && s == head) && #NULL == 0) && index == i) && head == s) && (forall v_ArrVal_400 : int, v_ArrVal_404 : [int]int, v_ArrVal_403 : int :: unknown-#memory_int-unknown[head := v_ArrVal_404][#memory_$Pointer$[head := #memory_$Pointer$[head][head := v_ArrVal_403]][s][s + 4]][#memory_$Pointer$[head := #memory_$Pointer$[head][head := v_ArrVal_400]][s][s + 4]] + 1 <= 2 * len)) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && (forall v_ArrVal_400 : int, v_ArrVal_404 : [int]int, v_ArrVal_403 : int :: 2 * len <= unknown-#memory_int-unknown[head := v_ArrVal_404][#memory_$Pointer$[head := #memory_$Pointer$[head][head := v_ArrVal_403]][s][s + 4]][#memory_$Pointer$[head := #memory_$Pointer$[head][head := v_ArrVal_400]][s][s + 4]] + 1)) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && 0 <= head) && s == 0) && #NULL == 0) || (((((((((((((((((((((((((((((((s == \result && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && len <= 0) && 1 <= data) && head == s) && head == head) && data == len + i) && data == 1) && data <= 1) && data == \old(data)) && \old(len) <= 2) && len + i == new_data) && s == head) && \result == head) && #NULL == 0) && index == i) && head == s) && \result == s) && new_data <= 3) && 0 < index) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && \old(index) == i) && !(#memory_$Pointer$[head][4] == head)) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((\old(data) <= 3 && \valid[temp] == 1) && 0 <= head) && \valid[head] == 1) && 1 <= \old(data)) && temp == 0) && \old(data) <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 1) && data == 1) && head <= 0) && data <= 1) && \old(len) <= 2) && len == 2) && #NULL == 0) && 0 <= \result) && \old(index) <= 1) && i <= 1) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= \old(len)) && len == i + 1) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || (((((data + 1 <= 2 * len && (forall v_prenex_6 : int, v_ArrVal_399 : [int]int :: head == #memory_$Pointer$[head := v_ArrVal_399][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_prenex_6][s + 4])) && (forall v_prenex_4 : int, v_ArrVal_397 : [int]int :: #memory_$Pointer$[head := v_ArrVal_397][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_prenex_4][s + 4] == head)) && (forall v_prenex_6 : int, v_ArrVal_399 : [int]int :: !(#memory_$Pointer$[head := v_ArrVal_399][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_prenex_6][s + 4] == s))) && 2 * len <= data + 1) && (forall v_ArrVal_399 : [int]int, v_ArrVal_403 : int :: !(#memory_$Pointer$[head := v_ArrVal_399][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_403][s + 4] == s))))) && !(#memory_$Pointer$[head][4] == head)) && 0 <= head) && s == 0) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2021-11-25 18:51:20,688 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaef71b7-d308-4035-bc8c-338a7e3f1522/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE