./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0 --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 d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- 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-e04fb08 [2022-11-16 20:28:53,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 20:28:53,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 20:28:53,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 20:28:53,457 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 20:28:53,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 20:28:53,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 20:28:53,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 20:28:53,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 20:28:53,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 20:28:53,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 20:28:53,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 20:28:53,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 20:28:53,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 20:28:53,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 20:28:53,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 20:28:53,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 20:28:53,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 20:28:53,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 20:28:53,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 20:28:53,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 20:28:53,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 20:28:53,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 20:28:53,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 20:28:53,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 20:28:53,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 20:28:53,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 20:28:53,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 20:28:53,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 20:28:53,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 20:28:53,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 20:28:53,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 20:28:53,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 20:28:53,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 20:28:53,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 20:28:53,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 20:28:53,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 20:28:53,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 20:28:53,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 20:28:53,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 20:28:53,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 20:28:53,535 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-16 20:28:53,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 20:28:53,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 20:28:53,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 20:28:53,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 20:28:53,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 20:28:53,584 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 20:28:53,585 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-16 20:28:53,585 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-16 20:28:53,585 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-16 20:28:53,585 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-16 20:28:53,586 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-16 20:28:53,587 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-16 20:28:53,587 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-16 20:28:53,587 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-16 20:28:53,587 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-16 20:28:53,588 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-16 20:28:53,588 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-16 20:28:53,588 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-16 20:28:53,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 20:28:53,589 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 20:28:53,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 20:28:53,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 20:28:53,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 20:28:53,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 20:28:53,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 20:28:53,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 20:28:53,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 20:28:53,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 20:28:53,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 20:28:53,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 20:28:53,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 20:28:53,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 20:28:53,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:28:53,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 20:28:53,593 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-16 20:28:53,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 20:28:53,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 20:28:53,594 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-16 20:28:53,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 20:28:53,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 20:28:53,594 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-16 20:28:53,595 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_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/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_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0 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 -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2022-11-16 20:28:53,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 20:28:53,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 20:28:53,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 20:28:53,936 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 20:28:53,937 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 20:28:53,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/../../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2022-11-16 20:28:54,019 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/data/abf51c413/f339d04ab1ee49f7b5256d726607addf/FLAGe88dee611 [2022-11-16 20:28:54,600 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 20:28:54,600 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2022-11-16 20:28:54,618 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/data/abf51c413/f339d04ab1ee49f7b5256d726607addf/FLAGe88dee611 [2022-11-16 20:28:54,887 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/data/abf51c413/f339d04ab1ee49f7b5256d726607addf [2022-11-16 20:28:54,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 20:28:54,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 20:28:54,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 20:28:54,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 20:28:54,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 20:28:54,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:28:54" (1/1) ... [2022-11-16 20:28:54,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4806c00c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:28:54, skipping insertion in model container [2022-11-16 20:28:54,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:28:54" (1/1) ... [2022-11-16 20:28:54,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 20:28:54,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 20:28:55,376 WARN L229 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_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2022-11-16 20:28:55,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:28:55,387 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 20:28:55,425 WARN L229 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_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2022-11-16 20:28:55,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 20:28:55,450 INFO L208 MainTranslator]: Completed translation [2022-11-16 20:28:55,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:28:55 WrapperNode [2022-11-16 20:28:55,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 20:28:55,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 20:28:55,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 20:28:55,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 20:28:55,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:28:55" (1/1) ... [2022-11-16 20:28:55,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:28:55" (1/1) ... [2022-11-16 20:28:55,503 INFO L138 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 158 [2022-11-16 20:28:55,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 20:28:55,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 20:28:55,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 20:28:55,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 20:28:55,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:28:55" (1/1) ... [2022-11-16 20:28:55,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:28:55" (1/1) ... [2022-11-16 20:28:55,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:28:55" (1/1) ... [2022-11-16 20:28:55,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:28:55" (1/1) ... [2022-11-16 20:28:55,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:28:55" (1/1) ... [2022-11-16 20:28:55,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:28:55" (1/1) ... [2022-11-16 20:28:55,533 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:28:55" (1/1) ... [2022-11-16 20:28:55,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:28:55" (1/1) ... [2022-11-16 20:28:55,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 20:28:55,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 20:28:55,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 20:28:55,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 20:28:55,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:28:55" (1/1) ... [2022-11-16 20:28:55,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 20:28:55,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:28:55,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 20:28:55,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 20:28:55,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 20:28:55,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 20:28:55,630 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-16 20:28:55,630 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-16 20:28:55,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 20:28:55,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 20:28:55,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 20:28:55,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 20:28:55,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 20:28:55,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 20:28:55,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 20:28:55,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 20:28:55,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 20:28:55,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 20:28:55,780 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 20:28:55,783 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 20:28:56,141 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 20:28:56,197 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 20:28:56,205 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-16 20:28:56,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:28:56 BoogieIcfgContainer [2022-11-16 20:28:56,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 20:28:56,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 20:28:56,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 20:28:56,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 20:28:56,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:28:54" (1/3) ... [2022-11-16 20:28:56,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c1ab9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:28:56, skipping insertion in model container [2022-11-16 20:28:56,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:28:55" (2/3) ... [2022-11-16 20:28:56,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71c1ab9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:28:56, skipping insertion in model container [2022-11-16 20:28:56,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 08:28:56" (3/3) ... [2022-11-16 20:28:56,222 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2022-11-16 20:28:56,266 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 20:28:56,266 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 20:28:56,334 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 20:28:56,345 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;@7cb41293, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 20:28:56,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 20:28:56,351 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 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-16 20:28:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-16 20:28:56,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:28:56,361 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:28:56,362 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:28:56,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:28:56,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1623736300, now seen corresponding path program 1 times [2022-11-16 20:28:56,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:28:56,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598913040] [2022-11-16 20:28:56,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:28:56,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:28:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:28:56,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:28:56,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:28:56,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598913040] [2022-11-16 20:28:56,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598913040] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:28:56,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 20:28:56,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 20:28:56,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708091731] [2022-11-16 20:28:56,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:28:56,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 20:28:56,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:28:56,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 20:28:56,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 20:28:56,897 INFO L87 Difference]: Start difference. First operand has 32 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 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) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 20:28:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:28:56,980 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2022-11-16 20:28:56,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 20:28:56,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 18 [2022-11-16 20:28:56,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:28:56,991 INFO L225 Difference]: With dead ends: 61 [2022-11-16 20:28:56,991 INFO L226 Difference]: Without dead ends: 29 [2022-11-16 20:28:56,994 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-16 20:28:56,997 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:28:56,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 71 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:28:57,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-16 20:28:57,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-16 20:28:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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-16 20:28:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-11-16 20:28:57,039 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2022-11-16 20:28:57,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:28:57,040 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-11-16 20:28:57,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-16 20:28:57,040 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-11-16 20:28:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 20:28:57,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:28:57,042 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:28:57,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 20:28:57,043 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:28:57,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:28:57,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1105478418, now seen corresponding path program 1 times [2022-11-16 20:28:57,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:28:57,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91408301] [2022-11-16 20:28:57,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:28:57,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:28:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:28:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:28:57,670 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:28:57,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91408301] [2022-11-16 20:28:57,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91408301] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:28:57,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462179221] [2022-11-16 20:28:57,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:28:57,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:28:57,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:28:57,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:28:57,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 20:28:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:28:57,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-16 20:28:57,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:28:58,230 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 8 treesize of output 4 [2022-11-16 20:28:58,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:28:58,354 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 15 treesize of output 17 [2022-11-16 20:28:58,403 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 16 treesize of output 8 [2022-11-16 20:28:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:28:58,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:28:58,558 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_12| Int) (v_ArrVal_184 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_12| v_ArrVal_184) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_12| |c_#StackHeapBarrier|)))) is different from false [2022-11-16 20:28:58,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462179221] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:28:58,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [250850337] [2022-11-16 20:28:58,581 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-16 20:28:58,581 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:28:58,585 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 20:28:58,591 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 20:28:58,592 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 20:28:58,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:28:58,664 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 20:28:58,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-16 20:28:58,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:28:58,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-16 20:28:58,763 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-16 20:28:58,775 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-16 20:28:58,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:28:58,795 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-16 20:28:58,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:28:58,806 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-16 20:28:58,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:28:58,828 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-16 20:28:58,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:28:58,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 20:28:58,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:28:58,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 20:28:58,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:28:58,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 20:28:58,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:28:58,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 20:28:59,417 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-16 20:28:59,427 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-16 20:28:59,439 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-16 20:28:59,451 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-16 20:28:59,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-16 20:28:59,509 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:28:59,513 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:28:59,519 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:28:59,521 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:28:59,525 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:28:59,848 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-16 20:28:59,866 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-16 20:28:59,876 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-16 20:28:59,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-16 20:28:59,910 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-16 20:28:59,923 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:28:59,925 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:28:59,927 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:28:59,930 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:28:59,932 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:28:59,986 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-16 20:29:00,000 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-16 20:29:00,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:00,017 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-16 20:29:00,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:00,248 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-16 20:29:00,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:00,266 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-16 20:29:00,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:00,279 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-16 20:29:00,531 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-16 20:29:00,544 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-16 20:29:00,562 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-16 20:29:00,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:00,702 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:00,703 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 15 treesize of output 7 [2022-11-16 20:29:00,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:00,730 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:00,731 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 15 treesize of output 7 [2022-11-16 20:29:00,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:00,884 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:00,885 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 15 treesize of output 7 [2022-11-16 20:29:00,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:00,915 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:00,916 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 15 treesize of output 7 [2022-11-16 20:29:01,086 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 192 treesize of output 174 [2022-11-16 20:29:01,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:01,113 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 192 treesize of output 174 [2022-11-16 20:29:01,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:01,164 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 20:29:01,165 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 211 treesize of output 186 [2022-11-16 20:29:01,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:01,204 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-16 20:29:01,208 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 178 [2022-11-16 20:29:01,588 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-16 20:29:01,601 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-16 20:29:01,608 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-16 20:29:01,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:01,635 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-16 20:29:01,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:01,645 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-16 20:29:01,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:01,655 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-16 20:29:01,657 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 20:29:06,813 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '280#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (+ |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 4))) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_sll_circular_append_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| |ULTIMATE.start_sll_circular_append_~data#1|) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (< |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~last~2#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-16 20:29:06,814 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 20:29:06,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:29:06,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2022-11-16 20:29:06,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17405505] [2022-11-16 20:29:06,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:29:06,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 20:29:06,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:29:06,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 20:29:06,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1139, Unknown=1, NotChecked=68, Total=1332 [2022-11-16 20:29:06,818 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 20:29:07,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:29:07,137 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2022-11-16 20:29:07,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 20:29:07,142 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25 [2022-11-16 20:29:07,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:29:07,144 INFO L225 Difference]: With dead ends: 39 [2022-11-16 20:29:07,144 INFO L226 Difference]: Without dead ends: 28 [2022-11-16 20:29:07,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=157, Invalid=1486, Unknown=1, NotChecked=78, Total=1722 [2022-11-16 20:29:07,146 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 20:29:07,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 221 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 21 Unchecked, 0.2s Time] [2022-11-16 20:29:07,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-16 20:29:07,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-11-16 20:29:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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-16 20:29:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-11-16 20:29:07,153 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 25 [2022-11-16 20:29:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:29:07,153 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-11-16 20:29:07,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 4 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-16 20:29:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-11-16 20:29:07,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 20:29:07,158 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:29:07,159 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:29:07,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 20:29:07,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:29:07,368 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:29:07,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:29:07,368 INFO L85 PathProgramCache]: Analyzing trace with hash 871403401, now seen corresponding path program 1 times [2022-11-16 20:29:07,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:29:07,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562493986] [2022-11-16 20:29:07,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:29:07,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:29:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:29:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:29:08,823 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:29:08,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562493986] [2022-11-16 20:29:08,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562493986] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:29:08,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618837009] [2022-11-16 20:29:08,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:29:08,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:29:08,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:29:08,824 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:29:08,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 20:29:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:29:09,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 135 conjunts are in the unsatisfiable core [2022-11-16 20:29:09,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:29:09,031 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-16 20:29:09,081 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 5 treesize of output 3 [2022-11-16 20:29:09,188 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 20:29:09,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-11-16 20:29:09,334 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:09,334 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 7 [2022-11-16 20:29:09,396 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-16 20:29:09,487 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-16 20:29:09,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 22 treesize of output 33 [2022-11-16 20:29:09,610 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 19 treesize of output 18 [2022-11-16 20:29:09,638 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 11 treesize of output 7 [2022-11-16 20:29:09,766 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 20:29:09,767 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 45 [2022-11-16 20:29:09,779 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 26 treesize of output 28 [2022-11-16 20:29:09,906 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 20:29:09,907 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 29 [2022-11-16 20:29:09,922 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:09,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 20:29:09,931 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-16 20:29:09,937 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 7 treesize of output 3 [2022-11-16 20:29:10,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:10,142 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 20:29:10,143 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 52 [2022-11-16 20:29:10,165 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 20:29:10,165 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 18 treesize of output 28 [2022-11-16 20:29:10,177 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 5 treesize of output 3 [2022-11-16 20:29:10,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:10,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:10,204 INFO L321 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-11-16 20:29:10,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2022-11-16 20:29:10,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:10,223 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 14 treesize of output 16 [2022-11-16 20:29:10,645 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-16 20:29:10,646 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 77 [2022-11-16 20:29:10,678 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 20:29:10,679 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 104 [2022-11-16 20:29:10,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:10,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:10,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-16 20:29:10,714 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-16 20:29:10,715 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2022-11-16 20:29:10,722 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 30 treesize of output 32 [2022-11-16 20:29:10,933 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 22 treesize of output 10 [2022-11-16 20:29:11,222 INFO L321 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2022-11-16 20:29:11,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 73 [2022-11-16 20:29:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:29:11,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:29:11,601 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_347 (Array Int Int)) (v_ArrVal_341 Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_340))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_343) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_347) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_341)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_342) .cse1) (+ .cse2 4))))))) is different from false [2022-11-16 20:29:11,925 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_347 (Array Int Int)) (v_ArrVal_341 Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_340))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_343) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_347) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 .cse0) .cse2))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| .cse3 (store (select |c_#memory_int| .cse3) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_341)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_342) .cse0) (+ .cse2 4)))))))) is different from false [2022-11-16 20:29:12,042 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| Int) (v_ArrVal_359 (Array Int Int)) (v_ArrVal_358 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (v_ArrVal_341 Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_340 (Array Int Int)) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int)) (v_ArrVal_357 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_358))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (store (store .cse5 .cse4 (store (select .cse5 .cse4) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_340))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select (store (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_357) .cse4 v_ArrVal_343) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_347) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 .cse0) .cse2))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (let ((.cse3 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_359))) (store .cse3 .cse4 (store (select .cse3 .cse4) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_341))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| v_ArrVal_342) .cse0) (+ .cse2 4))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_16| |c_#StackHeapBarrier|)))))))) is different from false [2022-11-16 20:29:12,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618837009] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:29:12,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [645234427] [2022-11-16 20:29:12,047 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-16 20:29:12,048 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:29:12,048 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 20:29:12,048 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 20:29:12,049 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 20:29:12,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:12,085 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 20:29:12,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-16 20:29:12,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:12,114 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 20:29:12,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-16 20:29:12,153 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-16 20:29:12,158 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-16 20:29:12,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:12,167 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-16 20:29:12,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:12,175 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-16 20:29:12,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:12,186 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-16 20:29:12,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:12,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 20:29:12,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:12,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 20:29:12,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:12,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 20:29:12,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:12,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 20:29:12,340 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-16 20:29:12,375 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-16 20:29:12,384 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-16 20:29:12,392 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-16 20:29:12,403 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-16 20:29:12,442 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-16 20:29:12,451 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-16 20:29:12,459 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-16 20:29:12,469 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-16 20:29:12,480 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-16 20:29:12,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:12,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:12,560 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 221 treesize of output 205 [2022-11-16 20:29:12,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:12,578 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 219 treesize of output 207 [2022-11-16 20:29:12,592 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:12,594 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 227 treesize of output 110 [2022-11-16 20:29:12,685 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-16 20:29:12,696 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-16 20:29:12,706 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-16 20:29:12,716 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-16 20:29:12,725 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-16 20:29:12,763 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-16 20:29:12,772 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-16 20:29:12,781 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-16 20:29:12,792 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-16 20:29:12,806 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-16 20:29:12,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 19 treesize of output 11 [2022-11-16 20:29:12,852 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-16 20:29:12,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:12,865 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-16 20:29:12,965 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-16 20:29:12,974 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-16 20:29:12,984 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-16 20:29:13,002 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-16 20:29:13,021 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-16 20:29:13,071 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-16 20:29:13,081 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-16 20:29:13,095 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-16 20:29:13,105 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-16 20:29:13,116 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-16 20:29:13,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:13,206 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 20:29:13,206 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 1 case distinctions, treesize of input 26 treesize of output 21 [2022-11-16 20:29:13,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:13,222 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 25 treesize of output 13 [2022-11-16 20:29:13,248 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 20:29:13,248 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 1 case distinctions, treesize of input 34 treesize of output 25 [2022-11-16 20:29:13,324 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-16 20:29:13,343 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-16 20:29:13,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:13,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:13,365 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:13,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:29:13,378 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-16 20:29:13,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:13,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:13,403 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:13,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:29:13,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 9 treesize of output 3 [2022-11-16 20:29:13,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:13,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:13,493 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:13,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:29:13,512 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-16 20:29:13,524 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-16 20:29:13,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:13,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:13,546 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:13,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:29:13,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:13,837 INFO L321 Elim1Store]: treesize reduction 95, result has 36.2 percent of original size [2022-11-16 20:29:13,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 119 treesize of output 137 [2022-11-16 20:29:13,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:13,956 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-16 20:29:13,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 49 [2022-11-16 20:29:13,974 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 5 treesize of output 3 [2022-11-16 20:29:14,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:29:14,011 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 16 treesize of output 20 [2022-11-16 20:29:14,028 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:14,041 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:14,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:14,142 INFO L321 Elim1Store]: treesize reduction 120, result has 19.5 percent of original size [2022-11-16 20:29:14,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 115 treesize of output 108 [2022-11-16 20:29:14,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:14,222 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-16 20:29:14,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 45 [2022-11-16 20:29:14,246 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 5 treesize of output 3 [2022-11-16 20:29:14,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:14,282 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:29:14,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2022-11-16 20:29:14,407 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-16 20:29:14,408 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 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-16 20:29:15,494 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-16 20:29:15,501 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-16 20:29:15,506 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-16 20:29:15,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:15,525 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-16 20:29:15,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:15,533 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-16 20:29:15,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:15,542 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-16 20:29:15,543 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 20:29:23,341 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse9 (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse24 (not .cse9)) (.cse6 (not .cse10))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (or .cse24 .cse6)) (.cse1 (not .cse3))) (and (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_append_#in~data#1|) (< 0 |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 5 |c_ULTIMATE.start_sll_circular_append_~data#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| 5) (<= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (< |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (<= |c_ULTIMATE.start_sll_circular_create_#in~data#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 1 |c_ULTIMATE.start_sll_circular_create_#in~data#1|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_#NULL.offset| 0) (<= |c_ULTIMATE.start_sll_circular_append_#in~data#1| 5) (= |c_ULTIMATE.start_sll_circular_append_#in~data#1| |c_ULTIMATE.start_sll_circular_append_~data#1|) (<= 1 |c_ULTIMATE.start_sll_circular_create_~len#1|) (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 1 |c_ULTIMATE.start_sll_circular_create_~data#1|) (= (+ |c_ULTIMATE.start_sll_circular_create_~len#1| 1) |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |c_ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse0) (= |c_ULTIMATE.start_main_~count~0#1| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= 2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_#NULL.base| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_create_#in~data#1|) (= |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or (not (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) .cse1) (<= |c_ULTIMATE.start_sll_circular_append_~data#1| 5) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse2) (= |c_ULTIMATE.start_main_~last~2#1.offset| .cse0) (= |c_ULTIMATE.start_main_~last~2#1.base| .cse2) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (and (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 4) .cse3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_sll_circular_append_~data#1|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (or (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (and .cse4 .cse5 (or .cse6 (and (or .cse1 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse7 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= .cse8 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (or (and .cse9 .cse10) (= (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) (and .cse4 .cse9 .cse10 (or (exists ((v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_DerPreprocessor_5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((v_DerPreprocessor_4 (Array Int Int))) (let ((.cse11 (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse11 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= v_DerPreprocessor_4 .cse11)))))) (exists ((v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_DerPreprocessor_5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((v_DerPreprocessor_4 (Array Int Int))) (let ((.cse12 (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= (select (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse13 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= v_DerPreprocessor_4 .cse13)))))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse8)))) (<= 0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#in~data#1| |c_ULTIMATE.start_sll_circular_create_~data#1|) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) (<= 5 |c_ULTIMATE.start_sll_circular_append_#in~data#1|) (<= 0 |c_ULTIMATE.start_sll_circular_append_#in~head#1.base|) (let ((.cse16 (not (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| 0))) (.cse15 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (.cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (.cse19 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (and .cse9 (= .cse14 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse10 .cse15 (or (and .cse16 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse20 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7))) (let ((.cse17 (select .cse20 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse18 (select (select .cse20 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select .cse17 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse18 .cse19) (= .cse17 v_DerPreprocessor_6) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse18) (= .cse18 (select v_DerPreprocessor_7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse23 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7))) (let ((.cse21 (select .cse23 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse22 (select (select .cse23 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select .cse21 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse22 .cse19) (not (= .cse22 0)) (= .cse21 v_DerPreprocessor_6) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse22) (= .cse22 (select v_DerPreprocessor_7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))))))) (and (or .cse16 (not (= .cse19 0))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse19) .cse5 .cse15 (= .cse14 .cse19) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| .cse19) (and .cse24 .cse1) .cse6)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (= (select |c_#length| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 8) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (< |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_sll_circular_create_~len#1| 1) (= |c_ULTIMATE.start_main_~len~0#1| 2))))) is different from true [2022-11-16 20:29:25,017 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse9 (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse24 (not .cse9)) (.cse6 (not .cse10))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (or .cse24 .cse6)) (.cse2 (not .cse3))) (and (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~last~2#1.base|) |c_ULTIMATE.start_main_~last~2#1.offset|) .cse0) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_append_#in~data#1|) (< 0 |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 5 |c_ULTIMATE.start_sll_circular_append_~data#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_main_~uneq~0#1| 5) (<= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (< |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (<= |c_ULTIMATE.start_sll_circular_create_#in~data#1| 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 2 |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 1 |c_ULTIMATE.start_sll_circular_create_#in~data#1|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_#NULL.offset| 0) (<= |c_ULTIMATE.start_sll_circular_append_#in~data#1| 5) (= |c_ULTIMATE.start_sll_circular_append_#in~data#1| |c_ULTIMATE.start_sll_circular_append_~data#1|) (<= 1 |c_ULTIMATE.start_sll_circular_create_~len#1|) (<= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 1 |c_ULTIMATE.start_sll_circular_create_~data#1|) (= (+ |c_ULTIMATE.start_sll_circular_create_~len#1| 1) |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (<= |c_ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse1) (= |c_ULTIMATE.start_main_~count~0#1| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= 2 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_#NULL.base| 0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_sll_circular_create_#in~data#1|) (= |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_sll_circular_create_#in~len#1|) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (<= 0 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~last~2#1.base|) |c_ULTIMATE.start_main_~last~2#1.offset|) .cse1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (or (not (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) .cse2) (<= |c_ULTIMATE.start_sll_circular_append_~data#1| 5) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~last~2#1.offset| .cse1) (= |c_ULTIMATE.start_main_~last~2#1.base| .cse0) (= |c_ULTIMATE.start_sll_circular_append_#in~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (or (and (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 4) .cse3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4) |c_ULTIMATE.start_sll_circular_append_~data#1|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (or (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (and .cse4 .cse5 (or .cse6 (and (or .cse2 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse7 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)))) (= .cse8 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (or (and .cse9 .cse10) (= (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)))) (and .cse4 .cse9 .cse10 (or (exists ((v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_DerPreprocessor_5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((v_DerPreprocessor_4 (Array Int Int))) (let ((.cse11 (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse11 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= v_DerPreprocessor_4 .cse11)))))) (exists ((v_DerPreprocessor_5 (Array Int Int))) (and (= (select v_DerPreprocessor_5 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (exists ((v_DerPreprocessor_4 (Array Int Int))) (let ((.cse12 (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_5))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))) (and (= (select (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select .cse13 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= v_DerPreprocessor_4 .cse13)))))))) (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| .cse8)))) (<= 0 |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#in~data#1| |c_ULTIMATE.start_sll_circular_create_~data#1|) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) (<= 5 |c_ULTIMATE.start_sll_circular_append_#in~data#1|) (<= 0 |c_ULTIMATE.start_sll_circular_append_#in~head#1.base|) (let ((.cse16 (not (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| 0))) (.cse15 (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (.cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (.cse19 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (and .cse9 (= .cse14 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) .cse10 .cse15 (or (and .cse16 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse20 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7))) (let ((.cse17 (select .cse20 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse18 (select (select .cse20 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select .cse17 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse18 .cse19) (= .cse17 v_DerPreprocessor_6) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse18) (= .cse18 (select v_DerPreprocessor_7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|))))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse23 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7))) (let ((.cse21 (select .cse23 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (.cse22 (select (select .cse23 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select .cse21 |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= .cse22 .cse19) (not (= .cse22 0)) (= .cse21 v_DerPreprocessor_6) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse22) (= .cse22 (select v_DerPreprocessor_7 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))))))) (and (or .cse16 (not (= .cse19 0))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse19) .cse5 .cse15 (= .cse14 .cse19) (or (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| .cse19) (and .cse24 .cse2) .cse6)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (= (select |c_#length| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 8) (not (= |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (< |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_sll_circular_create_~len#1| 1) (= |c_ULTIMATE.start_main_~len~0#1| 2))))) is different from true [2022-11-16 20:29:26,198 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '558#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (< |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (and (= v_DerPreprocessor_6 (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= (select v_DerPreprocessor_7 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_6) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_7) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |ULTIMATE.start_sll_circular_append_~data#1| (select (select |#memory_int| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 4)) (= (select |#valid| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 1) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (< |ULTIMATE.start_sll_circular_create_~last~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| 0)) (= (+ |ULTIMATE.start_sll_circular_create_~len#1| 1) |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_create_#in~data#1| |ULTIMATE.start_sll_circular_create_~data#1|) (= |ULTIMATE.start_main_~uneq~0#1| |ULTIMATE.start_sll_circular_append_#in~data#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (not (= 2 |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| |ULTIMATE.start_main_~#s~0#1.offset|) (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_circular_create_#in~len#1|) (= |ULTIMATE.start_main_~data~0#1| 1) (= |ULTIMATE.start_sll_circular_create_~head~0#1.base| |ULTIMATE.start_sll_circular_create_#res#1.base|) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (not (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| 0)) (= |#NULL.offset| 0) (not (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| 0)) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_#in~data#1| |ULTIMATE.start_sll_circular_append_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) (= 8 (select |#length| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (< |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| |#StackHeapBarrier|) (< 0 |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~last~2#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-16 20:29:26,199 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 20:29:26,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:29:26,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 37 [2022-11-16 20:29:26,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485512059] [2022-11-16 20:29:26,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:29:26,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-16 20:29:26,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:29:26,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-16 20:29:26,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=3418, Unknown=53, NotChecked=610, Total=4290 [2022-11-16 20:29:26,213 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 37 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 20:29:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:29:27,058 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-11-16 20:29:27,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 20:29:27,059 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 28 [2022-11-16 20:29:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:29:27,061 INFO L225 Difference]: With dead ends: 54 [2022-11-16 20:29:27,061 INFO L226 Difference]: Without dead ends: 46 [2022-11-16 20:29:27,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=268, Invalid=4251, Unknown=57, NotChecked=680, Total=5256 [2022-11-16 20:29:27,064 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 19 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 20:29:27,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 253 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 242 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2022-11-16 20:29:27,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-16 20:29:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 33. [2022-11-16 20:29:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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-16 20:29:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-11-16 20:29:27,087 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 28 [2022-11-16 20:29:27,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:29:27,088 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-11-16 20:29:27,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-16 20:29:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-11-16 20:29:27,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 20:29:27,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:29:27,092 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:29:27,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 20:29:27,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:29:27,303 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:29:27,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:29:27,303 INFO L85 PathProgramCache]: Analyzing trace with hash -53225596, now seen corresponding path program 1 times [2022-11-16 20:29:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:29:27,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571157027] [2022-11-16 20:29:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:29:27,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:29:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:29:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-16 20:29:28,371 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:29:28,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571157027] [2022-11-16 20:29:28,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571157027] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:29:28,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977006680] [2022-11-16 20:29:28,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:29:28,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:29:28,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:29:28,374 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:29:28,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 20:29:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:29:28,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-16 20:29:28,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:29:28,661 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-16 20:29:28,820 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-16 20:29:28,898 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 20:29:28,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 20:29:28,987 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 18 [2022-11-16 20:29:29,080 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 18 treesize of output 20 [2022-11-16 20:29:29,200 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 36 treesize of output 20 [2022-11-16 20:29:29,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 20:29:29,213 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 7 treesize of output 3 [2022-11-16 20:29:29,218 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 7 treesize of output 3 [2022-11-16 20:29:29,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:29,406 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 14 treesize of output 16 [2022-11-16 20:29:29,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:29,425 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 44 treesize of output 40 [2022-11-16 20:29:29,450 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-16 20:29:29,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-16 20:29:29,460 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 18 treesize of output 20 [2022-11-16 20:29:29,766 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 20:29:29,767 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 71 [2022-11-16 20:29:29,799 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 20:29:29,800 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 114 [2022-11-16 20:29:29,809 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-11-16 20:29:29,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:29,835 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-16 20:29:29,836 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 87 [2022-11-16 20:29:29,846 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 30 treesize of output 32 [2022-11-16 20:29:29,932 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:29,933 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 28 [2022-11-16 20:29:30,024 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 22 treesize of output 10 [2022-11-16 20:29:30,122 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 15 treesize of output 7 [2022-11-16 20:29:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 20:29:30,159 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:29:31,270 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_528 (Array Int Int)) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_529 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| Int) (v_ArrVal_517 Int) (v_ArrVal_520 (Array Int Int)) (v_ArrVal_530 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_529))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_528)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_530))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_517))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_513) (select (select (store (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_519) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store (store .cse4 .cse1 v_ArrVal_516) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| v_ArrVal_520) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_20|) 0)))) is different from false [2022-11-16 20:29:31,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977006680] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:29:31,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1256394731] [2022-11-16 20:29:31,276 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-16 20:29:31,276 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:29:31,276 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 20:29:31,276 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 20:29:31,276 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 20:29:31,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:31,319 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 20:29:31,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-16 20:29:31,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:31,350 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 20:29:31,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-16 20:29:31,374 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-16 20:29:31,378 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-16 20:29:31,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:31,387 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-16 20:29:31,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:31,411 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-16 20:29:31,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:31,428 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-16 20:29:31,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:31,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 20:29:31,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:31,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 20:29:31,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:31,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 20:29:31,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:31,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 20:29:31,574 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-16 20:29:31,584 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-16 20:29:31,593 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-16 20:29:31,606 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-16 20:29:31,613 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-16 20:29:31,648 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-16 20:29:31,657 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-16 20:29:31,665 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-16 20:29:31,677 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-16 20:29:31,684 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-16 20:29:31,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:31,723 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-16 20:29:31,732 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-16 20:29:31,741 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-16 20:29:32,044 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:32,046 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:32,048 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:32,050 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:32,052 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:32,064 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-16 20:29:32,086 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-16 20:29:32,097 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-16 20:29:32,106 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-16 20:29:32,115 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-16 20:29:32,317 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:32,319 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:32,320 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:32,323 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:32,324 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:32,336 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-16 20:29:32,345 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-16 20:29:32,359 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-16 20:29:32,370 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-16 20:29:32,378 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-16 20:29:32,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:32,421 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-16 20:29:32,429 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-16 20:29:32,439 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-16 20:29:32,871 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-16 20:29:32,882 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-16 20:29:32,891 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-16 20:29:32,900 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-16 20:29:32,911 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-16 20:29:32,924 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:32,926 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:32,928 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:32,929 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:32,932 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:33,141 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:33,142 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:33,144 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:33,146 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:33,149 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:33,158 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-16 20:29:33,166 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-16 20:29:33,175 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-16 20:29:33,187 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-16 20:29:33,195 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-16 20:29:33,275 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 20:29:33,276 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-16 20:29:33,289 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-16 20:29:33,319 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 20:29:33,319 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-16 20:29:33,398 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-16 20:29:33,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:33,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:33,419 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:33,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:29:33,432 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-16 20:29:33,444 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-16 20:29:33,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:33,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:33,470 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:33,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:29:33,534 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-16 20:29:33,548 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-16 20:29:33,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:33,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:33,572 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:33,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:29:33,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:33,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:33,602 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:33,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:29:33,615 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-16 20:29:33,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:33,954 INFO L321 Elim1Store]: treesize reduction 95, result has 36.2 percent of original size [2022-11-16 20:29:33,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 119 treesize of output 137 [2022-11-16 20:29:33,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:34,061 INFO L321 Elim1Store]: treesize reduction 120, result has 19.5 percent of original size [2022-11-16 20:29:34,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 119 treesize of output 112 [2022-11-16 20:29:34,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:34,187 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-16 20:29:34,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 53 [2022-11-16 20:29:34,208 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 5 treesize of output 3 [2022-11-16 20:29:34,246 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:34,273 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:29:34,274 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 16 treesize of output 20 [2022-11-16 20:29:34,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:34,354 INFO L321 Elim1Store]: treesize reduction 24, result has 52.0 percent of original size [2022-11-16 20:29:34,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 74 [2022-11-16 20:29:34,375 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 5 treesize of output 3 [2022-11-16 20:29:34,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:29:34,408 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 16 treesize of output 20 [2022-11-16 20:29:34,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:34,444 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:34,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2022-11-16 20:29:34,698 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-16 20:29:34,698 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 2 case distinctions, treesize of input 39 treesize of output 26 [2022-11-16 20:29:36,932 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-16 20:29:36,938 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-16 20:29:36,943 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-16 20:29:36,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:36,957 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-16 20:29:36,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:36,964 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-16 20:29:36,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:36,971 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-16 20:29:36,974 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 20:29:44,851 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '885#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 5 |ULTIMATE.start_sll_circular_append_#in~data#1|) (<= |ULTIMATE.start_sll_circular_append_~data#1| 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (= |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) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~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_sll_circular_append_~head#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-16 20:29:44,851 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 20:29:44,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:29:44,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 24] total 38 [2022-11-16 20:29:44,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656258914] [2022-11-16 20:29:44,852 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:29:44,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-16 20:29:44,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:29:44,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-16 20:29:44,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3500, Unknown=78, NotChecked=120, Total=3906 [2022-11-16 20:29:44,854 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 38 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 6 states have call successors, (6), 4 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-16 20:29:46,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:29:46,154 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-11-16 20:29:46,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 20:29:46,155 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 6 states have call successors, (6), 4 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 30 [2022-11-16 20:29:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:29:46,156 INFO L225 Difference]: With dead ends: 59 [2022-11-16 20:29:46,156 INFO L226 Difference]: Without dead ends: 45 [2022-11-16 20:29:46,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=288, Invalid=4743, Unknown=85, NotChecked=140, Total=5256 [2022-11-16 20:29:46,159 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 20:29:46,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 360 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 471 Invalid, 0 Unknown, 51 Unchecked, 0.5s Time] [2022-11-16 20:29:46,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-16 20:29:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2022-11-16 20:29:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 20:29:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-11-16 20:29:46,170 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 30 [2022-11-16 20:29:46,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:29:46,170 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-11-16 20:29:46,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 29 states have internal predecessors, (44), 6 states have call successors, (6), 4 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-16 20:29:46,171 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-11-16 20:29:46,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 20:29:46,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:29:46,172 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:29:46,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-16 20:29:46,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:29:46,378 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:29:46,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:29:46,378 INFO L85 PathProgramCache]: Analyzing trace with hash -325495100, now seen corresponding path program 1 times [2022-11-16 20:29:46,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:29:46,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731266236] [2022-11-16 20:29:46,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:29:46,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:29:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:29:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:29:47,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:29:47,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731266236] [2022-11-16 20:29:47,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731266236] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:29:47,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700462169] [2022-11-16 20:29:47,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:29:47,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:29:47,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:29:47,984 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:29:47,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 20:29:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:29:48,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 107 conjunts are in the unsatisfiable core [2022-11-16 20:29:48,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:29:48,211 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-16 20:29:48,402 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 5 treesize of output 3 [2022-11-16 20:29:48,510 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 20:29:48,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 20:29:48,604 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-16 20:29:48,689 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 20:29:48,689 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 71 treesize of output 58 [2022-11-16 20:29:48,810 INFO L321 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-11-16 20:29:48,811 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 34 [2022-11-16 20:29:48,817 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 13 treesize of output 9 [2022-11-16 20:29:48,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 20:29:48,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:48,956 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 20:29:48,957 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 62 [2022-11-16 20:29:48,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:48,965 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 61 treesize of output 59 [2022-11-16 20:29:48,992 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-16 20:29:48,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-11-16 20:29:49,700 INFO L321 Elim1Store]: treesize reduction 104, result has 15.4 percent of original size [2022-11-16 20:29:49,701 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 144 treesize of output 67 [2022-11-16 20:29:49,736 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-16 20:29:49,736 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 107 [2022-11-16 20:29:49,762 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-16 20:29:49,762 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 148 [2022-11-16 20:29:49,875 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 122 treesize of output 94 [2022-11-16 20:29:49,994 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2022-11-16 20:29:49,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 44 [2022-11-16 20:29:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:29:50,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:29:50,016 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_680 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_684))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_686) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-16 20:29:50,393 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_680 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (or (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_684))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_686) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_680) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))) (not (= .cse4 (select .cse3 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14|)))))))) is different from false [2022-11-16 20:29:50,635 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| Int) (v_ArrVal_692 (Array Int Int)) (v_ArrVal_691 (Array Int Int)) (v_ArrVal_680 (Array Int Int)) (v_ArrVal_684 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14| Int) (v_ArrVal_686 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_691))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_692))) (let ((.cse5 (select (select .cse6 .cse1) (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (select .cse6 .cse5))) (or (not (= (select .cse0 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14|) .cse1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|) 0)) (not (let ((.cse3 (store (store .cse6 .cse5 (store .cse0 |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_14| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_684))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse2 (select (select .cse3 .cse2) (select (select (store (store .cse4 .cse5 v_ArrVal_686) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| v_ArrVal_680) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_24| |c_#StackHeapBarrier|)))))))) is different from false [2022-11-16 20:29:50,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700462169] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:29:50,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [671525184] [2022-11-16 20:29:50,643 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-16 20:29:50,644 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:29:50,644 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 20:29:50,644 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 20:29:50,644 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 20:29:50,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:50,671 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 20:29:50,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-16 20:29:50,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:50,696 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 20:29:50,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-16 20:29:50,721 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-16 20:29:50,725 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-16 20:29:50,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:50,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2022-11-16 20:29:50,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:50,739 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-16 20:29:50,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:50,751 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-16 20:29:50,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:50,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 20:29:50,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:50,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 20:29:50,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:50,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 20:29:50,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:50,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 20:29:50,883 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-16 20:29:50,891 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-16 20:29:50,900 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-16 20:29:50,910 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-16 20:29:50,920 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-16 20:29:50,954 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-16 20:29:50,962 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-16 20:29:50,971 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-16 20:29:50,980 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-16 20:29:50,990 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-16 20:29:51,023 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-16 20:29:51,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:51,037 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-16 20:29:51,047 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-16 20:29:51,287 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:51,289 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:51,290 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:51,292 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:51,294 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:51,304 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-16 20:29:51,315 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-16 20:29:51,325 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-16 20:29:51,336 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-16 20:29:51,344 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-16 20:29:51,533 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-16 20:29:51,542 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-16 20:29:51,551 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-16 20:29:51,563 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-16 20:29:51,572 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-16 20:29:51,585 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:51,586 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:51,589 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:51,591 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:51,592 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:51,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:51,628 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-16 20:29:51,647 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-16 20:29:51,661 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-16 20:29:51,965 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:51,968 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:51,969 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:51,972 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:51,974 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:51,985 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-16 20:29:51,994 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-16 20:29:52,002 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-16 20:29:52,012 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-16 20:29:52,021 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-16 20:29:52,168 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-16 20:29:52,178 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-16 20:29:52,188 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-16 20:29:52,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-16 20:29:52,208 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-16 20:29:52,220 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:52,222 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:52,223 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:52,225 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:52,227 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:52,278 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-16 20:29:52,314 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 20:29:52,314 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-16 20:29:52,345 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 20:29:52,345 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-16 20:29:52,400 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-16 20:29:52,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:52,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:52,421 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:52,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:29:52,446 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-16 20:29:52,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:52,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:52,473 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:52,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:29:52,487 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-16 20:29:52,550 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-16 20:29:52,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:52,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:52,569 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:52,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:29:52,582 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-16 20:29:52,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:52,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:52,606 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:29:52,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:29:52,622 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-16 20:29:52,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:52,949 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-16 20:29:52,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-16 20:29:53,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:53,041 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-16 20:29:53,042 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-16 20:29:53,046 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:29:53,056 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 5 treesize of output 3 [2022-11-16 20:29:53,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:53,163 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-16 20:29:53,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-16 20:29:53,231 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-16 20:29:53,232 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 60 treesize of output 67 [2022-11-16 20:29:53,251 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 5 treesize of output 3 [2022-11-16 20:29:53,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:29:53,281 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 16 treesize of output 20 [2022-11-16 20:29:53,296 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 5 treesize of output 3 [2022-11-16 20:29:53,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:29:53,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:53,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2022-11-16 20:29:53,353 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:29:53,353 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 21 treesize of output 25 [2022-11-16 20:29:53,459 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-16 20:29:53,459 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 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-16 20:29:54,110 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-16 20:29:54,118 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-16 20:29:54,123 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-16 20:29:54,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:54,141 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-16 20:29:54,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:54,148 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-16 20:29:54,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:29:54,157 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-16 20:29:54,159 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 20:30:05,123 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1237#(and (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))))) (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 5 |ULTIMATE.start_sll_circular_append_#in~data#1|) (<= |ULTIMATE.start_sll_circular_append_~data#1| 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~last~2#1.offset|) (or (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (or (exists ((v_DerPreprocessor_19 (Array Int Int))) (and (= (select v_DerPreprocessor_19 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (exists ((v_DerPreprocessor_18 (Array Int Int))) (and (= (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= v_DerPreprocessor_18 (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_18) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_19) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)))))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|))) (= |#NULL.base| 0))' at error location [2022-11-16 20:30:05,123 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 20:30:05,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:30:05,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 40 [2022-11-16 20:30:05,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276127566] [2022-11-16 20:30:05,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:30:05,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-16 20:30:05,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:30:05,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-16 20:30:05,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=3792, Unknown=41, NotChecked=378, Total=4422 [2022-11-16 20:30:05,127 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 40 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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-16 20:30:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:30:06,071 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2022-11-16 20:30:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 20:30:06,071 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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 30 [2022-11-16 20:30:06,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:30:06,073 INFO L225 Difference]: With dead ends: 59 [2022-11-16 20:30:06,073 INFO L226 Difference]: Without dead ends: 51 [2022-11-16 20:30:06,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=270, Invalid=4671, Unknown=41, NotChecked=420, Total=5402 [2022-11-16 20:30:06,075 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 20:30:06,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 378 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 499 Invalid, 0 Unknown, 75 Unchecked, 0.4s Time] [2022-11-16 20:30:06,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-16 20:30:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 41. [2022-11-16 20:30:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 20:30:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-11-16 20:30:06,088 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 30 [2022-11-16 20:30:06,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:30:06,089 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-11-16 20:30:06,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 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-16 20:30:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-11-16 20:30:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 20:30:06,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:30:06,090 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:30:06,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-16 20:30:06,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:30:06,296 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:30:06,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:30:06,297 INFO L85 PathProgramCache]: Analyzing trace with hash 778550271, now seen corresponding path program 1 times [2022-11-16 20:30:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:30:06,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057289564] [2022-11-16 20:30:06,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:30:06,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:30:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:30:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 20:30:08,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:30:08,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057289564] [2022-11-16 20:30:08,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057289564] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:30:08,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332660348] [2022-11-16 20:30:08,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:30:08,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:30:08,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:30:08,711 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:30:08,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 20:30:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:30:09,372 WARN L261 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 194 conjunts are in the unsatisfiable core [2022-11-16 20:30:09,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:30:09,439 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-16 20:30:09,720 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 5 treesize of output 3 [2022-11-16 20:30:09,802 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-16 20:30:09,915 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 20:30:09,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 20:30:10,027 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-16 20:30:10,044 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 18 [2022-11-16 20:30:10,060 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-16 20:30:10,191 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 20:30:10,191 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 83 treesize of output 58 [2022-11-16 20:30:10,197 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 26 treesize of output 28 [2022-11-16 20:30:10,212 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 26 treesize of output 28 [2022-11-16 20:30:10,365 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:30:10,366 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2022-11-16 20:30:10,379 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-16 20:30:10,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:10,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 20:30:10,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 20:30:10,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:10,666 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 20:30:10,667 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 75 [2022-11-16 20:30:10,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:10,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:10,693 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 20:30:10,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2022-11-16 20:30:10,725 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 20:30:10,726 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 18 treesize of output 28 [2022-11-16 20:30:10,735 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 5 treesize of output 3 [2022-11-16 20:30:10,759 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 20:30:10,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-16 20:30:12,047 INFO L321 Elim1Store]: treesize reduction 143, result has 15.4 percent of original size [2022-11-16 20:30:12,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 305 treesize of output 154 [2022-11-16 20:30:12,094 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-16 20:30:12,095 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 427 treesize of output 278 [2022-11-16 20:30:12,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:12,146 INFO L321 Elim1Store]: treesize reduction 123, result has 14.0 percent of original size [2022-11-16 20:30:12,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 815 treesize of output 482 [2022-11-16 20:30:12,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:12,257 INFO L321 Elim1Store]: treesize reduction 369, result has 5.1 percent of original size [2022-11-16 20:30:12,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 10 new quantified variables, introduced 17 case distinctions, treesize of input 671 treesize of output 680 [2022-11-16 20:30:12,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:12,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:12,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 65 [2022-11-16 20:30:12,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 77 treesize of output 173 [2022-11-16 20:30:12,314 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 32 treesize of output 31 [2022-11-16 20:30:12,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 77 treesize of output 173 [2022-11-16 20:30:12,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 316 treesize of output 129 [2022-11-16 20:30:13,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:13,091 INFO L321 Elim1Store]: treesize reduction 386, result has 3.3 percent of original size [2022-11-16 20:30:13,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 25 case distinctions, treesize of input 745 treesize of output 437 [2022-11-16 20:30:13,105 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 285 treesize of output 257 [2022-11-16 20:30:13,392 INFO L321 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2022-11-16 20:30:13,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 53 [2022-11-16 20:30:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:30:13,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:30:25,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332660348] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:30:25,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1763837532] [2022-11-16 20:30:25,154 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-16 20:30:25,154 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:30:25,155 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 20:30:25,155 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 20:30:25,155 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 20:30:25,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:25,185 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 20:30:25,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-16 20:30:25,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:25,214 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 20:30:25,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-16 20:30:25,235 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-16 20:30:25,242 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-16 20:30:25,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:25,251 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-16 20:30:25,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:25,257 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-16 20:30:25,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:25,266 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-16 20:30:25,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:25,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 20:30:25,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:25,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 20:30:25,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:25,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 20:30:25,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:25,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 20:30:25,546 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-16 20:30:25,555 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-16 20:30:25,565 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-16 20:30:25,583 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-16 20:30:25,592 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-16 20:30:25,604 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:25,606 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:25,608 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:25,611 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:25,613 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:25,783 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-16 20:30:25,792 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-16 20:30:25,802 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-16 20:30:25,812 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-16 20:30:25,821 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-16 20:30:25,833 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:25,834 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:25,836 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:25,840 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:25,842 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:25,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:25,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:25,909 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 221 treesize of output 205 [2022-11-16 20:30:25,921 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:25,921 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 219 treesize of output 207 [2022-11-16 20:30:25,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:25,936 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 227 treesize of output 110 [2022-11-16 20:30:26,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:26,095 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-16 20:30:26,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:26,117 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-16 20:30:26,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:26,129 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-16 20:30:26,284 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-16 20:30:26,295 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-16 20:30:26,310 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-16 20:30:26,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:26,409 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:30:26,409 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 15 treesize of output 7 [2022-11-16 20:30:26,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:26,431 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:30:26,431 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 15 treesize of output 7 [2022-11-16 20:30:26,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:26,535 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:30:26,535 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 15 treesize of output 7 [2022-11-16 20:30:26,547 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:26,552 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:30:26,553 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 15 treesize of output 7 [2022-11-16 20:30:26,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:26,747 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-16 20:30:26,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-16 20:30:26,811 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-16 20:30:26,811 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 60 treesize of output 67 [2022-11-16 20:30:26,825 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 5 treesize of output 3 [2022-11-16 20:30:26,842 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 5 treesize of output 3 [2022-11-16 20:30:26,877 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:30:26,878 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 7 [2022-11-16 20:30:26,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:26,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:26,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2022-11-16 20:30:26,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:30:26,925 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 21 treesize of output 25 [2022-11-16 20:30:26,939 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:26,947 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:27,050 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-16 20:30:27,050 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 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-16 20:30:27,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:27,159 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-16 20:30:27,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-16 20:30:27,239 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-16 20:30:27,239 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 60 treesize of output 67 [2022-11-16 20:30:27,255 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 5 treesize of output 3 [2022-11-16 20:30:27,277 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 5 treesize of output 3 [2022-11-16 20:30:27,302 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:30:27,303 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 7 [2022-11-16 20:30:27,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:27,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:27,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2022-11-16 20:30:27,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 20:30:27,378 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 21 treesize of output 25 [2022-11-16 20:30:27,394 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:42,659 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-16 20:30:42,666 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-16 20:30:42,671 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-16 20:30:42,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:42,685 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-16 20:30:42,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:42,696 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-16 20:30:42,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:42,703 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-16 20:30:42,707 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 20:30:48,518 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1610#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 5 |ULTIMATE.start_sll_circular_append_#in~data#1|) (<= |ULTIMATE.start_sll_circular_append_~data#1| 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (<= |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|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-16 20:30:48,518 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 20:30:48,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:30:48,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 47 [2022-11-16 20:30:48,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687558149] [2022-11-16 20:30:48,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:30:48,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-16 20:30:48,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:30:48,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-16 20:30:48,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=5679, Unknown=38, NotChecked=0, Total=6006 [2022-11-16 20:30:48,522 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 47 states, 38 states have (on average 1.236842105263158) internal successors, (47), 37 states have internal predecessors, (47), 6 states have call successors, (6), 4 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-16 20:30:50,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:30:50,050 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2022-11-16 20:30:50,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 20:30:50,051 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 38 states have (on average 1.236842105263158) internal successors, (47), 37 states have internal predecessors, (47), 6 states have call successors, (6), 4 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 32 [2022-11-16 20:30:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:30:50,055 INFO L225 Difference]: With dead ends: 61 [2022-11-16 20:30:50,056 INFO L226 Difference]: Without dead ends: 53 [2022-11-16 20:30:50,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1505 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=359, Invalid=6742, Unknown=39, NotChecked=0, Total=7140 [2022-11-16 20:30:50,062 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 20:30:50,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 388 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 622 Invalid, 0 Unknown, 60 Unchecked, 0.6s Time] [2022-11-16 20:30:50,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-16 20:30:50,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2022-11-16 20:30:50,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 20:30:50,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2022-11-16 20:30:50,078 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 32 [2022-11-16 20:30:50,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:30:50,078 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-11-16 20:30:50,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 38 states have (on average 1.236842105263158) internal successors, (47), 37 states have internal predecessors, (47), 6 states have call successors, (6), 4 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-16 20:30:50,079 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2022-11-16 20:30:50,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 20:30:50,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:30:50,080 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:30:50,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 20:30:50,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 20:30:50,282 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:30:50,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:30:50,283 INFO L85 PathProgramCache]: Analyzing trace with hash 506280767, now seen corresponding path program 2 times [2022-11-16 20:30:50,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:30:50,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502893922] [2022-11-16 20:30:50,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:30:50,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:30:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:30:51,808 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 20:30:51,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:30:51,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502893922] [2022-11-16 20:30:51,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502893922] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:30:51,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948252145] [2022-11-16 20:30:51,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:30:51,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:30:51,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:30:51,810 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:30:51,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 20:30:52,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 20:30:52,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:30:52,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-16 20:30:52,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:30:52,242 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-16 20:30:52,445 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-16 20:30:52,448 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2022-11-16 20:30:52,487 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-16 20:30:52,497 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-16 20:30:52,503 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from false [2022-11-16 20:30:52,506 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from true [2022-11-16 20:30:52,541 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-11-16 20:30:52,541 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 72 treesize of output 42 [2022-11-16 20:30:52,571 INFO L321 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2022-11-16 20:30:52,572 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 39 treesize of output 30 [2022-11-16 20:30:52,585 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)))) is different from false [2022-11-16 20:30:52,588 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)))) is different from true [2022-11-16 20:30:52,623 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-16 20:30:52,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 43 [2022-11-16 20:30:52,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:52,637 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:30:52,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:30:52,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:52,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:52,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:52,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:52,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:52,750 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-16 20:30:52,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 48 [2022-11-16 20:30:52,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:52,784 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-16 20:30:52,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 77 [2022-11-16 20:30:52,816 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |v_old(#valid)_AFTER_CALL_68| .cse2))) |v_old(#valid)_AFTER_CALL_68|)))))) is different from false [2022-11-16 20:30:52,819 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |v_old(#valid)_AFTER_CALL_68| .cse2))) |v_old(#valid)_AFTER_CALL_68|)))))) is different from true [2022-11-16 20:30:52,862 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |v_old(#valid)_AFTER_CALL_68| .cse2))) |v_old(#valid)_AFTER_CALL_68|)))))) is different from false [2022-11-16 20:30:52,865 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse2 (select |v_old(#valid)_AFTER_CALL_68| .cse2))) |v_old(#valid)_AFTER_CALL_68|)))))) is different from true [2022-11-16 20:30:52,917 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse3 0))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse4 (select |v_old(#valid)_AFTER_CALL_68| .cse4))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from false [2022-11-16 20:30:52,920 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse3 0))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse4 (select |v_old(#valid)_AFTER_CALL_68| .cse4))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from true [2022-11-16 20:30:53,008 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from false [2022-11-16 20:30:53,011 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from true [2022-11-16 20:30:53,087 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:53,114 INFO L321 Elim1Store]: treesize reduction 154, result has 4.3 percent of original size [2022-11-16 20:30:53,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 14 case distinctions, treesize of input 96 treesize of output 51 [2022-11-16 20:30:53,126 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse2 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) 0)) 0)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from false [2022-11-16 20:30:53,129 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse2 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) 0)) 0)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from true [2022-11-16 20:30:53,156 INFO L321 Elim1Store]: treesize reduction 41, result has 16.3 percent of original size [2022-11-16 20:30:53,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 41 [2022-11-16 20:30:53,173 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |v_old(#valid)_AFTER_CALL_68| .cse0))) |v_old(#valid)_AFTER_CALL_68|))) is different from false [2022-11-16 20:30:53,176 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |v_old(#valid)_AFTER_CALL_68| .cse0))) |v_old(#valid)_AFTER_CALL_68|))) is different from true [2022-11-16 20:30:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-16 20:30:53,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:30:53,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948252145] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:30:53,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1496560032] [2022-11-16 20:30:53,508 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-16 20:30:53,509 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:30:53,509 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 20:30:53,509 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 20:30:53,509 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 20:30:53,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:53,549 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 20:30:53,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-16 20:30:53,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:53,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-16 20:30:53,581 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-16 20:30:53,585 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-16 20:30:53,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:53,593 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-16 20:30:53,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:53,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 22 treesize of output 7 [2022-11-16 20:30:53,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:53,608 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-16 20:30:53,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:53,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 20:30:53,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:53,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 20:30:53,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:53,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 20:30:53,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:53,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 20:30:53,890 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-16 20:30:53,899 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-16 20:30:53,908 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-16 20:30:53,919 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-16 20:30:53,927 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-16 20:30:53,938 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:53,940 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:53,942 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:53,944 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:53,945 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:54,100 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-16 20:30:54,110 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-16 20:30:54,120 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-16 20:30:54,129 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-16 20:30:54,145 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-16 20:30:54,157 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:54,160 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:54,161 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:54,163 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:54,164 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:54,197 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-16 20:30:54,208 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-16 20:30:54,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:54,219 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-16 20:30:54,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:54,363 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-16 20:30:54,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:54,374 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-16 20:30:54,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:54,386 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-16 20:30:54,541 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-16 20:30:54,551 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-16 20:30:54,562 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-16 20:30:54,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:54,665 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:30:54,665 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 15 treesize of output 7 [2022-11-16 20:30:54,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:54,685 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:30:54,685 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 15 treesize of output 7 [2022-11-16 20:30:54,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:54,783 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:30:54,783 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 15 treesize of output 7 [2022-11-16 20:30:54,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:54,808 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:30:54,809 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 15 treesize of output 7 [2022-11-16 20:30:55,016 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-16 20:30:55,017 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 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-16 20:30:55,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:55,100 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-16 20:30:55,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-16 20:30:55,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:55,181 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-16 20:30:55,181 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-16 20:30:55,193 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 5 treesize of output 3 [2022-11-16 20:30:55,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:55,290 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-16 20:30:55,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-16 20:30:55,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:30:55,384 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-16 20:30:55,384 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-16 20:30:55,395 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:30:55,407 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 5 treesize of output 3 [2022-11-16 20:30:55,974 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 21 for LOIs [2022-11-16 20:30:55,983 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-16 20:30:55,988 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-16 20:30:56,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:56,003 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-16 20:30:56,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:56,013 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-16 20:30:56,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:30:56,023 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-16 20:30:56,025 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 20:31:06,099 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1972#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 5 |ULTIMATE.start_sll_circular_append_#in~data#1|) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (and (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int))) (and (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_DerPreprocessor_40 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) v_DerPreprocessor_39))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (exists ((v_DerPreprocessor_40 (Array Int Int))) (and (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select v_DerPreprocessor_40 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (exists ((v_DerPreprocessor_39 (Array Int Int))) (and (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) v_DerPreprocessor_39) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select (store (store (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_39) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_40) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))))))))) (<= |ULTIMATE.start_sll_circular_append_~data#1| 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~ptr~0#1.offset|) (= |ULTIMATE.start_main_~uneq~0#1| 5) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |ULTIMATE.start_main_~count~0#1| 0) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~last~2#1.base|) |ULTIMATE.start_main_~last~2#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (or (and (or (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|)) (not (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (exists ((v_DerPreprocessor_42 (Array Int Int))) (and (exists ((v_DerPreprocessor_41 (Array Int Int))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|)) (= v_DerPreprocessor_41 (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~last~1#1.base|)) (= (select (select (store (store (store (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~last~1#1.base| v_DerPreprocessor_41) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (= (select v_DerPreprocessor_42 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) (= |ULTIMATE.start_sll_circular_append_~head#1.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~head#1.base|) |ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~head#1.offset|) (= |ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) (= |ULTIMATE.start_sll_circular_append_~last~1#1.base| |ULTIMATE.start_sll_circular_append_~head#1.base|))) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |ULTIMATE.start_main_~last~2#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_main_~last~2#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-16 20:31:06,099 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 20:31:06,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:31:06,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 34 [2022-11-16 20:31:06,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864291818] [2022-11-16 20:31:06,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:31:06,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 20:31:06,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:31:06,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 20:31:06,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2370, Unknown=44, NotChecked=954, Total=3540 [2022-11-16 20:31:06,102 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 34 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 20:31:06,340 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-16 20:31:06,342 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2022-11-16 20:31:06,346 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= .cse1 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-16 20:31:06,349 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_135| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= .cse1 0) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-16 20:31:06,353 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse2) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 0) 0) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) .cse1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse1) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse3) 0) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_135| .cse4) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2022-11-16 20:31:06,357 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) .cse1)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.base| .cse0) .cse1) .cse2) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse4) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 0) 0) (= (select |c_#valid| .cse3) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse1) .cse1) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) .cse1) (exists ((|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse3) 0) (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_135| |c_#valid|))) (store |v_#valid_BEFORE_CALL_135| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_135| .cse4) 1))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) 0) 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2022-11-16 20:31:06,369 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse7 0)) (.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (<= (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse4) .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from false [2022-11-16 20:31:06,372 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse7 0)) (.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (<= (+ 2 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse4) .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from true [2022-11-16 20:31:06,376 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse7 0)) (.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse4) .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from false [2022-11-16 20:31:06,379 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse7 0)) (.cse2 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse2 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (= (select .cse5 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse4) .cse4) (= (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4) .cse4) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from true [2022-11-16 20:31:06,384 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse7 0))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) .cse4) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse3) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse4 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse5 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse3) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) .cse3))))) is different from false [2022-11-16 20:31:06,387 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse7 0))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse3 (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) .cse4) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse3) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse4 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse5 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse6 (select |v_old(#valid)_AFTER_CALL_68| .cse6))) |v_old(#valid)_AFTER_CALL_68|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse3) (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) .cse3))))) is different from true [2022-11-16 20:31:06,392 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse8 0)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse2) (= .cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse5 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse6 0) 0) (= .cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse7 (select |v_old(#valid)_AFTER_CALL_68| .cse7))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from false [2022-11-16 20:31:06,395 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse0 (select .cse8 0)) (.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse8 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| .cse2) (= .cse2 (select (select |c_#memory_$Pointer$.offset| .cse3) .cse4)) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= .cse5 |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select .cse6 0) 0) (= .cse5 (select (select |c_#memory_$Pointer$.base| .cse3) .cse4)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse7 (select |v_old(#valid)_AFTER_CALL_68| .cse7))) |v_old(#valid)_AFTER_CALL_68|))))))) is different from true [2022-11-16 20:31:06,402 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse3 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (= .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse4 (select |v_old(#valid)_AFTER_CALL_68| .cse4))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse5))))) is different from false [2022-11-16 20:31:06,405 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse3 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (= .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|)) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse4 (select |v_old(#valid)_AFTER_CALL_68| .cse4))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse3) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse3) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|) .cse5))))) is different from true [2022-11-16 20:31:06,443 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from false [2022-11-16 20:31:06,446 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (.cse0 (select .cse6 0))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) 0)) (.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.base| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (= .cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 0) 0) (= |c_ULTIMATE.start_sll_circular_append_#t~mem13#1.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (= (select .cse2 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_68| (Array Int Int)) (|v_#valid_BEFORE_CALL_135| (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.base| Int)) (and (= (select |v_#valid_BEFORE_CALL_135| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_68| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_68| |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) 0) (<= (+ 2 |ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) (= (select |v_#valid_BEFORE_CALL_135| .cse1) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_135| |v_old(#valid)_AFTER_CALL_68|))) (store |v_#valid_BEFORE_CALL_135| .cse3 (select |v_old(#valid)_AFTER_CALL_68| .cse3))) |v_old(#valid)_AFTER_CALL_68|))) (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| .cse4) .cse5)) (= (select (select |c_#memory_$Pointer$.base| .cse4) .cse5) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|))))) is different from true [2022-11-16 20:31:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:31:06,492 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2022-11-16 20:31:06,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 20:31:06,497 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 32 [2022-11-16 20:31:06,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:31:06,498 INFO L225 Difference]: With dead ends: 67 [2022-11-16 20:31:06,498 INFO L226 Difference]: Without dead ends: 53 [2022-11-16 20:31:06,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=218, Invalid=2762, Unknown=62, NotChecked=2214, Total=5256 [2022-11-16 20:31:06,501 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 317 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 20:31:06,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 196 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 103 Invalid, 0 Unknown, 317 Unchecked, 0.1s Time] [2022-11-16 20:31:06,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-16 20:31:06,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-16 20:31:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 20:31:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2022-11-16 20:31:06,513 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 32 [2022-11-16 20:31:06,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:31:06,514 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2022-11-16 20:31:06,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 20:31:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-11-16 20:31:06,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 20:31:06,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:31:06,515 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:31:06,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 20:31:06,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:31:06,718 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:31:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:31:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash 909229690, now seen corresponding path program 2 times [2022-11-16 20:31:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:31:06,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022946112] [2022-11-16 20:31:06,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:31:06,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:31:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:31:09,161 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 20:31:09,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:31:09,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022946112] [2022-11-16 20:31:09,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022946112] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:31:09,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638094456] [2022-11-16 20:31:09,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:31:09,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:31:09,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:31:09,163 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:31:09,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 20:31:09,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 20:31:09,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:31:09,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 140 conjunts are in the unsatisfiable core [2022-11-16 20:31:09,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:31:09,556 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-16 20:31:09,606 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 5 treesize of output 3 [2022-11-16 20:31:09,709 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 20:31:09,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-16 20:31:09,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 20:31:09,943 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-16 20:31:10,048 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-16 20:31:10,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-16 20:31:10,164 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 19 treesize of output 18 [2022-11-16 20:31:10,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-16 20:31:10,319 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 20:31:10,319 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 51 [2022-11-16 20:31:10,325 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 26 treesize of output 28 [2022-11-16 20:31:10,463 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 20:31:10,463 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 33 [2022-11-16 20:31:10,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-16 20:31:10,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 20:31:10,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:10,625 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 14 treesize of output 16 [2022-11-16 20:31:10,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:10,650 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 20:31:10,650 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 58 [2022-11-16 20:31:10,671 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 20:31:10,671 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 18 treesize of output 28 [2022-11-16 20:31:10,678 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 5 treesize of output 3 [2022-11-16 20:31:10,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:10,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:10,703 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 20:31:10,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-11-16 20:31:11,324 INFO L321 Elim1Store]: treesize reduction 111, result has 14.0 percent of original size [2022-11-16 20:31:11,324 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 157 treesize of output 83 [2022-11-16 20:31:11,365 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-16 20:31:11,366 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 115 [2022-11-16 20:31:11,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2022-11-16 20:31:11,387 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2022-11-16 20:31:11,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:11,394 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 26 treesize of output 28 [2022-11-16 20:31:11,521 INFO L321 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2022-11-16 20:31:11,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 42 [2022-11-16 20:31:11,525 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 15 treesize of output 7 [2022-11-16 20:31:11,597 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 15 treesize of output 7 [2022-11-16 20:31:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-16 20:31:11,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 20:31:11,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_1198) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1192) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-16 20:31:11,791 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1198) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1192) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-16 20:31:11,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1198) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1192) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-16 20:31:11,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1198) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1192) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1193) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-11-16 20:31:11,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1192 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| Int) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| Int) (|ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| Int) (v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1195 (Array Int Int)) (v_ArrVal_1193 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1213)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1211))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1212) .cse0 v_ArrVal_1198) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1192) (select (select (store (store .cse1 .cse0 (store (select .cse1 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1193) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse0 (store (select .cse2 .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_31| |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_36| v_ArrVal_1195) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) is different from false [2022-11-16 20:31:11,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638094456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:31:11,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1523033418] [2022-11-16 20:31:11,991 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2022-11-16 20:31:11,991 INFO L166 IcfgInterpreter]: Building call graph [2022-11-16 20:31:11,992 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-16 20:31:11,992 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-16 20:31:11,992 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-16 20:31:12,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:12,022 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 20:31:12,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-16 20:31:12,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:12,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-16 20:31:12,055 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-16 20:31:12,059 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-16 20:31:12,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:12,069 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-16 20:31:12,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:12,075 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-16 20:31:12,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:12,081 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-16 20:31:12,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:12,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 20:31:12,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:12,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 20:31:12,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:12,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-16 20:31:12,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:12,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-16 20:31:12,208 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-16 20:31:12,223 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-16 20:31:12,232 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-16 20:31:12,243 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-16 20:31:12,256 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-16 20:31:12,305 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-16 20:31:12,313 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-16 20:31:12,322 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-16 20:31:12,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-16 20:31:12,338 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-16 20:31:12,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:12,376 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-16 20:31:12,386 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-16 20:31:12,395 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-16 20:31:12,460 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-16 20:31:12,469 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-16 20:31:12,479 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-16 20:31:12,487 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-16 20:31:12,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-16 20:31:12,529 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-16 20:31:12,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-16 20:31:12,546 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-16 20:31:12,554 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-16 20:31:12,563 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-16 20:31:12,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:31:12,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:12,627 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 221 treesize of output 205 [2022-11-16 20:31:12,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:31:12,639 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 219 treesize of output 207 [2022-11-16 20:31:12,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:31:12,652 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 235 treesize of output 114 [2022-11-16 20:31:12,728 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-16 20:31:12,737 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-16 20:31:12,745 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-16 20:31:12,755 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-16 20:31:12,767 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-16 20:31:12,803 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-16 20:31:12,813 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-16 20:31:12,825 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-16 20:31:12,834 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-16 20:31:12,843 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-16 20:31:12,904 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 20:31:12,905 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-16 20:31:12,920 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-16 20:31:12,947 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-16 20:31:12,948 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-16 20:31:13,007 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-16 20:31:13,020 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-16 20:31:13,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:13,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:13,041 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:31:13,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:31:13,060 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-16 20:31:13,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:13,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:13,082 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:31:13,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:31:13,146 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-16 20:31:13,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:13,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:13,168 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:31:13,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:31:13,186 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-16 20:31:13,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-16 20:31:13,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:13,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:13,223 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:31:13,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-16 20:31:13,487 INFO L321 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-11-16 20:31:13,488 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 1 case distinctions, treesize of input 31 treesize of output 15 [2022-11-16 20:31:13,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:31:13,574 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-16 20:31:13,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-16 20:31:13,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:31:13,656 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-16 20:31:13,657 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 37 [2022-11-16 20:31:13,668 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 5 treesize of output 3 [2022-11-16 20:31:13,689 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:31:13,763 INFO L321 Elim1Store]: treesize reduction 117, result has 32.4 percent of original size [2022-11-16 20:31:13,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 88 treesize of output 120 [2022-11-16 20:31:13,847 INFO L321 Elim1Store]: treesize reduction 39, result has 48.7 percent of original size [2022-11-16 20:31:13,848 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 60 treesize of output 67 [2022-11-16 20:31:13,873 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 5 treesize of output 3 [2022-11-16 20:31:13,889 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 5 treesize of output 3 [2022-11-16 20:31:13,915 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:31:13,915 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 7 [2022-11-16 20:31:13,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 20:31:13,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:13,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2022-11-16 20:31:13,976 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 20:31:13,977 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 7 [2022-11-16 20:31:13,988 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:31:14,014 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-16 20:31:16,283 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 13 for LOIs [2022-11-16 20:31:16,288 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-16 20:31:16,292 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-16 20:31:16,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:16,303 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-16 20:31:16,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:16,312 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-16 20:31:16,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 20:31:16,319 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-16 20:31:16,320 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-16 20:31:24,440 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2382#(and (<= 2 |ULTIMATE.start_sll_circular_create_#in~len#1|) (<= 0 |ULTIMATE.start_main_~count~0#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (<= |ULTIMATE.start_main_~uneq~0#1| 5) (<= 5 |ULTIMATE.start_sll_circular_append_#in~data#1|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 5 |ULTIMATE.start_main_~uneq~0#1|) (<= |ULTIMATE.start_sll_circular_append_~data#1| 5) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) (+ |ULTIMATE.start_main_~ptr~0#1.offset| 4)) |ULTIMATE.start_main_~data~0#1|)) (<= |ULTIMATE.start_sll_circular_create_#in~data#1| 1) (<= 1 |ULTIMATE.start_sll_circular_create_~len#1|) (<= |ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.base|) (<= |ULTIMATE.start_sll_circular_append_#in~data#1| 5) (<= |ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (<= |ULTIMATE.start_sll_circular_create_#in~len#1| 2) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 0 |ULTIMATE.start_sll_circular_create_~last~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_#in~head#1.offset|) (<= 1 |ULTIMATE.start_sll_circular_create_~data#1|) (<= 0 |ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.base|) (<= |ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (<= 1 |ULTIMATE.start_sll_circular_create_#in~data#1|) (<= 0 |ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|) (<= |ULTIMATE.start_sll_circular_create_~len#1| 1) (<= |ULTIMATE.start_sll_circular_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_circular_append_#in~head#1.offset| 0) (<= |ULTIMATE.start_main_~count~0#1| 0) (<= |ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (<= 5 |ULTIMATE.start_sll_circular_append_~data#1|) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= 0 |ULTIMATE.start_sll_circular_append_~head#1.offset|) (<= 0 |#NULL.offset|) (<= 0 |ULTIMATE.start_sll_circular_create_#res#1.offset|) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_sll_circular_append_~head#1.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|))' at error location [2022-11-16 20:31:24,440 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-16 20:31:24,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 20:31:24,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 38 [2022-11-16 20:31:24,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012095401] [2022-11-16 20:31:24,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 20:31:24,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-16 20:31:24,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:31:24,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-16 20:31:24,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3354, Unknown=10, NotChecked=600, Total=4160 [2022-11-16 20:31:24,444 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 39 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 20:31:25,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:31:25,646 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-11-16 20:31:25,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 20:31:25,646 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2022-11-16 20:31:25,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:31:25,647 INFO L225 Difference]: With dead ends: 62 [2022-11-16 20:31:25,647 INFO L226 Difference]: Without dead ends: 60 [2022-11-16 20:31:25,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=256, Invalid=4176, Unknown=10, NotChecked=670, Total=5112 [2022-11-16 20:31:25,649 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 20:31:25,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 345 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 545 Invalid, 0 Unknown, 54 Unchecked, 0.6s Time] [2022-11-16 20:31:25,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-16 20:31:25,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-11-16 20:31:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-16 20:31:25,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 69 transitions. [2022-11-16 20:31:25,664 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 69 transitions. Word has length 34 [2022-11-16 20:31:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:31:25,664 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 69 transitions. [2022-11-16 20:31:25,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 30 states have internal predecessors, (43), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-16 20:31:25,665 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-11-16 20:31:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 20:31:25,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:31:25,666 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:31:25,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 20:31:25,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:31:25,878 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:31:25,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:31:25,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2024483017, now seen corresponding path program 2 times [2022-11-16 20:31:25,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:31:25,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401191915] [2022-11-16 20:31:25,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:31:25,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:31:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:31:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-16 20:31:25,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:31:25,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401191915] [2022-11-16 20:31:25,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401191915] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:31:25,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476232016] [2022-11-16 20:31:25,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 20:31:25,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:31:25,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:31:25,980 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:31:26,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 20:31:26,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 20:31:26,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 20:31:26,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 20:31:26,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:31:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 20:31:26,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 20:31:26,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476232016] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 20:31:26,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 20:31:26,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-16 20:31:26,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582543728] [2022-11-16 20:31:26,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 20:31:26,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 20:31:26,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-16 20:31:26,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 20:31:26,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:31:26,301 INFO L87 Difference]: Start difference. First operand 59 states and 69 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 20:31:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 20:31:26,330 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-11-16 20:31:26,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 20:31:26,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2022-11-16 20:31:26,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 20:31:26,331 INFO L225 Difference]: With dead ends: 70 [2022-11-16 20:31:26,331 INFO L226 Difference]: Without dead ends: 38 [2022-11-16 20:31:26,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 20:31:26,343 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 20:31:26,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 37 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 20:31:26,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-16 20:31:26,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-16 20:31:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-16 20:31:26,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-11-16 20:31:26,361 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 36 [2022-11-16 20:31:26,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 20:31:26,363 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-11-16 20:31:26,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-16 20:31:26,363 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-11-16 20:31:26,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 20:31:26,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 20:31:26,364 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 20:31:26,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 20:31:26,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:31:26,571 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 20:31:26,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 20:31:26,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1496251498, now seen corresponding path program 1 times [2022-11-16 20:31:26,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-16 20:31:26,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902132150] [2022-11-16 20:31:26,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:31:26,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 20:31:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:31:26,957 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 20:31:26,957 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-16 20:31:26,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902132150] [2022-11-16 20:31:26,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902132150] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 20:31:26,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699414809] [2022-11-16 20:31:26,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 20:31:26,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 20:31:26,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 [2022-11-16 20:31:26,963 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 20:31:26,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_76d4b0b6-130c-4dab-a452-32db0ff4ebc4/bin/utaipan-Xvt2sAort0/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 20:31:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 20:31:27,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-16 20:31:27,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 20:31:27,956 INFO L321 Elim1Store]: treesize reduction 80, result has 79.6 percent of original size [2022-11-16 20:31:27,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 279 treesize of output 461 [2022-11-16 20:31:28,299 INFO L321 Elim1Store]: treesize reduction 72, result has 78.6 percent of original size [2022-11-16 20:31:28,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 491 treesize of output 555