./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW --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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 15:02:03,834 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:02:03,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:02:03,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:02:03,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:02:03,884 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:02:03,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:02:03,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:02:03,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:02:03,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:02:03,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:02:03,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:02:03,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:02:03,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:02:03,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:02:03,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:02:03,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:02:03,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:02:03,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:02:03,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:02:03,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:02:03,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:02:03,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:02:03,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:02:03,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:02:03,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:02:03,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:02:03,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:02:03,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:02:03,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:02:03,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:02:03,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:02:03,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:02:03,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:02:03,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:02:03,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:02:03,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:02:03,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:02:03,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:02:03,950 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:02:03,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:02:03,952 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 15:02:03,991 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:02:03,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:02:03,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:02:03,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:02:03,993 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:02:03,994 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:02:03,994 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:02:03,994 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:02:03,994 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:02:03,995 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:02:03,996 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:02:03,996 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:02:03,996 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:02:03,997 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:02:03,997 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:02:03,997 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:02:03,998 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:02:03,998 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:02:03,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:02:04,000 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:02:04,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:02:04,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:02:04,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:02:04,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 15:02:04,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:02:04,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 15:02:04,003 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:02:04,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 15:02:04,003 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:02:04,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 15:02:04,004 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:02:04,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:02:04,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:02:04,005 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:02:04,005 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:02:04,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:02:04,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 15:02:04,006 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:02:04,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:02:04,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 15:02:04,007 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:02:04,008 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/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_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2022-11-23 15:02:04,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:02:04,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:02:04,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:02:04,334 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:02:04,335 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:02:04,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-11-23 15:02:07,257 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:02:07,565 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:02:07,571 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-11-23 15:02:07,587 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/data/16ed4ddf5/01fedc0184e2477abe3ed80e7adaba27/FLAGf3c65029a [2022-11-23 15:02:07,606 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/data/16ed4ddf5/01fedc0184e2477abe3ed80e7adaba27 [2022-11-23 15:02:07,609 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:02:07,611 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:02:07,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:02:07,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:02:07,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:02:07,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:02:07" (1/1) ... [2022-11-23 15:02:07,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478973b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:02:07, skipping insertion in model container [2022-11-23 15:02:07,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:02:07" (1/1) ... [2022-11-23 15:02:07,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:02:07,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:02:07,951 WARN L237 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_629f2fb2-910b-4195-b8b5-8723b4109f0a/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-11-23 15:02:07,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:02:07,965 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:02:08,009 WARN L237 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_629f2fb2-910b-4195-b8b5-8723b4109f0a/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-11-23 15:02:08,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:02:08,044 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:02:08,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:02:08 WrapperNode [2022-11-23 15:02:08,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:02:08,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:02:08,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:02:08,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:02:08,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:02:08" (1/1) ... [2022-11-23 15:02:08,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:02:08" (1/1) ... [2022-11-23 15:02:08,120 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 127 [2022-11-23 15:02:08,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:02:08,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:02:08,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:02:08,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:02:08,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:02:08" (1/1) ... [2022-11-23 15:02:08,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:02:08" (1/1) ... [2022-11-23 15:02:08,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:02:08" (1/1) ... [2022-11-23 15:02:08,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:02:08" (1/1) ... [2022-11-23 15:02:08,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:02:08" (1/1) ... [2022-11-23 15:02:08,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:02:08" (1/1) ... [2022-11-23 15:02:08,175 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:02:08" (1/1) ... [2022-11-23 15:02:08,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:02:08" (1/1) ... [2022-11-23 15:02:08,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:02:08,185 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:02:08,185 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:02:08,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:02:08,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:02:08" (1/1) ... [2022-11-23 15:02:08,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:02:08,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:02:08,219 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:02:08,244 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:02:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 15:02:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 15:02:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-23 15:02:08,268 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-23 15:02:08,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 15:02:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:02:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 15:02:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 15:02:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 15:02:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:02:08,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:02:08,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:02:08,460 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:02:08,462 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:02:08,815 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:02:08,860 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:02:08,861 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-23 15:02:08,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:02:08 BoogieIcfgContainer [2022-11-23 15:02:08,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:02:08,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:02:08,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:02:08,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:02:08,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:02:07" (1/3) ... [2022-11-23 15:02:08,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ddce513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:02:08, skipping insertion in model container [2022-11-23 15:02:08,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:02:08" (2/3) ... [2022-11-23 15:02:08,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ddce513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:02:08, skipping insertion in model container [2022-11-23 15:02:08,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:02:08" (3/3) ... [2022-11-23 15:02:08,873 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2022-11-23 15:02:08,893 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:02:08,893 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 15:02:08,943 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:02:08,948 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1cc7e147, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:02:08,948 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 15:02:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:02:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 15:02:08,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:08,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:08,962 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:02:08,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:08,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1720119795, now seen corresponding path program 1 times [2022-11-23 15:02:08,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:02:08,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979615415] [2022-11-23 15:02:08,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:08,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:02:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:02:09,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:02:09,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979615415] [2022-11-23 15:02:09,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979615415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:02:09,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:02:09,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:02:09,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185907417] [2022-11-23 15:02:09,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:02:09,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:02:09,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:02:09,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:02:09,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:02:09,442 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 15:02:09,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:09,518 INFO L93 Difference]: Finished difference Result 37 states and 54 transitions. [2022-11-23 15:02:09,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:02:09,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-23 15:02:09,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:09,527 INFO L225 Difference]: With dead ends: 37 [2022-11-23 15:02:09,527 INFO L226 Difference]: Without dead ends: 19 [2022-11-23 15:02:09,530 INFO L412 NwaCegarLoop]: 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 [2022-11-23 15:02:09,534 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 35 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 [2022-11-23 15:02:09,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 35 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:02:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-23 15:02:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-11-23 15:02:09,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:02:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2022-11-23 15:02:09,573 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 12 [2022-11-23 15:02:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:09,574 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-11-23 15:02:09,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-23 15:02:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2022-11-23 15:02:09,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 15:02:09,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:09,577 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:09,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 15:02:09,578 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:02:09,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:09,579 INFO L85 PathProgramCache]: Analyzing trace with hash -331774145, now seen corresponding path program 1 times [2022-11-23 15:02:09,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:02:09,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550315193] [2022-11-23 15:02:09,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:09,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:02:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:02:09,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:02:09,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550315193] [2022-11-23 15:02:09,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550315193] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:02:09,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633632533] [2022-11-23 15:02:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:09,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:09,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:02:09,987 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:02:09,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 15:02:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:10,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-23 15:02:10,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:02:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 15:02:10,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:02:10,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633632533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:02:10,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:02:10,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-23 15:02:10,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328686901] [2022-11-23 15:02:10,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:02:10,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:02:10,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:02:10,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:02:10,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:02:10,274 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 15:02:10,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:10,353 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-11-23 15:02:10,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:02:10,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-11-23 15:02:10,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:10,356 INFO L225 Difference]: With dead ends: 29 [2022-11-23 15:02:10,357 INFO L226 Difference]: Without dead ends: 24 [2022-11-23 15:02:10,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:02:10,358 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:02:10,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:02:10,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-23 15:02:10,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2022-11-23 15:02:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:02:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-11-23 15:02:10,364 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 18 [2022-11-23 15:02:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:10,365 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-11-23 15:02:10,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 15:02:10,365 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-11-23 15:02:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 15:02:10,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:10,366 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:10,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-23 15:02:10,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-11-23 15:02:10,567 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:02:10,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:10,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1883542642, now seen corresponding path program 1 times [2022-11-23 15:02:10,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:02:10,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73973611] [2022-11-23 15:02:10,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:10,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:02:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 15:02:10,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:02:10,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73973611] [2022-11-23 15:02:10,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73973611] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:02:10,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673956450] [2022-11-23 15:02:10,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:10,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:10,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:02:10,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:02:10,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 15:02:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:10,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 15:02:10,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:02:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 15:02:10,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:02:10,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673956450] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:02:10,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:02:10,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2022-11-23 15:02:10,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400077789] [2022-11-23 15:02:10,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:02:10,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:02:10,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:02:10,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:02:10,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:02:10,982 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 15:02:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:11,047 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-11-23 15:02:11,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:02:11,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-11-23 15:02:11,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:11,048 INFO L225 Difference]: With dead ends: 32 [2022-11-23 15:02:11,049 INFO L226 Difference]: Without dead ends: 25 [2022-11-23 15:02:11,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-23 15:02:11,050 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 37 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.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:02:11,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 37 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:02:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-23 15:02:11,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-11-23 15:02:11,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:02:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-11-23 15:02:11,057 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 20 [2022-11-23 15:02:11,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:11,057 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-23 15:02:11,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 15:02:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-11-23 15:02:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 15:02:11,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:11,059 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:11,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 15:02:11,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:11,264 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:02:11,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:11,265 INFO L85 PathProgramCache]: Analyzing trace with hash -346740024, now seen corresponding path program 1 times [2022-11-23 15:02:11,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:02:11,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95265734] [2022-11-23 15:02:11,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:11,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:02:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-23 15:02:11,370 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:02:11,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95265734] [2022-11-23 15:02:11,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95265734] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:02:11,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123304704] [2022-11-23 15:02:11,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:11,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:11,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:02:11,372 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:02:11,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 15:02:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:11,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 15:02:11,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:02:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 15:02:11,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:02:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 15:02:11,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123304704] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:02:11,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1871603148] [2022-11-23 15:02:11,630 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-23 15:02:11,630 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:02:11,634 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:02:11,639 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:02:11,640 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:02:11,720 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:11,730 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:11,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:11,761 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 15:02:11,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:11,772 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 15:02:11,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:11,783 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 15:02:12,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:12,273 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:12,282 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:12,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:12,305 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:12,316 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:12,319 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:12,321 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:12,323 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:12,326 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:12,644 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 3 [2022-11-23 15:02:12,660 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:12,672 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:12,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:12,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:12,708 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:12,710 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:12,713 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:12,715 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:12,717 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:12,774 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2022-11-23 15:02:12,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:12,790 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 15:02:12,800 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 15:02:13,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:13,051 INFO L350 Elim1Store]: Elim1 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 140 treesize of output 124 [2022-11-23 15:02:13,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:13,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 124 [2022-11-23 15:02:13,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:13,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2022-11-23 15:02:13,356 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:13,368 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:13,378 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:13,502 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:02:13,510 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-23 15:02:13,521 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:02:13,628 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-23 15:02:13,637 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:02:13,657 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:02:13,792 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-23 15:02:13,912 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:02:15,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1871603148] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:02:15,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:02:15,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [5, 5, 5] total 18 [2022-11-23 15:02:15,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94006564] [2022-11-23 15:02:15,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:02:15,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 15:02:15,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:02:15,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 15:02:15,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-11-23 15:02:15,953 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:02:17,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:17,388 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-11-23 15:02:17,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 15:02:17,389 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-11-23 15:02:17,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:17,390 INFO L225 Difference]: With dead ends: 45 [2022-11-23 15:02:17,390 INFO L226 Difference]: Without dead ends: 40 [2022-11-23 15:02:17,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2022-11-23 15:02:17,391 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:02:17,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 24 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 15:02:17,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-23 15:02:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 21. [2022-11-23 15:02:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:02:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-11-23 15:02:17,410 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 21 [2022-11-23 15:02:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:17,411 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-11-23 15:02:17,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:02:17,411 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-11-23 15:02:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 15:02:17,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:17,412 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:17,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-23 15:02:17,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:17,618 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:02:17,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:17,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2133674101, now seen corresponding path program 1 times [2022-11-23 15:02:17,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:02:17,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543308563] [2022-11-23 15:02:17,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:17,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:02:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 15:02:17,768 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:02:17,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543308563] [2022-11-23 15:02:17,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543308563] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:02:17,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359505247] [2022-11-23 15:02:17,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:17,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:17,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:02:17,771 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:02:17,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 15:02:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:17,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 15:02:17,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:02:17,924 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 15:02:17,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:02:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 15:02:17,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359505247] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:02:17,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [713007676] [2022-11-23 15:02:17,968 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-23 15:02:17,968 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:02:17,969 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:02:17,969 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:02:17,969 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:02:17,998 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:18,003 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:18,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:18,014 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 15:02:18,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:18,021 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 15:02:18,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:18,031 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 15:02:18,333 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:18,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:18,354 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 3 [2022-11-23 15:02:18,363 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:18,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:18,381 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:18,383 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:18,385 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:18,387 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:18,389 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:18,606 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:18,616 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:18,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:18,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:18,645 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:18,656 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:18,657 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:18,659 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:18,662 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:18,663 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:18,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:18,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:18,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 177 [2022-11-23 15:02:18,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:18,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 179 [2022-11-23 15:02:18,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:18,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 96 [2022-11-23 15:02:18,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:18,939 INFO L350 Elim1Store]: Elim1 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 134 treesize of output 118 [2022-11-23 15:02:18,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:18,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 118 [2022-11-23 15:02:18,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:18,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2022-11-23 15:02:19,137 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:19,148 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:19,160 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:19,293 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-23 15:02:19,306 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:02:19,316 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:02:19,512 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-23 15:02:19,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 130 [2022-11-23 15:02:19,557 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-23 15:02:19,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 126 [2022-11-23 15:02:19,636 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-23 15:02:19,917 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-23 15:02:20,013 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:02:22,774 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '791#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (<= |ULTIMATE.start_sll_circular_create_~last~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_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (= (+ |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 1 |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) (= |#NULL.base| 0))' at error location [2022-11-23 15:02:22,774 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:02:22,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:02:22,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-11-23 15:02:22,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846288952] [2022-11-23 15:02:22,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:02:22,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:02:22,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:02:22,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:02:22,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-11-23 15:02:22,777 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 15:02:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:22,876 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-11-23 15:02:22,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:02:22,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2022-11-23 15:02:22,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:22,879 INFO L225 Difference]: With dead ends: 37 [2022-11-23 15:02:22,879 INFO L226 Difference]: Without dead ends: 30 [2022-11-23 15:02:22,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2022-11-23 15:02:22,880 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:02:22,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:02:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-23 15:02:22,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2022-11-23 15:02:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-23 15:02:22,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-11-23 15:02:22,893 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 22 [2022-11-23 15:02:22,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:22,894 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-11-23 15:02:22,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 15:02:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-11-23 15:02:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 15:02:22,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:22,895 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:22,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 15:02:23,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:23,105 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:02:23,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:23,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1729436602, now seen corresponding path program 2 times [2022-11-23 15:02:23,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:02:23,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052970206] [2022-11-23 15:02:23,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:23,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:02:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:02:25,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:02:25,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052970206] [2022-11-23 15:02:25,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052970206] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:02:25,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85702461] [2022-11-23 15:02:25,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:02:25,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:25,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:02:25,210 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:02:25,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 15:02:25,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-23 15:02:25,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:02:25,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-23 15:02:25,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:02:25,463 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:25,622 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 15:02:25,622 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:25,684 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-23 15:02:25,692 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-23 15:02:25,751 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:02:25,751 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 30 [2022-11-23 15:02:25,759 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 9 [2022-11-23 15:02:25,968 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 15:02:25,968 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 55 [2022-11-23 15:02:25,973 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 21 [2022-11-23 15:02:25,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:25,982 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 34 [2022-11-23 15:02:26,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:26,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-11-23 15:02:26,167 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 30 [2022-11-23 15:02:26,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:26,175 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:26,376 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 21 [2022-11-23 15:02:26,380 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 13 [2022-11-23 15:02:26,425 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2022-11-23 15:02:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:02:26,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:02:27,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:02:27,316 INFO L350 Elim1Store]: Elim1 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 50 treesize of output 51 [2022-11-23 15:02:27,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:02:27,330 INFO L350 Elim1Store]: Elim1 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 104 treesize of output 103 [2022-11-23 15:02:27,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-23 15:02:27,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:02:27,395 INFO L350 Elim1Store]: Elim1 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 48 treesize of output 49 [2022-11-23 15:02:27,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:02:27,408 INFO L350 Elim1Store]: Elim1 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 100 treesize of output 99 [2022-11-23 15:02:27,416 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 21 [2022-11-23 15:02:27,473 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~len~0#1| 2))) (and (< |c_ULTIMATE.start_sll_circular_update_at_~data#1| .cse0) (<= .cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| Int)) (or (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_454 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_447) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| 4) v_ArrVal_454) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (not (<= |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| Int)) (or (not (<= |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29|)) (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_452 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| 4) v_ArrVal_452) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| Int)) (or (not (<= |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29|)) (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_452 Int)) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| 4) v_ArrVal_452) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) is different from false [2022-11-23 15:02:27,516 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (< |c_ULTIMATE.start_sll_circular_update_at_~data#1| .cse0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| Int)) (or (not (<= |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29|)) (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_452 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_449) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| 4) v_ArrVal_452) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (<= .cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| Int)) (or (not (<= |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29|)) (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_452 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_449) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| 4) v_ArrVal_452) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| Int)) (or (not (<= |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29|)) (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_454 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_447) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| 4) v_ArrVal_454) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))))))) is different from false [2022-11-23 15:02:27,562 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| Int)) (or (not (<= |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29|)) (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_452 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_449) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| 4) v_ArrVal_452) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| Int)) (or (not (<= |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29|)) (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_452 Int)) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_449) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| 4) v_ArrVal_452) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (< |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~len~0#1|) (<= |c_ULTIMATE.start_main_~len~0#1| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| Int)) (or (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_454 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_447) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| 4) v_ArrVal_454) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29|)))))) is different from false [2022-11-23 15:02:27,610 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_445 (Array Int Int)) (v_ArrVal_444 (Array Int Int))) (or (not (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29|)) (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_454 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_444))) (= (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select (store (select (store .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_445) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_447) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| 4) v_ArrVal_454) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_445 (Array Int Int))) (or (not (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29|)) (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_452 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_445))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_449)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| 4) v_ArrVal_452) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| Int) (v_ArrVal_445 (Array Int Int))) (or (not (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29|)) (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_452 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_445))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse2 (select (store (select (store .cse3 .cse2 v_ArrVal_449) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| 4) v_ArrVal_452) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))) is different from false [2022-11-23 15:02:27,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 15:02:27,633 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 41 [2022-11-23 15:02:27,638 INFO L350 Elim1Store]: Elim1 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 210 treesize of output 188 [2022-11-23 15:02:27,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:27,644 INFO L350 Elim1Store]: Elim1 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 162 treesize of output 154 [2022-11-23 15:02:27,653 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:27,655 INFO L350 Elim1Store]: Elim1 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 142 treesize of output 124 [2022-11-23 15:02:27,663 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:27,665 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 82 [2022-11-23 15:02:27,725 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 15:02:27,726 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 1 [2022-11-23 15:02:27,732 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 15:02:27,733 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 1 [2022-11-23 15:02:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-23 15:02:28,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85702461] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:02:28,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [344272796] [2022-11-23 15:02:28,204 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-23 15:02:28,204 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:02:28,204 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:02:28,205 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:02:28,205 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:02:28,221 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:28,225 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:28,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:28,233 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 15:02:28,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:28,240 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 15:02:28,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:28,250 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 15:02:28,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:28,461 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:28,477 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:28,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:28,493 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:28,503 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:28,505 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:28,507 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:28,508 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:28,510 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:28,682 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:28,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:28,703 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 3 [2022-11-23 15:02:28,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:28,721 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:28,731 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:28,733 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:28,735 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:28,737 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:28,738 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:02:28,773 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2022-11-23 15:02:28,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:28,784 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 15:02:28,794 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 15:02:28,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:28,947 INFO L350 Elim1Store]: Elim1 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 140 treesize of output 124 [2022-11-23 15:02:28,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:28,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 124 [2022-11-23 15:02:28,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:28,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 120 [2022-11-23 15:02:29,157 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:29,165 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:29,173 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:29,272 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:02:29,280 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-23 15:02:29,292 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:02:29,377 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:02:29,385 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-23 15:02:29,393 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:02:29,566 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-23 15:02:29,667 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:02:32,636 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1102#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-23 15:02:32,636 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:02:32,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:02:32,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 56 [2022-11-23 15:02:32,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536850393] [2022-11-23 15:02:32,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:02:32,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-23 15:02:32,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:02:32,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-23 15:02:32,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=4015, Unknown=29, NotChecked=524, Total=4830 [2022-11-23 15:02:32,642 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 56 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 48 states have internal predecessors, (55), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 15:02:40,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:40,179 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2022-11-23 15:02:40,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 15:02:40,179 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 48 states have internal predecessors, (55), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 24 [2022-11-23 15:02:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:40,182 INFO L225 Difference]: With dead ends: 59 [2022-11-23 15:02:40,182 INFO L226 Difference]: Without dead ends: 57 [2022-11-23 15:02:40,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=476, Invalid=5991, Unknown=29, NotChecked=644, Total=7140 [2022-11-23 15:02:40,186 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 178 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 22 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:02:40,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 363 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 942 Invalid, 13 Unknown, 148 Unchecked, 1.1s Time] [2022-11-23 15:02:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-23 15:02:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2022-11-23 15:02:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:02:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-11-23 15:02:40,211 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 24 [2022-11-23 15:02:40,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:40,211 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-11-23 15:02:40,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 48 states have internal predecessors, (55), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 15:02:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-11-23 15:02:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 15:02:40,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:40,213 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:40,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 15:02:40,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:40,419 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:02:40,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:40,419 INFO L85 PathProgramCache]: Analyzing trace with hash 113145472, now seen corresponding path program 3 times [2022-11-23 15:02:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:02:40,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383147445] [2022-11-23 15:02:40,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:40,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:02:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 15:02:40,563 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:02:40,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383147445] [2022-11-23 15:02:40,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383147445] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:02:40,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965068382] [2022-11-23 15:02:40,564 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 15:02:40,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:40,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:02:40,565 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:02:40,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 15:02:40,713 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 15:02:40,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:02:40,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 15:02:40,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:02:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 15:02:40,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:02:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 15:02:40,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965068382] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:02:40,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [118377483] [2022-11-23 15:02:40,821 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-23 15:02:40,821 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:02:40,821 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:02:40,822 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:02:40,822 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:02:40,847 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:40,852 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:40,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:40,861 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 15:02:40,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:40,868 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 15:02:40,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:40,878 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 15:02:40,969 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:40,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:40,988 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:40,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:41,006 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:41,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:41,048 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:41,056 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:41,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:41,074 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:41,104 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 15:02:41,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:41,116 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 15:02:41,126 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2022-11-23 15:02:41,198 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:41,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:41,219 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:41,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:41,235 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:41,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:41,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:41,286 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:41,296 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:41,307 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:41,338 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2022-11-23 15:02:41,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:41,349 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 15:02:41,361 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 15:02:41,426 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:41,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:41,444 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:41,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:41,464 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:41,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:41,508 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:41,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:41,527 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:41,537 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:41,594 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 15:02:41,594 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2022-11-23 15:02:41,609 INFO L350 Elim1Store]: Elim1 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 11 [2022-11-23 15:02:41,634 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 15:02:41,635 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2022-11-23 15:02:41,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:41,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:42,039 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-23 15:02:42,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 331 treesize of output 309 [2022-11-23 15:02:42,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:42,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:42,116 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-23 15:02:42,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 331 treesize of output 309 [2022-11-23 15:02:42,154 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-23 15:02:42,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 325 treesize of output 324 [2022-11-23 15:02:42,497 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-23 15:02:42,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 140 [2022-11-23 15:02:42,534 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-23 15:02:42,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 136 [2022-11-23 15:02:42,623 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-23 15:02:42,877 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 79 for LOIs [2022-11-23 15:02:43,017 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:02:47,624 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1467#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (= (+ |ULTIMATE.start_sll_circular_get_data_at_~index#1| 1) |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 1 |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|)) (= |#NULL.base| 0))' at error location [2022-11-23 15:02:47,624 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:02:47,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:02:47,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-11-23 15:02:47,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698198621] [2022-11-23 15:02:47,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:02:47,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 15:02:47,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:02:47,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 15:02:47,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2022-11-23 15:02:47,627 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 15:02:47,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:47,921 INFO L93 Difference]: Finished difference Result 56 states and 78 transitions. [2022-11-23 15:02:47,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 15:02:47,922 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-11-23 15:02:47,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:47,923 INFO L225 Difference]: With dead ends: 56 [2022-11-23 15:02:47,923 INFO L226 Difference]: Without dead ends: 47 [2022-11-23 15:02:47,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=131, Invalid=799, Unknown=0, NotChecked=0, Total=930 [2022-11-23 15:02:47,924 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:02:47,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 81 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:02:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-23 15:02:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2022-11-23 15:02:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:02:47,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-11-23 15:02:47,952 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 25 [2022-11-23 15:02:47,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:47,952 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-11-23 15:02:47,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 15:02:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-11-23 15:02:47,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 15:02:47,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:47,953 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:47,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 15:02:48,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-23 15:02:48,160 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:02:48,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2075214153, now seen corresponding path program 4 times [2022-11-23 15:02:48,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:02:48,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363074583] [2022-11-23 15:02:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:48,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:02:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-23 15:02:48,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:02:48,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363074583] [2022-11-23 15:02:48,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363074583] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:02:48,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472653401] [2022-11-23 15:02:48,316 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 15:02:48,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:48,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:02:48,320 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:02:48,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 15:02:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:48,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:02:48,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:02:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 15:02:48,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:02:48,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472653401] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:02:48,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:02:48,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2022-11-23 15:02:48,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996058472] [2022-11-23 15:02:48,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:02:48,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:02:48,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:02:48,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:02:48,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:02:48,502 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 15:02:48,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:48,579 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-11-23 15:02:48,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:02:48,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-11-23 15:02:48,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:48,581 INFO L225 Difference]: With dead ends: 43 [2022-11-23 15:02:48,582 INFO L226 Difference]: Without dead ends: 38 [2022-11-23 15:02:48,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-11-23 15:02:48,584 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:02:48,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 31 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:02:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-23 15:02:48,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-23 15:02:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:02:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2022-11-23 15:02:48,642 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 25 [2022-11-23 15:02:48,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:48,643 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2022-11-23 15:02:48,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 15:02:48,643 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2022-11-23 15:02:48,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 15:02:48,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:48,649 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:48,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 15:02:48,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:48,855 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:02:48,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:48,856 INFO L85 PathProgramCache]: Analyzing trace with hash 2125856015, now seen corresponding path program 5 times [2022-11-23 15:02:48,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:02:48,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515422794] [2022-11-23 15:02:48,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:48,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:02:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:49,001 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 15:02:49,002 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:02:49,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515422794] [2022-11-23 15:02:49,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515422794] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:02:49,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50453169] [2022-11-23 15:02:49,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:02:49,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:49,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:02:49,004 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:02:49,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 15:02:49,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 15:02:49,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:02:49,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 15:02:49,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:02:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 15:02:49,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:02:49,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50453169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:02:49,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:02:49,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2022-11-23 15:02:49,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770798223] [2022-11-23 15:02:49,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:02:49,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:02:49,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:02:49,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:02:49,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:02:49,772 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 15:02:49,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:02:49,870 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2022-11-23 15:02:49,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:02:49,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-11-23 15:02:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:02:49,872 INFO L225 Difference]: With dead ends: 70 [2022-11-23 15:02:49,873 INFO L226 Difference]: Without dead ends: 41 [2022-11-23 15:02:49,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-11-23 15:02:49,875 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:02:49,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 33 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:02:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-23 15:02:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-11-23 15:02:49,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:02:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2022-11-23 15:02:49,916 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 27 [2022-11-23 15:02:49,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:02:49,917 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2022-11-23 15:02:49,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-23 15:02:49,917 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2022-11-23 15:02:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 15:02:49,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:02:49,918 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:02:49,931 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 15:02:50,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:50,125 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:02:50,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:02:50,126 INFO L85 PathProgramCache]: Analyzing trace with hash 829532047, now seen corresponding path program 1 times [2022-11-23 15:02:50,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:02:50,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411339525] [2022-11-23 15:02:50,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:50,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:02:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:02:51,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:02:51,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411339525] [2022-11-23 15:02:51,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411339525] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:02:51,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866512169] [2022-11-23 15:02:51,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:02:51,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:02:51,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:02:51,526 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:02:51,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 15:02:51,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:02:51,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-23 15:02:51,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:02:51,868 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 13 [2022-11-23 15:02:52,080 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 7 [2022-11-23 15:02:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 15:02:52,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:02:52,368 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 32 [2022-11-23 15:02:52,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:52,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:52,538 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 15:02:52,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866512169] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:02:52,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1788851921] [2022-11-23 15:02:52,540 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-23 15:02:52,541 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:02:52,541 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:02:52,541 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:02:52,541 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:02:52,565 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:52,570 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:02:52,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:52,580 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 15:02:52,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:52,587 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 15:02:52,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:52,599 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 15:02:52,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:52,695 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:52,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:52,712 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:52,721 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:52,754 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:52,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:52,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:52,780 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:52,788 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:52,819 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2022-11-23 15:02:52,830 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 15:02:52,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:52,842 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 15:02:52,901 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:52,909 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:52,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:52,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:52,937 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:52,997 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:53,005 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:53,014 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:53,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:53,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:53,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:53,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:02:53,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 177 [2022-11-23 15:02:53,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:53,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 179 [2022-11-23 15:02:53,122 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:53,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 96 [2022-11-23 15:02:53,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:53,207 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:53,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:53,225 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:53,234 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:53,266 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:53,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:53,290 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:53,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:02:53,309 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:02:53,366 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 15:02:53,366 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2022-11-23 15:02:53,383 INFO L350 Elim1Store]: Elim1 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 11 [2022-11-23 15:02:53,406 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 15:02:53,406 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2022-11-23 15:02:53,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:53,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:53,762 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-23 15:02:53,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 331 treesize of output 309 [2022-11-23 15:02:53,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:53,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:02:53,830 INFO L321 Elim1Store]: treesize reduction 126, result has 14.9 percent of original size [2022-11-23 15:02:53,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 331 treesize of output 313 [2022-11-23 15:02:53,869 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-23 15:02:53,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 325 treesize of output 324 [2022-11-23 15:02:54,113 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-23 15:02:54,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 140 [2022-11-23 15:02:54,149 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-23 15:02:54,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 136 [2022-11-23 15:02:54,229 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-23 15:02:54,757 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 79 for LOIs [2022-11-23 15:02:54,958 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:03:00,322 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2364#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_~index#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-23 15:03:00,322 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:03:00,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:03:00,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 10] total 38 [2022-11-23 15:03:00,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626946020] [2022-11-23 15:03:00,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:03:00,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-23 15:03:00,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:03:00,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-23 15:03:00,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2486, Unknown=0, NotChecked=0, Total=2652 [2022-11-23 15:03:00,325 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 38 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 states have internal predecessors, (60), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 15:03:01,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:03:01,892 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-11-23 15:03:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-23 15:03:01,893 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 states have internal predecessors, (60), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2022-11-23 15:03:01,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:03:01,893 INFO L225 Difference]: With dead ends: 52 [2022-11-23 15:03:01,893 INFO L226 Difference]: Without dead ends: 48 [2022-11-23 15:03:01,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=413, Invalid=4417, Unknown=0, NotChecked=0, Total=4830 [2022-11-23 15:03:01,894 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 211 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 15:03:01,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 208 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 15:03:01,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-23 15:03:01,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2022-11-23 15:03:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:03:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-11-23 15:03:01,922 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 27 [2022-11-23 15:03:01,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:03:01,922 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-11-23 15:03:01,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 states have internal predecessors, (60), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-23 15:03:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-11-23 15:03:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-23 15:03:01,923 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:03:01,923 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:03:01,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-23 15:03:02,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:03:02,131 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:03:02,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:03:02,131 INFO L85 PathProgramCache]: Analyzing trace with hash -56597362, now seen corresponding path program 2 times [2022-11-23 15:03:02,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:03:02,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572387889] [2022-11-23 15:03:02,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:03:02,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:03:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:03:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 15:03:02,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:03:02,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572387889] [2022-11-23 15:03:02,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572387889] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:03:02,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648082944] [2022-11-23 15:03:02,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:03:02,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:03:02,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:03:02,276 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:03:02,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 15:03:02,458 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 15:03:02,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:03:02,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:03:02,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:03:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 15:03:02,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:03:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 15:03:02,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648082944] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:03:02,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1249889419] [2022-11-23 15:03:02,554 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-23 15:03:02,554 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:03:02,555 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:03:02,555 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:03:02,555 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:03:02,573 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:03:02,577 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:03:02,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:03:02,589 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 15:03:02,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:03:02,596 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 15:03:02,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:03:02,604 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 15:03:02,687 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:02,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:03:02,704 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:02,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:03:02,719 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:02,749 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:02,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:03:02,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:03:02,774 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:02,782 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:02,826 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2022-11-23 15:03:02,834 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 15:03:02,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:03:02,847 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 15:03:03,033 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:03,041 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:03,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:03:03,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:03:03,066 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:03,078 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,088 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,090 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,091 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,094 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,235 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:03,245 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:03,255 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:03,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:03:03,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:03:03,283 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,284 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,285 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,287 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,289 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,321 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 15:03:03,331 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2022-11-23 15:03:03,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:03:03,341 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 15:03:03,626 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,628 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,629 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,631 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,633 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,642 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:03,650 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:03,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:03:03,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:03:03,676 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:03,837 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:03,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:03:03,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:03:03,863 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:03,872 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:03,885 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,886 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,888 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,890 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,891 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:03,946 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 15:03:03,946 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2022-11-23 15:03:03,970 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 15:03:03,970 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 18 [2022-11-23 15:03:03,986 INFO L350 Elim1Store]: Elim1 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 11 [2022-11-23 15:03:04,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:03:04,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:03:04,280 INFO L321 Elim1Store]: treesize reduction 130, result has 12.2 percent of original size [2022-11-23 15:03:04,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 331 treesize of output 309 [2022-11-23 15:03:04,320 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-23 15:03:04,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 325 treesize of output 324 [2022-11-23 15:03:04,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:03:04,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 15:03:04,386 INFO L321 Elim1Store]: treesize reduction 126, result has 14.9 percent of original size [2022-11-23 15:03:04,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 323 treesize of output 305 [2022-11-23 15:03:04,673 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-23 15:03:04,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 142 [2022-11-23 15:03:04,711 INFO L321 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-11-23 15:03:04,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 138 [2022-11-23 15:03:04,783 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-23 15:03:05,037 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 75 for LOIs [2022-11-23 15:03:05,156 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:03:09,025 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2739#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (not (< 0 |ULTIMATE.start_sll_circular_get_data_at_~index#1|)) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-23 15:03:09,026 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:03:09,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:03:09,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-23 15:03:09,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194766472] [2022-11-23 15:03:09,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:03:09,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:03:09,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:03:09,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:03:09,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-11-23 15:03:09,027 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 15:03:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:03:09,206 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-11-23 15:03:09,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:03:09,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-11-23 15:03:09,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:03:09,207 INFO L225 Difference]: With dead ends: 41 [2022-11-23 15:03:09,207 INFO L226 Difference]: Without dead ends: 25 [2022-11-23 15:03:09,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-11-23 15:03:09,208 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:03:09,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 37 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:03:09,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-23 15:03:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-23 15:03:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-23 15:03:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-11-23 15:03:09,221 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 28 [2022-11-23 15:03:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:03:09,221 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-11-23 15:03:09,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-23 15:03:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-11-23 15:03:09,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 15:03:09,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:03:09,222 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:03:09,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 15:03:09,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-23 15:03:09,427 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:03:09,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:03:09,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1330979448, now seen corresponding path program 6 times [2022-11-23 15:03:09,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:03:09,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449588851] [2022-11-23 15:03:09,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:03:09,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:03:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:03:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-23 15:03:09,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:03:09,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449588851] [2022-11-23 15:03:09,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449588851] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:03:09,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896168637] [2022-11-23 15:03:09,516 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 15:03:09,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:03:09,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:03:09,517 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:03:09,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 15:03:09,859 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 15:03:09,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:03:09,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-23 15:03:09,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:03:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 15:03:09,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:03:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 15:03:10,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896168637] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:03:10,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1113448500] [2022-11-23 15:03:10,029 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-23 15:03:10,030 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:03:10,030 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:03:10,030 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:03:10,030 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:03:10,046 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:03:10,050 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:03:10,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:03:10,084 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2022-11-23 15:03:10,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:03:10,091 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 15:03:10,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:03:10,107 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 7 [2022-11-23 15:03:10,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:03:10,306 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 3 [2022-11-23 15:03:10,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:03:10,323 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:10,330 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:10,338 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:10,340 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:10,341 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:10,342 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:10,344 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:10,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:03:10,462 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 3 [2022-11-23 15:03:10,470 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:10,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 15:03:10,486 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-11-23 15:03:10,496 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:10,497 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:10,498 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:10,500 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:10,502 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 15:03:10,531 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2022-11-23 15:03:10,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 15:03:10,541 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 23 treesize of output 11 [2022-11-23 15:03:10,551 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-23 15:03:10,663 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:03:10,669 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:03:10,676 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:03:10,832 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:03:10,839 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:03:10,852 INFO L350 Elim1Store]: Elim1 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 [2022-11-23 15:03:10,948 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-23 15:03:10,958 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:03:10,966 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:03:11,058 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 9 [2022-11-23 15:03:11,066 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:03:11,077 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 1 [2022-11-23 15:03:11,217 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 54 for LOIs [2022-11-23 15:03:11,302 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:03:13,182 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3060#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 0 (+ |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483648)) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~index#1| 1) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (not (= |ULTIMATE.start_sll_circular_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_get_data_at_#res#1| 2147483647) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-23 15:03:13,182 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:03:13,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:03:13,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 12 [2022-11-23 15:03:13,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991269897] [2022-11-23 15:03:13,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:03:13,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 15:03:13,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:03:13,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 15:03:13,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2022-11-23 15:03:13,184 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-23 15:03:13,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:03:13,256 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-11-23 15:03:13,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:03:13,256 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 30 [2022-11-23 15:03:13,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:03:13,256 INFO L225 Difference]: With dead ends: 28 [2022-11-23 15:03:13,256 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 15:03:13,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2022-11-23 15:03:13,258 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:03:13,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:03:13,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 15:03:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 15:03:13,259 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) [2022-11-23 15:03:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 15:03:13,259 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-11-23 15:03:13,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:03:13,259 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 15:03:13,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 5 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-23 15:03:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 15:03:13,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 15:03:13,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 15:03:13,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 15:03:13,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-23 15:03:13,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 15:03:18,992 INFO L902 garLoopResultBuilder]: At program point L638(lines 620 639) the Hoare annotation is: true [2022-11-23 15:03:18,993 INFO L895 garLoopResultBuilder]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse47 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse45 (+ |ULTIMATE.start_sll_circular_update_at_~index#1| 1)) (.cse48 (+ |ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse2 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse3 (<= 0 .cse48)) (.cse12 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 1)) (.cse14 (<= |ULTIMATE.start_sll_circular_update_at_~data#1| 3)) (.cse17 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse28 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse32 (<= 1 |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse33 (<= 0 .cse45)) (.cse35 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse39 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse0 (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse47)) (.cse1 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse4 (<= |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_sll_circular_update_at_#in~data#1| 3)) (.cse6 (<= 0 (+ |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1))) (.cse7 (<= 1 |ULTIMATE.start_main_~new_data~0#1|)) (.cse8 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse9 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse10 (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse11 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse13 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2)) (.cse15 (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (.cse16 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse18 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse44 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse19 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse20 (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_sll_circular_update_at_~data#1|)) (.cse21 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse22 (<= 1 |ULTIMATE.start_sll_circular_update_at_#in~data#1|)) (.cse23 (<= |ULTIMATE.start_sll_circular_update_at_#in~index#1| 1)) (.cse24 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse25 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse29 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse30 (= |#NULL.offset| 0)) (.cse31 (<= 0 |ULTIMATE.start_sll_circular_update_at_#in~head#1.offset|)) (.cse34 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse36 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse37 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_update_at_~index#1|)) (.cse38 (<= 0 |#StackHeapBarrier|)) (.cse43 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse46 (= |ULTIMATE.start_main_~len~0#1| .cse48)) (.cse40 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse47))) (.cse41 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)) (.cse42 (= |#NULL.base| 0))) (or (let ((.cse27 (* |ULTIMATE.start_main_~len~0#1| 2)) (.cse26 (+ (select (select |#memory_int| (select .cse43 |ULTIMATE.start_main_~s~0#1.offset|)) 4) 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 0) |ULTIMATE.start_main_~s~0#1.base|)) .cse19 .cse20 (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse21 .cse22 .cse23 .cse24 .cse25 (<= .cse26 .cse27) .cse28 .cse29 .cse30 .cse31 .cse32 (<= .cse27 .cse26) .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse41 .cse42)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) .cse7 .cse8 .cse10 (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| Int)) (or (forall ((v_ArrVal_449 (Array Int Int)) (v_ArrVal_452 Int)) (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_449) |ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| 4) v_ArrVal_452) |ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29|)))) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse44 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 (<= .cse45 |ULTIMATE.start_main_~i~0#1|) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse38 .cse39 .cse46 .cse40 .cse41 .cse42) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) .cse11 .cse13 .cse15 .cse16 .cse18 .cse44 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse29 .cse30 .cse31 .cse34 .cse36 .cse37 .cse38 (not (= (select .cse43 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |ULTIMATE.start_sll_circular_update_at_~head#1.base|)) .cse46 .cse40 .cse41 (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse42)))) [2022-11-23 15:03:18,993 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-23 15:03:18,993 INFO L899 garLoopResultBuilder]: For program point L631(lines 631 633) no Hoare annotation was computed. [2022-11-23 15:03:18,993 INFO L902 garLoopResultBuilder]: At program point L598-2(lines 598 602) the Hoare annotation is: true [2022-11-23 15:03:18,994 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse39 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse38 (* |ULTIMATE.start_main_~len~0#1| 2)) (.cse42 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (.cse41 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse43 (select .cse39 4)) (.cse40 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse40)) (.cse16 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse18 (<= .cse43 |ULTIMATE.start_main_~len~0#1|)) (.cse21 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 0)) (.cse22 (<= .cse41 (+ .cse43 1))) (.cse26 (<= .cse42 .cse41)) (.cse28 (<= .cse41 .cse42)) (.cse32 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))) (.cse33 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse40))) (.cse34 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0)) (.cse35 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)) (.cse1 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse3 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse5 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse6 (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse7 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse8 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2)) (.cse9 (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (.cse10 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse11 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse13 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse14 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse15 (= .cse38 (+ 2 |ULTIMATE.start_sll_circular_update_at_~data#1|))) (.cse17 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse19 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse20 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse23 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse24 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse25 (= |#NULL.offset| 0)) (.cse27 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse29 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse30 (<= 0 |#StackHeapBarrier|)) (.cse31 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse12 (select (select |#memory_int| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) (+ |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| 4))) (.cse36 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= .cse12 3) .cse13 .cse14 (= 3 |ULTIMATE.start_main_~expected~0#1|) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) (let ((.cse37 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_get_data_at_~head#1.base|) |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset|)) 4))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= |ULTIMATE.start_sll_circular_get_data_at_~index#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse21 .cse22 .cse23 .cse24 .cse25 (= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_sll_circular_get_data_at_#in~index#1|) .cse26 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.offset| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.offset|) .cse27 .cse28 .cse30 .cse32 .cse33 .cse34 .cse35 (= |ULTIMATE.start_sll_circular_get_data_at_~head#1.base| |ULTIMATE.start_sll_circular_get_data_at_#in~head#1.base|) (<= .cse37 |ULTIMATE.start_main_~expected~0#1|) (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse36 (<= |ULTIMATE.start_main_~expected~0#1| .cse37))) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= |ULTIMATE.start_main_~i~0#1| 0) .cse7 .cse8 (= .cse38 (+ (select .cse39 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) 2)) .cse9 .cse10 .cse11 .cse13 (= 2 |ULTIMATE.start_main_~expected~0#1|) .cse14 .cse15 (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse17 .cse19 .cse20 .cse23 .cse24 .cse25 .cse27 .cse29 .cse30 .cse31 (= .cse12 2) .cse36))))) [2022-11-23 15:03:18,994 INFO L895 garLoopResultBuilder]: At program point L632(lines 620 639) the Hoare annotation is: false [2022-11-23 15:03:18,994 INFO L895 garLoopResultBuilder]: At program point L625-3(lines 625 628) the Hoare annotation is: (let ((.cse8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse31 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse32 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse19 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse32)) (.cse1 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse23 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse3 (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse9 (select .cse31 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse24 (* |ULTIMATE.start_main_~len~0#1| 2)) (.cse5 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2)) (.cse6 (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (.cse7 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse25 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse10 (= .cse8 0)) (.cse11 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse26 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0)) (.cse12 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse13 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse14 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse28 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse15 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse16 (= |#NULL.offset| 0)) (.cse17 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse29 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse18 (<= 0 |#StackHeapBarrier|)) (.cse30 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse20 (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse32))) (.cse21 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0)) (.cse22 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) .cse4 .cse5 .cse6 .cse7 (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| Int)) (or (forall ((v_ArrVal_447 (Array Int Int)) (v_ArrVal_454 Int)) (= .cse8 (select (store (select (store |#memory_$Pointer$.offset| .cse9 v_ArrVal_447) |ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29| 4) v_ArrVal_454) |ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29|)))) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |ULTIMATE.start_main_~len~0#1| .cse19) .cse20 .cse21 (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse22) (let ((.cse27 (+ (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4) 1))) (and .cse0 .cse1 .cse23 .cse2 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse3 .cse4 .cse5 (= .cse24 (+ (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) 2)) .cse6 .cse7 .cse25 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (<= .cse19 0) .cse11 (= .cse24 (+ 2 |ULTIMATE.start_sll_circular_update_at_~data#1|)) .cse26 .cse12 .cse13 .cse14 (<= .cse27 .cse24) .cse28 .cse15 .cse16 (<= .cse24 .cse27) .cse17 .cse29 .cse18 .cse30 .cse20 (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) .cse21 .cse22)) (and .cse0 .cse1 .cse23 (= .cse24 (+ (select (select |#memory_int| .cse9) (+ .cse8 4)) 1)) .cse2 .cse3 (= .cse9 |ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse4 (= .cse24 (+ |ULTIMATE.start_sll_circular_update_at_~data#1| 1)) .cse5 .cse6 .cse7 .cse25 .cse10 (not (= (select .cse31 0) |ULTIMATE.start_main_~s~0#1.base|)) .cse11 .cse26 (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 (= .cse8 |ULTIMATE.start_sll_circular_update_at_~head#1.offset|) .cse17 .cse29 .cse18 .cse30 .cse20 .cse21 .cse22)))) [2022-11-23 15:03:18,994 INFO L895 garLoopResultBuilder]: At program point L584(line 584) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~data~0#1| |ULTIMATE.start_sll_circular_create_#in~data#1|) (= 2 (select |#length| 1)) (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= 27 (select |#length| 2)) (= (select .cse0 1) 0) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_~len#1|) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-23 15:03:18,995 INFO L899 garLoopResultBuilder]: For program point L584-1(line 584) no Hoare annotation was computed. [2022-11-23 15:03:18,995 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 637) no Hoare annotation was computed. [2022-11-23 15:03:18,995 INFO L895 garLoopResultBuilder]: At program point L586-2(lines 586 591) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse2 (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (.cse3 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse4 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse5 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse6 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (= |#NULL.offset| 0)) (.cse9 (= |#NULL.base| 0))) (or (let ((.cse8 (select |#memory_int| 1))) (and .cse0 .cse1 (= 2 (select |#length| 1)) .cse2 .cse3 (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) .cse4 .cse5 (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select |#valid| 0) 0) .cse6 (= (select |#valid| 2) 1) .cse7 (= (select .cse8 0) 48) (= 27 (select |#length| 2)) (= (select .cse8 1) 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_~len#1|) (< 0 |#StackHeapBarrier|) .cse9)) (let ((.cse10 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse10) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) .cse0 .cse1 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) .cse2 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ |ULTIMATE.start_sll_circular_create_~len#1| 1) |ULTIMATE.start_main_~len~0#1|) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse10)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) .cse9)))) [2022-11-23 15:03:18,995 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 15:03:18,995 INFO L899 garLoopResultBuilder]: For program point L595(lines 595 605) no Hoare annotation was computed. [2022-11-23 15:03:18,995 INFO L895 garLoopResultBuilder]: At program point L587(line 587) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (= (select |#valid| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_~len#1|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) [2022-11-23 15:03:18,996 INFO L899 garLoopResultBuilder]: For program point L587-1(line 587) no Hoare annotation was computed. [2022-11-23 15:03:18,996 INFO L899 garLoopResultBuilder]: For program point L596(lines 596 604) no Hoare annotation was computed. [2022-11-23 15:03:18,996 INFO L895 garLoopResultBuilder]: At program point L629-3(lines 629 634) the Hoare annotation is: (let ((.cse29 (* |ULTIMATE.start_main_~len~0#1| 2))) (let ((.cse3 (= |ULTIMATE.start_sll_circular_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse26 (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|)) (.cse10 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse12 (= .cse29 (+ 2 |ULTIMATE.start_sll_circular_update_at_~data#1|))) (.cse1 (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|)) (.cse27 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse28 (<= |ULTIMATE.start_sll_circular_get_data_at_~index#1| 0)) (.cse2 (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1)) (.cse4 (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0)) (.cse6 (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2)) (.cse7 (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|)) (.cse8 (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|)) (.cse9 (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse24 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse11 (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|)) (.cse13 (<= |ULTIMATE.start_sll_circular_create_~len#1| 1)) (.cse15 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse16 (<= |ULTIMATE.start_sll_circular_create_~data#1| 1)) (.cse18 (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) (.cse19 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse20 (= |#NULL.offset| 0)) (.cse22 (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse30 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse23 (<= 0 |#StackHeapBarrier|)) (.cse31 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse25 (= |#NULL.base| 0))) (or (let ((.cse14 (select .cse26 4)) (.cse17 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) (.cse21 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) 4)) (.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= |ULTIMATE.start_sll_circular_update_at_~index#1| 0) .cse13 (<= .cse14 |ULTIMATE.start_main_~len~0#1|) .cse15 .cse16 (<= .cse17 (+ .cse14 1)) .cse18 .cse19 .cse20 (<= .cse21 .cse17) .cse22 (<= .cse17 .cse21) .cse23 (= |ULTIMATE.start_main_~len~0#1| .cse24) (not (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_update_at_~head#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~head~0#1.base|) |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse25)) (and .cse1 .cse27 .cse28 .cse2 .cse3 .cse4 (= |ULTIMATE.start_main_~len~0#1| (+ 2 |ULTIMATE.start_main_~i~0#1|)) .cse5 .cse6 (= .cse29 (+ (select .cse26 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) 2)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse18 .cse19 .cse20 .cse22 .cse30 .cse23 .cse31 .cse25) (and .cse1 .cse27 .cse28 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse24 0) .cse11 .cse13 .cse15 .cse16 .cse18 .cse19 .cse20 .cse22 .cse30 .cse23 .cse31 .cse25)))) [2022-11-23 15:03:18,996 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2022-11-23 15:03:18,996 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-23 15:03:18,996 INFO L895 garLoopResultBuilder]: At program point node_createENTRY(lines 574 582) the Hoare annotation is: (or (not (<= 1 |node_create_#in~data#1|)) (not (= |#NULL.offset| 0)) (not (<= |node_create_#in~data#1| 1)) (not (= |#NULL.base| 0)) (not (<= 0 |#StackHeapBarrier|)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-11-23 15:03:18,996 INFO L899 garLoopResultBuilder]: For program point node_createEXIT(lines 574 582) no Hoare annotation was computed. [2022-11-23 15:03:18,999 INFO L444 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1] [2022-11-23 15:03:19,001 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:03:19,025 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,027 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,028 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,038 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,038 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,039 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,040 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,050 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,050 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,050 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,051 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,051 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,053 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,067 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,067 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,068 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,068 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,068 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,071 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,072 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,072 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,073 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,073 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,073 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,073 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,074 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,075 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_449,QUANTIFIED] [2022-11-23 15:03:19,075 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_452,QUANTIFIED] [2022-11-23 15:03:19,075 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] [2022-11-23 15:03:19,076 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] [2022-11-23 15:03:19,076 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,076 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,077 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,078 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,078 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,078 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,081 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,095 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,096 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,096 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,097 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,097 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,097 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,097 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,098 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,098 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_449,QUANTIFIED] [2022-11-23 15:03:19,098 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_452,QUANTIFIED] [2022-11-23 15:03:19,099 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] [2022-11-23 15:03:19,099 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] [2022-11-23 15:03:19,099 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,100 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,100 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,100 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,101 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,101 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,101 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,101 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,104 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,104 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,105 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,105 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_447,QUANTIFIED] [2022-11-23 15:03:19,105 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,106 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_454,QUANTIFIED] [2022-11-23 15:03:19,106 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] [2022-11-23 15:03:19,106 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] [2022-11-23 15:03:19,106 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,107 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,107 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,107 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,108 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,108 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,108 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,108 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,109 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,109 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,109 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,110 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,110 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,110 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,119 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,119 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,119 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,120 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,121 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,122 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_447,QUANTIFIED] [2022-11-23 15:03:19,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,123 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_454,QUANTIFIED] [2022-11-23 15:03:19,123 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] [2022-11-23 15:03:19,123 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] [2022-11-23 15:03:19,123 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,124 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,124 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,124 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,125 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,125 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,125 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,125 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,126 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,126 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,126 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,131 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,131 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,131 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,133 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,138 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,139 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,139 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,139 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,139 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,140 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,140 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,140 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,141 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,142 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,143 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,144 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,144 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,145 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,145 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,145 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,145 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,146 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,147 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,147 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,148 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,148 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,148 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,148 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:03:19 BoogieIcfgContainer [2022-11-23 15:03:19,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:03:19,152 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:03:19,152 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:03:19,152 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:03:19,153 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:02:08" (3/4) ... [2022-11-23 15:03:19,155 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 15:03:19,162 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2022-11-23 15:03:19,168 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-11-23 15:03:19,169 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2022-11-23 15:03:19,170 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-23 15:03:19,170 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-23 15:03:19,197 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && unknown-#in~data-unknown <= 1) && last <= 0) && head == 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && (forall v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29 : int :: (forall v_ArrVal_447 : [int]int, v_ArrVal_454 : int :: #memory_$Pointer$[s][s] == #memory_$Pointer$[#memory_$Pointer$[s][s] := v_ArrVal_447][s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29 + 4 := v_ArrVal_454][s]) || !(s <= v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29))) && #memory_$Pointer$[s][s] == 0) && 1 <= unknown-#in~data-unknown) && len <= 1) && data == 1) && data <= 1) && len == 2) && #NULL == 0) && 0 <= \result) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][head] == 0) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && 0 <= s) && unknown-#in~data-unknown <= 1) && head == s) && last <= 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && len * 2 == unknown-#memory_int-unknown[s][s + 4] + 2) && 0 <= last) && 1 <= data) && 0 <= head) && s == head) && i + 1 <= 0) && 1 <= unknown-#in~data-unknown) && len * 2 == 2 + data) && index <= 0) && len <= 1) && data == 1) && data <= 1) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][4] + 1 <= len * 2) && head <= 0) && len == 2) && #NULL == 0) && len * 2 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][4] + 1) && 0 <= \result) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][s] == 0) && #memory_$Pointer$[head][head] == 0) && #NULL == 0)) || (((((((((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && 0 <= s) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] + 1) && unknown-#in~data-unknown <= 1) && last <= 0) && #memory_$Pointer$[s][s] == head) && \result <= 0) && len * 2 == data + 1) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && 0 <= head) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[s][0] == s)) && 1 <= unknown-#in~data-unknown) && index <= 0) && 0 <= i) && len <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && #memory_$Pointer$[s][s] == head) && 0 <= \result) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][head] == 0) && #NULL == 0) [2022-11-23 15:03:19,197 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && unknown-#in~data-unknown <= 1) && head == s) && last <= 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && 0 <= head) && s == head) && 1 <= unknown-#in~data-unknown) && len * 2 == 2 + data) && index <= 0) && len <= 1) && unknown-#memory_int-unknown[s][4] <= len) && data == 1) && data <= 1) && len + i <= unknown-#memory_int-unknown[s][4] + 1) && head <= 0) && len == 2) && #NULL == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= len + i) && 0 <= \result) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][s] == 0) && #memory_$Pointer$[head][head] == 0) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((2 <= unknown-#in~len-unknown && 0 <= s) && index <= 0) && unknown-#in~data-unknown <= 1) && head == s) && last <= 0) && len == 2 + i) && \result <= 0) && unknown-#in~len-unknown <= 2) && len * 2 == unknown-#memory_int-unknown[s][s + 4] + 2) && 0 <= last) && 1 <= data) && 0 <= head) && s == head) && 1 <= unknown-#in~data-unknown) && len * 2 == 2 + data) && len <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= \result) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0)) || ((((((((((((((((((((((2 <= unknown-#in~len-unknown && 0 <= s) && index <= 0) && unknown-#in~data-unknown <= 1) && last <= 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && 0 <= head) && i + 1 <= 0) && 1 <= unknown-#in~data-unknown) && len <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= \result) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) [2022-11-23 15:03:19,198 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && 0 <= s) && 0 <= i + 1) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && 0 <= unknown-#in~index-unknown + 1) && 1 <= new_data) && unknown-#in~data-unknown <= 1) && head == s) && last <= 0) && \result <= 0) && index <= 1) && unknown-#in~len-unknown <= 2) && data <= 3) && 0 <= last) && 1 <= data) && 0 <= head) && s == head) && !(#memory_$Pointer$[s][0] == s)) && 1 <= unknown-#in~data-unknown) && len + i == data) && 0 <= i) && len <= 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~index-unknown <= 1) && data == 1) && data <= 1) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][4] + 1 <= len * 2) && head <= 0) && len == 2) && #NULL == 0) && 0 <= #in~head) && 1 <= data) && len * 2 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][4] + 1) && 0 <= index + 1) && 0 <= \result) && i <= 1) && new_data <= 3) && i == index) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][s] == 0) && #memory_$Pointer$[head][head] == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && 0 <= s) && 0 <= i + 1) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && 0 <= unknown-#in~index-unknown + 1) && head == 0) && 1 <= new_data) && unknown-#in~data-unknown <= 1) && last <= 0) && (forall v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29 : int :: (forall v_ArrVal_449 : [int]int, v_ArrVal_452 : int :: head == #memory_$Pointer$[head := v_ArrVal_449][s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29 + 4 := v_ArrVal_452][s]) || !(s <= v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29))) && \result <= 0) && index <= 1) && unknown-#in~len-unknown <= 2) && data <= 3) && 0 <= last) && 1 <= data) && 0 <= head) && #memory_$Pointer$[s][s] == 0) && 1 <= unknown-#in~data-unknown) && len + i == data) && len <= 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~index-unknown <= 1) && data == 1) && data <= 1) && index + 1 <= i) && head <= 0) && len == 2) && #NULL == 0) && 0 <= #in~head) && 1 <= data) && 0 <= index + 1) && 0 <= \result) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && len == i + 1) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][head] == 0) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && 0 <= unknown-#in~index-unknown + 1) && 1 <= new_data) && unknown-#in~data-unknown <= 1) && head == s) && last <= 0) && head == 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && s == head) && #memory_$Pointer$[s][s] == 0) && 1 <= unknown-#in~data-unknown) && len + i == data) && len <= 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~index-unknown <= 1) && data == 1) && data <= 1) && len == 2) && #NULL == 0) && 0 <= #in~head) && 0 <= \result) && new_data <= 3) && i == index) && 0 <= unknown-#StackHeapBarrier-unknown) && !(#memory_$Pointer$[head][head] == head)) && len == i + 1) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][head] == 0) && s == 0) && #NULL == 0) [2022-11-23 15:03:19,198 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && 0 <= s) && index <= 0) && unknown-#in~data-unknown <= 1) && head == s) && last <= 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && 0 <= head) && unknown-#memory_int-unknown[head][head + 4] == 3) && s == head) && 1 <= unknown-#in~data-unknown) && 3 == expected) && len * 2 == 2 + data) && index <= 0) && len <= 1) && unknown-#memory_int-unknown[s][4] <= len) && data == 1) && data <= 1) && head == 0) && len + i <= unknown-#memory_int-unknown[s][4] + 1) && head <= 0) && len == 2) && #NULL == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= len + i) && 0 <= \result) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && len == i + 1) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][s] == 0) && #memory_$Pointer$[head][head] == 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && s == #in~head) && unknown-#in~data-unknown <= 1) && head == s) && last <= 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && 0 <= head) && s == head) && 1 <= unknown-#in~data-unknown) && len * 2 == 2 + data) && index <= 0) && len <= 1) && unknown-#memory_int-unknown[s][4] <= len) && data == 1) && data <= 1) && index == unknown-#in~index-unknown) && head == 0) && len + i <= unknown-#memory_int-unknown[s][4] + 1) && head <= 0) && len == 2) && #NULL == 0) && i == unknown-#in~index-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= len + i) && head == #in~head) && 0 <= \result) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][s] == 0) && #memory_$Pointer$[head][head] == 0) && head == #in~head) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][4] <= expected) && s == 0) && #NULL == 0) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][4])) || (((((((((((((((((((((((((((((2 <= unknown-#in~len-unknown && 0 <= s) && index <= 0) && unknown-#in~data-unknown <= 1) && head == s) && last <= 0) && i <= 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && len * 2 == unknown-#memory_int-unknown[s][s + 4] + 2) && 0 <= last) && 1 <= data) && 0 <= head) && s == head) && 2 == expected) && 1 <= unknown-#in~data-unknown) && len * 2 == 2 + data) && 0 <= i) && len <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= \result) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && unknown-#memory_int-unknown[head][head + 4] == 2) && #NULL == 0) [2022-11-23 15:03:19,217 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 15:03:19,218 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:03:19,218 INFO L158 Benchmark]: Toolchain (without parser) took 71607.87ms. Allocated memory was 159.4MB in the beginning and 406.8MB in the end (delta: 247.5MB). Free memory was 126.6MB in the beginning and 306.2MB in the end (delta: -179.7MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2022-11-23 15:03:19,219 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 159.4MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:03:19,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.56ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 108.9MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-23 15:03:19,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.46ms. Allocated memory is still 159.4MB. Free memory was 108.9MB in the beginning and 106.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:03:19,227 INFO L158 Benchmark]: Boogie Preprocessor took 62.59ms. Allocated memory is still 159.4MB. Free memory was 106.7MB in the beginning and 105.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:03:19,227 INFO L158 Benchmark]: RCFGBuilder took 678.57ms. Allocated memory is still 159.4MB. Free memory was 105.0MB in the beginning and 86.4MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-23 15:03:19,227 INFO L158 Benchmark]: TraceAbstraction took 70284.97ms. Allocated memory was 159.4MB in the beginning and 406.8MB in the end (delta: 247.5MB). Free memory was 85.8MB in the beginning and 310.4MB in the end (delta: -224.6MB). Peak memory consumption was 207.7MB. Max. memory is 16.1GB. [2022-11-23 15:03:19,227 INFO L158 Benchmark]: Witness Printer took 66.22ms. Allocated memory is still 406.8MB. Free memory was 309.4MB in the beginning and 306.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 15:03:19,232 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.25ms. Allocated memory is still 159.4MB. Free memory is still 105.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.56ms. Allocated memory is still 159.4MB. Free memory was 126.6MB in the beginning and 108.9MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.46ms. Allocated memory is still 159.4MB. Free memory was 108.9MB in the beginning and 106.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.59ms. Allocated memory is still 159.4MB. Free memory was 106.7MB in the beginning and 105.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 678.57ms. Allocated memory is still 159.4MB. Free memory was 105.0MB in the beginning and 86.4MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 70284.97ms. Allocated memory was 159.4MB in the beginning and 406.8MB in the end (delta: 247.5MB). Free memory was 85.8MB in the beginning and 310.4MB in the end (delta: -224.6MB). Peak memory consumption was 207.7MB. Max. memory is 16.1GB. * Witness Printer took 66.22ms. Allocated memory is still 406.8MB. Free memory was 309.4MB in the beginning and 306.2MB 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$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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_ArrVal_449,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_452,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation 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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_449,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_452,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation 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$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_447,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_454,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation 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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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_447,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_454,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation 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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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: 637]: 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 2 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.1s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 mSolverCounterUnknown, 606 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 601 mSDsluCounter, 951 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 148 IncrementalHoareTripleChecker+Unchecked, 814 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2130 IncrementalHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 137 mSDtfsCounter, 2130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 765 GetRequests, 443 SyntacticMatches, 21 SemanticMatches, 301 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3334 ImplicationChecksByTransitivity, 35.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=9, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 82 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 16 PreInvPairs, 40 NumberOfFragments, 2061 HoareAnnotationTreeSize, 16 FomulaSimplifications, 7947 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 12 FomulaSimplificationsInter, 24660 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 546 NumberOfCodeBlocks, 540 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 693 ConstructedInterpolants, 7 QuantifiedInterpolants, 3788 SizeOfPredicates, 80 NumberOfNonLiveVariables, 3267 ConjunctsInSsa, 213 ConjunctsInUnsatCore, 30 InterpolantComputations, 5 PerfectInterpolantSequences, 256/362 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: 2.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 2, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 14, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 26, TOOLS_POST_TIME: 0.8s, TOOLS_POST_CALL_APPLICATIONS: 10, TOOLS_POST_CALL_TIME: 0.8s, TOOLS_POST_RETURN_APPLICATIONS: 8, TOOLS_POST_RETURN_TIME: 0.4s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 44, TOOLS_QUANTIFIERELIM_TIME: 2.0s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 78, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 6, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 5, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 10, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 14, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 5, LOOP_SUMMARIZER_CACHE_MISSES: 5, LOOP_SUMMARIZER_OVERALL_TIME: 1.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.5s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 10, CALL_SUMMARIZER_APPLICATIONS: 8, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, 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: 159, DAG_COMPRESSION_RETAINED_NODES: 56, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 598]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 586]: Loop Invariant [2022-11-23 15:03:19,259 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,264 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,264 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,265 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,266 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((last <= 0 && head == 0) && 2 == unknown-#length-unknown[1]) && 0 <= last) && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown == data) && \valid[1] == 1) && len == unknown-#in~len-unknown) && data == 1) && data <= 1) && head == last) && \valid[0] == 0) && len == 2) && \valid[2] == 1) && #NULL == 0) && unknown-#memory_int-unknown[1][0] == 48) && 27 == unknown-#length-unknown[2]) && unknown-#memory_int-unknown[1][1] == 0) && \valid[last] == 1) && len == len) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || (((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && unknown-#in~data-unknown <= 1) && last <= 0) && head == 0) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && 1 <= unknown-#in~data-unknown) && data == 1) && data <= 1) && len == 2) && #NULL == 0) && len + 1 <= len) && 0 <= unknown-#StackHeapBarrier-unknown) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][head] == 0) && #NULL == 0) - InvariantResult [Line: 629]: Loop Invariant [2022-11-23 15:03:19,266 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,267 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,267 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,267 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,267 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,268 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,269 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,271 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,271 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,271 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,272 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,272 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && unknown-#in~data-unknown <= 1) && head == s) && last <= 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && 0 <= head) && s == head) && 1 <= unknown-#in~data-unknown) && len * 2 == 2 + data) && index <= 0) && len <= 1) && unknown-#memory_int-unknown[s][4] <= len) && data == 1) && data <= 1) && len + i <= unknown-#memory_int-unknown[s][4] + 1) && head <= 0) && len == 2) && #NULL == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= len + i) && 0 <= \result) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][s] == 0) && #memory_$Pointer$[head][head] == 0) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((2 <= unknown-#in~len-unknown && 0 <= s) && index <= 0) && unknown-#in~data-unknown <= 1) && head == s) && last <= 0) && len == 2 + i) && \result <= 0) && unknown-#in~len-unknown <= 2) && len * 2 == unknown-#memory_int-unknown[s][s + 4] + 2) && 0 <= last) && 1 <= data) && 0 <= head) && s == head) && 1 <= unknown-#in~data-unknown) && len * 2 == 2 + data) && len <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= \result) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0)) || ((((((((((((((((((((((2 <= unknown-#in~len-unknown && 0 <= s) && index <= 0) && unknown-#in~data-unknown <= 1) && last <= 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && 0 <= head) && i + 1 <= 0) && 1 <= unknown-#in~data-unknown) && len <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= \result) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && #NULL == 0) - InvariantResult [Line: 614]: Loop Invariant [2022-11-23 15:03:19,273 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,274 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,274 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,274 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,275 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,276 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,276 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_449,QUANTIFIED] [2022-11-23 15:03:19,276 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_452,QUANTIFIED] [2022-11-23 15:03:19,277 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] [2022-11-23 15:03:19,277 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] [2022-11-23 15:03:19,277 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,278 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,279 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,281 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,281 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,282 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,283 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,284 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,284 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_449,QUANTIFIED] [2022-11-23 15:03:19,284 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_452,QUANTIFIED] [2022-11-23 15:03:19,284 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] [2022-11-23 15:03:19,285 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] [2022-11-23 15:03:19,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,285 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,286 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,286 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,286 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,286 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,287 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,287 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && 0 <= s) && 0 <= i + 1) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && 0 <= unknown-#in~index-unknown + 1) && 1 <= new_data) && unknown-#in~data-unknown <= 1) && head == s) && last <= 0) && \result <= 0) && index <= 1) && unknown-#in~len-unknown <= 2) && data <= 3) && 0 <= last) && 1 <= data) && 0 <= head) && s == head) && !(#memory_$Pointer$[s][0] == s)) && 1 <= unknown-#in~data-unknown) && len + i == data) && 0 <= i) && len <= 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~index-unknown <= 1) && data == 1) && data <= 1) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][4] + 1 <= len * 2) && head <= 0) && len == 2) && #NULL == 0) && 0 <= #in~head) && 1 <= data) && len * 2 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][4] + 1) && 0 <= index + 1) && 0 <= \result) && i <= 1) && new_data <= 3) && i == index) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][s] == 0) && #memory_$Pointer$[head][head] == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && 0 <= s) && 0 <= i + 1) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && 0 <= unknown-#in~index-unknown + 1) && head == 0) && 1 <= new_data) && unknown-#in~data-unknown <= 1) && last <= 0) && (forall v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29 : int :: (forall v_ArrVal_449 : [int]int, v_ArrVal_452 : int :: head == #memory_$Pointer$[head := v_ArrVal_449][s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29 + 4 := v_ArrVal_452][s]) || !(s <= v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29))) && \result <= 0) && index <= 1) && unknown-#in~len-unknown <= 2) && data <= 3) && 0 <= last) && 1 <= data) && 0 <= head) && #memory_$Pointer$[s][s] == 0) && 1 <= unknown-#in~data-unknown) && len + i == data) && len <= 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~index-unknown <= 1) && data == 1) && data <= 1) && index + 1 <= i) && head <= 0) && len == 2) && #NULL == 0) && 0 <= #in~head) && 1 <= data) && 0 <= index + 1) && 0 <= \result) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && len == i + 1) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][head] == 0) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && #in~head <= 0) && unknown-#in~data-unknown <= 3) && 0 <= unknown-#in~index-unknown + 1) && 1 <= new_data) && unknown-#in~data-unknown <= 1) && head == s) && last <= 0) && head == 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && s == head) && #memory_$Pointer$[s][s] == 0) && 1 <= unknown-#in~data-unknown) && len + i == data) && len <= 1) && 1 <= unknown-#in~data-unknown) && unknown-#in~index-unknown <= 1) && data == 1) && data <= 1) && len == 2) && #NULL == 0) && 0 <= #in~head) && 0 <= \result) && new_data <= 3) && i == index) && 0 <= unknown-#StackHeapBarrier-unknown) && !(#memory_$Pointer$[head][head] == head)) && len == i + 1) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][head] == 0) && s == 0) && #NULL == 0) - InvariantResult [Line: 625]: Loop Invariant [2022-11-23 15:03:19,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,289 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,290 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_447,QUANTIFIED] [2022-11-23 15:03:19,290 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,290 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_454,QUANTIFIED] [2022-11-23 15:03:19,291 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] [2022-11-23 15:03:19,291 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] [2022-11-23 15:03:19,291 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,291 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,292 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,292 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,292 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,292 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,293 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,294 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,295 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,297 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,298 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_447,QUANTIFIED] [2022-11-23 15:03:19,298 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,298 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_454,QUANTIFIED] [2022-11-23 15:03:19,298 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] [2022-11-23 15:03:19,299 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29,QUANTIFIED] [2022-11-23 15:03:19,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,299 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,301 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,301 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,301 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,301 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,302 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,303 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,303 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,303 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,304 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,305 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && unknown-#in~data-unknown <= 1) && last <= 0) && head == 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && (forall v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29 : int :: (forall v_ArrVal_447 : [int]int, v_ArrVal_454 : int :: #memory_$Pointer$[s][s] == #memory_$Pointer$[#memory_$Pointer$[s][s] := v_ArrVal_447][s][v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29 + 4 := v_ArrVal_454][s]) || !(s <= v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_29))) && #memory_$Pointer$[s][s] == 0) && 1 <= unknown-#in~data-unknown) && len <= 1) && data == 1) && data <= 1) && len == 2) && #NULL == 0) && 0 <= \result) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][head] == 0) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && 0 <= s) && unknown-#in~data-unknown <= 1) && head == s) && last <= 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && len * 2 == unknown-#memory_int-unknown[s][s + 4] + 2) && 0 <= last) && 1 <= data) && 0 <= head) && s == head) && i + 1 <= 0) && 1 <= unknown-#in~data-unknown) && len * 2 == 2 + data) && index <= 0) && len <= 1) && data == 1) && data <= 1) && unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][4] + 1 <= len * 2) && head <= 0) && len == 2) && #NULL == 0) && len * 2 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][s]][4] + 1) && 0 <= \result) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][s] == 0) && #memory_$Pointer$[head][head] == 0) && #NULL == 0)) || (((((((((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && 0 <= s) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][#memory_$Pointer$[s][s] + 4] + 1) && unknown-#in~data-unknown <= 1) && last <= 0) && #memory_$Pointer$[s][s] == head) && \result <= 0) && len * 2 == data + 1) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && 0 <= head) && #memory_$Pointer$[s][s] == 0) && !(#memory_$Pointer$[s][0] == s)) && 1 <= unknown-#in~data-unknown) && index <= 0) && 0 <= i) && len <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && #memory_$Pointer$[s][s] == head) && 0 <= \result) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][head] == 0) && #NULL == 0) - InvariantResult [Line: 607]: Loop Invariant [2022-11-23 15:03:19,306 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,307 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,308 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,309 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,310 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,311 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,312 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,313 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,314 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 15:03:19,315 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 15:03:19,316 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && 0 <= s) && index <= 0) && unknown-#in~data-unknown <= 1) && head == s) && last <= 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && 0 <= head) && unknown-#memory_int-unknown[head][head + 4] == 3) && s == head) && 1 <= unknown-#in~data-unknown) && 3 == expected) && len * 2 == 2 + data) && index <= 0) && len <= 1) && unknown-#memory_int-unknown[s][4] <= len) && data == 1) && data <= 1) && head == 0) && len + i <= unknown-#memory_int-unknown[s][4] + 1) && head <= 0) && len == 2) && #NULL == 0) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= len + i) && 0 <= \result) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && len == i + 1) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][s] == 0) && #memory_$Pointer$[head][head] == 0) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((last == #memory_$Pointer$[head][head] && 2 <= unknown-#in~len-unknown) && s == #in~head) && unknown-#in~data-unknown <= 1) && head == s) && last <= 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && 0 <= last) && 1 <= data) && 0 <= head) && s == head) && 1 <= unknown-#in~data-unknown) && len * 2 == 2 + data) && index <= 0) && len <= 1) && unknown-#memory_int-unknown[s][4] <= len) && data == 1) && data <= 1) && index == unknown-#in~index-unknown) && head == 0) && len + i <= unknown-#memory_int-unknown[s][4] + 1) && head <= 0) && len == 2) && #NULL == 0) && i == unknown-#in~index-unknown) && unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4] <= len + i) && head == #in~head) && 0 <= \result) && len + i <= unknown-#memory_int-unknown[#memory_$Pointer$[s][s]][4]) && 0 <= unknown-#StackHeapBarrier-unknown) && len == i + 1) && !(head == #memory_$Pointer$[head][head])) && #memory_$Pointer$[head][s] == 0) && #memory_$Pointer$[head][head] == 0) && head == #in~head) && unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][4] <= expected) && s == 0) && #NULL == 0) && expected <= unknown-#memory_int-unknown[#memory_$Pointer$[head][head]][4])) || (((((((((((((((((((((((((((((2 <= unknown-#in~len-unknown && 0 <= s) && index <= 0) && unknown-#in~data-unknown <= 1) && head == s) && last <= 0) && i <= 0) && \result <= 0) && unknown-#in~len-unknown <= 2) && len * 2 == unknown-#memory_int-unknown[s][s + 4] + 2) && 0 <= last) && 1 <= data) && 0 <= head) && s == head) && 2 == expected) && 1 <= unknown-#in~data-unknown) && len * 2 == 2 + data) && 0 <= i) && len <= 1) && data == 1) && data <= 1) && head <= 0) && len == 2) && #NULL == 0) && 0 <= \result) && i <= 1) && 0 <= unknown-#StackHeapBarrier-unknown) && s <= 0) && unknown-#memory_int-unknown[head][head + 4] == 2) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-23 15:03:19,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_629f2fb2-910b-4195-b8b5-8723b4109f0a/bin/utaipan-Q6hlc19bkW/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