./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 16:08:04,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 16:08:04,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 16:08:04,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 16:08:04,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 16:08:04,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 16:08:04,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 16:08:04,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 16:08:04,518 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 16:08:04,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 16:08:04,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 16:08:04,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 16:08:04,522 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 16:08:04,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 16:08:04,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 16:08:04,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 16:08:04,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 16:08:04,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 16:08:04,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 16:08:04,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 16:08:04,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 16:08:04,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 16:08:04,539 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 16:08:04,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 16:08:04,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 16:08:04,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 16:08:04,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 16:08:04,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 16:08:04,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 16:08:04,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 16:08:04,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 16:08:04,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 16:08:04,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 16:08:04,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 16:08:04,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 16:08:04,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 16:08:04,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 16:08:04,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 16:08:04,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 16:08:04,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 16:08:04,555 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 16:08:04,556 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 16:08:04,590 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 16:08:04,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 16:08:04,590 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 16:08:04,591 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 16:08:04,591 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 16:08:04,591 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 16:08:04,592 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 16:08:04,592 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 16:08:04,592 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 16:08:04,592 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 16:08:04,592 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 16:08:04,593 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 16:08:04,593 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 16:08:04,593 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 16:08:04,593 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 16:08:04,594 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 16:08:04,594 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 16:08:04,594 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 16:08:04,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 16:08:04,599 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 16:08:04,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 16:08:04,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 16:08:04,599 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 16:08:04,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 16:08:04,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 16:08:04,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 16:08:04,601 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 16:08:04,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 16:08:04,602 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 16:08:04,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 16:08:04,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 16:08:04,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 16:08:04,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 16:08:04,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 16:08:04,604 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 16:08:04,604 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 16:08:04,605 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 16:08:04,605 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 16:08:04,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 16:08:04,606 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 16:08:04,606 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 16:08:04,606 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_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60a477b5dcc7be77af17ce3cc379f1876781ed95f896fb2ca2dbb7ba91ecb849 [2022-11-23 16:08:04,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 16:08:04,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 16:08:04,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 16:08:04,982 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 16:08:04,983 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 16:08:04,984 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-23 16:08:08,135 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 16:08:08,385 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 16:08:08,386 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i [2022-11-23 16:08:08,399 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/data/3a8d00531/a9f20b3bb5a2459e99674bc3349a195a/FLAG3379cb15e [2022-11-23 16:08:08,414 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/data/3a8d00531/a9f20b3bb5a2459e99674bc3349a195a [2022-11-23 16:08:08,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 16:08:08,419 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 16:08:08,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 16:08:08,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 16:08:08,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 16:08:08,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:08:08" (1/1) ... [2022-11-23 16:08:08,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24071f1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:08, skipping insertion in model container [2022-11-23 16:08:08,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:08:08" (1/1) ... [2022-11-23 16:08:08,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 16:08:08,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 16:08:08,760 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-23 16:08:08,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:08:08,775 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 16:08:08,818 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/sv-benchmarks/c/list-simple/sll2n_update_all_reverse.i[24236,24249] [2022-11-23 16:08:08,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 16:08:08,848 INFO L208 MainTranslator]: Completed translation [2022-11-23 16:08:08,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:08 WrapperNode [2022-11-23 16:08:08,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 16:08:08,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 16:08:08,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 16:08:08,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 16:08:08,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:08" (1/1) ... [2022-11-23 16:08:08,876 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:08" (1/1) ... [2022-11-23 16:08:08,915 INFO L138 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2022-11-23 16:08:08,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 16:08:08,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 16:08:08,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 16:08:08,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 16:08:08,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:08" (1/1) ... [2022-11-23 16:08:08,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:08" (1/1) ... [2022-11-23 16:08:08,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:08" (1/1) ... [2022-11-23 16:08:08,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:08" (1/1) ... [2022-11-23 16:08:08,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:08" (1/1) ... [2022-11-23 16:08:08,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:08" (1/1) ... [2022-11-23 16:08:08,966 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:08" (1/1) ... [2022-11-23 16:08:08,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:08" (1/1) ... [2022-11-23 16:08:08,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 16:08:08,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 16:08:08,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 16:08:08,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 16:08:08,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:08" (1/1) ... [2022-11-23 16:08:08,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 16:08:09,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:09,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 16:08:09,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 16:08:09,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 16:08:09,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 16:08:09,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 16:08:09,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 16:08:09,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 16:08:09,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 16:08:09,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 16:08:09,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 16:08:09,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 16:08:09,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 16:08:09,215 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 16:08:09,217 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 16:08:09,427 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 16:08:09,557 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 16:08:09,557 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-23 16:08:09,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:08:09 BoogieIcfgContainer [2022-11-23 16:08:09,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 16:08:09,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 16:08:09,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 16:08:09,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 16:08:09,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:08:08" (1/3) ... [2022-11-23 16:08:09,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86d945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:08:09, skipping insertion in model container [2022-11-23 16:08:09,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:08:08" (2/3) ... [2022-11-23 16:08:09,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@86d945 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:08:09, skipping insertion in model container [2022-11-23 16:08:09,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:08:09" (3/3) ... [2022-11-23 16:08:09,591 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse.i [2022-11-23 16:08:09,617 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 16:08:09,617 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 16:08:09,695 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 16:08:09,706 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;@725de030, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 16:08:09,707 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 16:08:09,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 16:08:09,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:09,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:09,720 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 16:08:09,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:09,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1963659983, now seen corresponding path program 1 times [2022-11-23 16:08:09,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:09,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274761691] [2022-11-23 16:08:09,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:09,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:10,131 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:10,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274761691] [2022-11-23 16:08:10,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274761691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:10,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:10,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 16:08:10,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875424879] [2022-11-23 16:08:10,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:10,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 16:08:10,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:10,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 16:08:10,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:08:10,250 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:10,317 INFO L93 Difference]: Finished difference Result 27 states and 41 transitions. [2022-11-23 16:08:10,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 16:08:10,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-23 16:08:10,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:10,326 INFO L225 Difference]: With dead ends: 27 [2022-11-23 16:08:10,328 INFO L226 Difference]: Without dead ends: 12 [2022-11-23 16:08:10,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 16:08:10,335 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:10,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 16:08:10,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-23 16:08:10,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2022-11-23 16:08:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2022-11-23 16:08:10,373 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 7 [2022-11-23 16:08:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:10,373 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2022-11-23 16:08:10,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2022-11-23 16:08:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 16:08:10,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:10,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:10,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 16:08:10,375 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 16:08:10,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:10,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1491156930, now seen corresponding path program 1 times [2022-11-23 16:08:10,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:10,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239437874] [2022-11-23 16:08:10,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:10,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:10,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:10,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239437874] [2022-11-23 16:08:10,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239437874] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:10,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592741919] [2022-11-23 16:08:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:10,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:10,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:10,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:08:10,543 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 16:08:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:10,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 16:08:10,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:10,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:08:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:10,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592741919] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:08:10,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1804690697] [2022-11-23 16:08:10,797 INFO L159 IcfgInterpreter]: Started Sifa with 9 locations of interest [2022-11-23 16:08:10,798 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 16:08:10,802 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 16:08:10,811 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 16:08:10,813 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 16:08:10,977 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-23 16:08:10,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-23 16:08:11,067 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-23 16:08:11,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-23 16:08:11,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:11,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:11,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-23 16:08:11,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:11,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:11,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:11,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-23 16:08:11,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:11,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:11,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-23 16:08:11,520 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-23 16:08:11,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-23 16:08:11,604 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 16:08:11,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-23 16:08:11,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:12,112 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:12,113 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 1 case distinctions, treesize of input 229 treesize of output 238 [2022-11-23 16:08:12,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:12,175 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 16:08:12,176 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 2 case distinctions, treesize of input 222 treesize of output 204 [2022-11-23 16:08:12,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:12,304 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:12,305 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 1 case distinctions, treesize of input 223 treesize of output 232 [2022-11-23 16:08:12,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:12,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:12,387 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-23 16:08:12,387 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 3 case distinctions, treesize of input 232 treesize of output 209 [2022-11-23 16:08:12,430 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:12,461 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:12,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:12,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:12,529 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:12,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:12,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:12,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:12,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:12,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:12,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:12,980 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 39 treesize of output 17 [2022-11-23 16:08:13,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:13,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:13,008 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 45 treesize of output 7 [2022-11-23 16:08:13,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:13,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:13,030 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 39 treesize of output 17 [2022-11-23 16:08:13,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:13,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:13,102 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 16:08:13,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1804690697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:13,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:08:13,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 3, 3] total 7 [2022-11-23 16:08:13,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684118062] [2022-11-23 16:08:13,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:13,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 16:08:13,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:13,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 16:08:13,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-23 16:08:13,393 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:13,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:13,461 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2022-11-23 16:08:13,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 16:08:13,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 16:08:13,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:13,463 INFO L225 Difference]: With dead ends: 18 [2022-11-23 16:08:13,463 INFO L226 Difference]: Without dead ends: 13 [2022-11-23 16:08:13,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-23 16:08:13,465 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 17 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:13,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 12 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:08:13,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-11-23 16:08:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-11-23 16:08:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:13,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-11-23 16:08:13,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2022-11-23 16:08:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:13,475 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-11-23 16:08:13,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2022-11-23 16:08:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 16:08:13,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:13,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:13,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:13,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:13,684 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 16:08:13,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1766738179, now seen corresponding path program 1 times [2022-11-23 16:08:13,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:13,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477872633] [2022-11-23 16:08:13,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:13,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:08:13,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:13,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477872633] [2022-11-23 16:08:13,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477872633] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:13,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918673642] [2022-11-23 16:08:13,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:13,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:13,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:13,890 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:08:13,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 16:08:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:13,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 16:08:13,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:08:14,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:08:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:08:14,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918673642] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:08:14,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2034373058] [2022-11-23 16:08:14,034 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-23 16:08:14,035 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 16:08:14,035 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 16:08:14,035 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 16:08:14,035 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 16:08:14,097 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-23 16:08:14,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-23 16:08:14,111 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-23 16:08:14,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:14,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:14,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:14,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-23 16:08:14,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:14,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-23 16:08:14,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:14,191 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 13 [2022-11-23 16:08:14,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:14,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-23 16:08:14,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:14,221 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 13 [2022-11-23 16:08:14,398 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-23 16:08:14,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-23 16:08:14,453 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 16:08:14,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-23 16:08:14,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:14,801 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:14,802 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 1 case distinctions, treesize of input 229 treesize of output 238 [2022-11-23 16:08:14,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:14,855 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 16:08:14,856 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 2 case distinctions, treesize of input 222 treesize of output 204 [2022-11-23 16:08:14,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:14,979 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:14,980 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 1 case distinctions, treesize of input 223 treesize of output 232 [2022-11-23 16:08:15,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:15,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:15,035 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-23 16:08:15,036 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 3 case distinctions, treesize of input 232 treesize of output 209 [2022-11-23 16:08:15,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:15,100 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:15,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:15,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:15,177 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:15,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:15,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:15,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:15,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:15,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:15,511 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 39 treesize of output 17 [2022-11-23 16:08:15,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:15,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:15,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08: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 39 treesize of output 17 [2022-11-23 16:08:15,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:15,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:15,556 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 45 treesize of output 7 [2022-11-23 16:08:15,635 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:15,640 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:15,643 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:15,672 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:15,676 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:15,679 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:15,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:15,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:15,721 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 16:08:16,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2034373058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:16,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:08:16,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [3, 3, 3] total 8 [2022-11-23 16:08:16,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635849645] [2022-11-23 16:08:16,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:16,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 16:08:16,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:16,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 16:08:16,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-23 16:08:16,156 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:16,247 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2022-11-23 16:08:16,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 16:08:16,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-23 16:08:16,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:16,249 INFO L225 Difference]: With dead ends: 21 [2022-11-23 16:08:16,249 INFO L226 Difference]: Without dead ends: 14 [2022-11-23 16:08:16,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-23 16:08:16,250 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:16,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 13 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:08:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-23 16:08:16,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-11-23 16:08:16,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-11-23 16:08:16,269 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 11 [2022-11-23 16:08:16,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:16,269 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-11-23 16:08:16,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:16,270 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-11-23 16:08:16,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 16:08:16,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:16,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:16,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:16,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-23 16:08:16,478 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 16:08:16,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:16,478 INFO L85 PathProgramCache]: Analyzing trace with hash 446479962, now seen corresponding path program 1 times [2022-11-23 16:08:16,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:16,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131911721] [2022-11-23 16:08:16,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:16,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 16:08:16,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:16,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131911721] [2022-11-23 16:08:16,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131911721] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:16,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345066585] [2022-11-23 16:08:16,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:16,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:16,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:16,645 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:08:16,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 16:08:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:16,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 16:08:16,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 16:08:16,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:08:16,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 16:08:16,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345066585] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:08:16,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1572161837] [2022-11-23 16:08:16,808 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-23 16:08:16,808 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 16:08:16,809 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 16:08:16,809 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 16:08:16,809 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 16:08:16,875 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-23 16:08:16,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-23 16:08:16,888 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-23 16:08:16,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:16,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:16,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-23 16:08:16,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:16,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:16,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:16,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-23 16:08:16,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:16,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-23 16:08:16,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:16,999 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 13 [2022-11-23 16:08:17,176 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-23 16:08:17,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-23 16:08:17,222 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 16:08:17,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-23 16:08:17,634 INFO L321 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-11-23 16:08:17,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 308 treesize of output 292 [2022-11-23 16:08:17,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:17,774 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:17,774 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 1 case distinctions, treesize of input 305 treesize of output 314 [2022-11-23 16:08:17,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:17,918 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:17,919 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 1 case distinctions, treesize of input 299 treesize of output 308 [2022-11-23 16:08:17,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:17,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:18,064 INFO L321 Elim1Store]: treesize reduction 74, result has 24.5 percent of original size [2022-11-23 16:08:18,065 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 3 case distinctions, treesize of input 325 treesize of output 307 [2022-11-23 16:08:18,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:18,138 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:18,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:18,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:18,208 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:18,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:19,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:19,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:19,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:19,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:19,293 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 45 treesize of output 7 [2022-11-23 16:08:19,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:19,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:19,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:19,311 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 39 treesize of output 17 [2022-11-23 16:08:19,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:19,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:19,330 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 39 treesize of output 17 [2022-11-23 16:08:19,372 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:19,374 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:19,377 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:19,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:19,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:19,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:19,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:19,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:19,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:19,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:19,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:19,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:19,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:19,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:19,721 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 16:08:20,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1572161837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:20,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:08:20,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 10 [2022-11-23 16:08:20,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251591835] [2022-11-23 16:08:20,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:20,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 16:08:20,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:20,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 16:08:20,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-23 16:08:20,387 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:20,838 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-11-23 16:08:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 16:08:20,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 16:08:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:20,839 INFO L225 Difference]: With dead ends: 25 [2022-11-23 16:08:20,840 INFO L226 Difference]: Without dead ends: 20 [2022-11-23 16:08:20,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-23 16:08:20,841 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 35 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:20,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 8 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:08:20,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-23 16:08:20,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2022-11-23 16:08:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:20,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-11-23 16:08:20,860 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 12 [2022-11-23 16:08:20,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:20,860 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-11-23 16:08:20,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-11-23 16:08:20,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 16:08:20,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:20,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:20,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:21,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:21,068 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 16:08:21,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash 954324368, now seen corresponding path program 1 times [2022-11-23 16:08:21,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:21,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757240991] [2022-11-23 16:08:21,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:21,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 16:08:21,157 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:21,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757240991] [2022-11-23 16:08:21,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757240991] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:21,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940353477] [2022-11-23 16:08:21,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:21,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:21,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:21,159 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:08:21,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 16:08:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:21,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 16:08:21,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 16:08:21,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:08:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 16:08:21,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940353477] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:08:21,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [125717102] [2022-11-23 16:08:21,304 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-23 16:08:21,304 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 16:08:21,304 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 16:08:21,305 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 16:08:21,305 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 16:08:21,343 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-23 16:08:21,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-23 16:08:21,379 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-23 16:08:21,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-23 16:08:21,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:21,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-23 16:08:21,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:21,438 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 13 [2022-11-23 16:08:21,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:21,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:21,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:21,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-23 16:08:21,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:21,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:21,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-23 16:08:21,644 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-23 16:08:21,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-23 16:08:21,686 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 16:08:21,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-23 16:08:21,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:21,971 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 16:08:21,971 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 2 case distinctions, treesize of input 308 treesize of output 282 [2022-11-23 16:08:21,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:22,067 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:22,067 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 1 case distinctions, treesize of input 309 treesize of output 318 [2022-11-23 16:08:22,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:22,159 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:22,160 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 1 case distinctions, treesize of input 303 treesize of output 312 [2022-11-23 16:08:22,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:22,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:22,210 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-23 16:08:22,211 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 3 case distinctions, treesize of input 312 treesize of output 281 [2022-11-23 16:08:22,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:22,279 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:22,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:22,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:22,330 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:22,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:22,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:22,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:22,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:22,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:22,889 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 39 treesize of output 17 [2022-11-23 16:08:22,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:22,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:22,908 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 45 treesize of output 7 [2022-11-23 16:08:22,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:22,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:22,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:22,934 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 39 treesize of output 17 [2022-11-23 16:08:22,988 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:22,992 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:22,995 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:23,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:23,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:23,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:23,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:23,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:23,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:23,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:23,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:23,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:23,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:23,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:23,402 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 16:08:24,099 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '551#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-23 16:08:24,100 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 16:08:24,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:08:24,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-11-23 16:08:24,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149143142] [2022-11-23 16:08:24,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:08:24,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 16:08:24,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:24,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 16:08:24,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-23 16:08:24,101 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:24,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:24,140 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-11-23 16:08:24,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 16:08:24,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 16:08:24,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:24,143 INFO L225 Difference]: With dead ends: 28 [2022-11-23 16:08:24,143 INFO L226 Difference]: Without dead ends: 17 [2022-11-23 16:08:24,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-11-23 16:08:24,144 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:24,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 16:08:24,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-23 16:08:24,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-23 16:08:24,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-23 16:08:24,153 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2022-11-23 16:08:24,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:24,153 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-23 16:08:24,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-23 16:08:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 16:08:24,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:24,154 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:24,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:24,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:24,361 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 16:08:24,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:24,361 INFO L85 PathProgramCache]: Analyzing trace with hash -694979649, now seen corresponding path program 2 times [2022-11-23 16:08:24,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:24,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527993298] [2022-11-23 16:08:24,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:24,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 16:08:24,455 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:24,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527993298] [2022-11-23 16:08:24,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527993298] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:24,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671617730] [2022-11-23 16:08:24,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:08:24,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:24,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:24,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:08:24,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 16:08:24,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 16:08:24,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:08:24,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-23 16:08:24,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 16:08:24,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:08:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 16:08:24,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671617730] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:08:24,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [176481497] [2022-11-23 16:08:24,632 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-23 16:08:24,633 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 16:08:24,633 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 16:08:24,633 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 16:08:24,633 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 16:08:24,673 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-23 16:08:24,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-23 16:08:24,714 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-23 16:08:24,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-23 16:08:24,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:24,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-23 16:08:24,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:24,760 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 13 [2022-11-23 16:08:24,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:24,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:24,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:24,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-23 16:08:24,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:24,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:24,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-23 16:08:24,923 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-23 16:08:24,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-23 16:08:24,962 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 16:08:24,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-23 16:08:25,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:25,178 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 16:08:25,179 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 2 case distinctions, treesize of input 228 treesize of output 210 [2022-11-23 16:08:25,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:25,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:25,242 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-23 16:08:25,243 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 3 case distinctions, treesize of input 244 treesize of output 221 [2022-11-23 16:08:25,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:25,336 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:25,336 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 1 case distinctions, treesize of input 225 treesize of output 234 [2022-11-23 16:08:25,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:25,418 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:25,418 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 1 case distinctions, treesize of input 219 treesize of output 228 [2022-11-23 16:08:25,441 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:25,472 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:25,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:25,512 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:25,546 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:25,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:25,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:25,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-23 16:08:25,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:25,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:25,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:25,755 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 39 treesize of output 17 [2022-11-23 16:08:25,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:25,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:25,785 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 39 treesize of output 17 [2022-11-23 16:08:25,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:25,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:25,804 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 45 treesize of output 7 [2022-11-23 16:08:25,843 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:25,845 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:25,847 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:25,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:25,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:25,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:26,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:26,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:26,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:26,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:26,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:26,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:26,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:26,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:26,247 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 16:08:26,982 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '732#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-23 16:08:26,982 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 16:08:26,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:08:26,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-23 16:08:26,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687085161] [2022-11-23 16:08:26,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:08:26,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 16:08:26,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:26,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 16:08:26,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2022-11-23 16:08:26,985 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:27,069 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-11-23 16:08:27,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 16:08:27,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-23 16:08:27,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:27,071 INFO L225 Difference]: With dead ends: 31 [2022-11-23 16:08:27,071 INFO L226 Difference]: Without dead ends: 24 [2022-11-23 16:08:27,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2022-11-23 16:08:27,074 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 63 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:27,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 14 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:08:27,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-23 16:08:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2022-11-23 16:08:27,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-11-23 16:08:27,086 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 15 [2022-11-23 16:08:27,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:27,087 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-11-23 16:08:27,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-11-23 16:08:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 16:08:27,092 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:27,092 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:27,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:27,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:27,293 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 16:08:27,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:27,293 INFO L85 PathProgramCache]: Analyzing trace with hash 706001952, now seen corresponding path program 3 times [2022-11-23 16:08:27,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:27,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809932993] [2022-11-23 16:08:27,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:27,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 16:08:28,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:28,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809932993] [2022-11-23 16:08:28,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809932993] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:28,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221661138] [2022-11-23 16:08:28,906 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 16:08:28,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:28,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:28,908 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:08:28,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 16:08:29,288 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 16:08:29,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:08:29,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-23 16:08:29,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:29,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:29,349 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 16:08:29,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 16:08:29,386 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 13 treesize of output 9 [2022-11-23 16:08:29,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 16:08:29,550 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 16:08:29,550 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 66 treesize of output 63 [2022-11-23 16:08:29,556 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 33 treesize of output 23 [2022-11-23 16:08:29,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:29,559 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 36 treesize of output 38 [2022-11-23 16:08:29,668 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:29,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:29,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-11-23 16:08:29,677 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-23 16:08:29,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:29,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-11-23 16:08:29,865 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 59 treesize of output 43 [2022-11-23 16:08:29,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2022-11-23 16:08:29,929 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 35 treesize of output 23 [2022-11-23 16:08:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 16:08:29,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:08:30,185 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse0 (* |c_ULTIMATE.start_main_~len~0#1| 2))) (and (forall ((v_ArrVal_406 (Array Int Int)) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (<= .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_406) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_405)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_402)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) 1))) (forall ((v_ArrVal_406 (Array Int Int)) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_406) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_405)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_402)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) 1) .cse0)))) is different from false [2022-11-23 16:08:30,253 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse0 (* |c_ULTIMATE.start_main_~len~0#1| 2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_406 (Array Int Int)) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (<= .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_406) (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse2)) (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_402) .cse2)) 1))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_406 (Array Int Int)) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_406) (select (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse2)) (select (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_402) .cse2)) 1) .cse0)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|))))) is different from false [2022-11-23 16:08:30,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:08:30,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2022-11-23 16:08:30,309 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:08:30,310 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 98 treesize of output 101 [2022-11-23 16:08:30,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2022-11-23 16:08:30,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:08:30,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2022-11-23 16:08:30,400 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:08:30,400 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 98 treesize of output 101 [2022-11-23 16:08:30,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 23 [2022-11-23 16:08:30,484 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_405 Int) (v_ArrVal_401 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_401) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse2))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_405 Int) (v_ArrVal_401 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_401) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse2)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_402 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_402) .cse2) |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) is different from false [2022-11-23 16:08:30,525 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_update_at_~data#1| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_405 Int) (v_ArrVal_401 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_401) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse3) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_405 Int) (v_ArrVal_401 (Array Int Int))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_401) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse3))))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_402 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse4) (select (store (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_399) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_402) .cse3))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|)))))) is different from false [2022-11-23 16:08:30,568 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_402 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_399) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_402) .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_405 Int) (v_ArrVal_401 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_401) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse2) .cse1)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_405 Int) (v_ArrVal_401 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_401) |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse2) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0)))) is different from false [2022-11-23 16:08:30,603 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_405 Int) (v_ArrVal_401 (Array Int Int))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_401) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_405 Int) (v_ArrVal_401 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_401) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse1) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_402 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse1) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_399) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_402) .cse1))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|)))))) is different from false [2022-11-23 16:08:30,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 16:08:30,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-11-23 16:08:30,629 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 42 treesize of output 38 [2022-11-23 16:08:30,632 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:30,634 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 11 treesize of output 7 [2022-11-23 16:08:30,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:30,640 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 21 treesize of output 13 [2022-11-23 16:08:30,647 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-23 16:08:30,648 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-11-23 16:08:30,654 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-23 16:08:30,654 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 1 [2022-11-23 16:08:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-23 16:08:30,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221661138] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:08:30,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1765943923] [2022-11-23 16:08:30,743 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-23 16:08:30,744 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 16:08:30,744 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 16:08:30,744 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 16:08:30,744 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 16:08:30,786 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-23 16:08:30,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-23 16:08:30,827 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-23 16:08:30,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-23 16:08:30,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:30,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:30,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:30,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-23 16:08:30,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:30,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:30,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-23 16:08:30,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:30,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-23 16:08:30,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:30,910 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 13 [2022-11-23 16:08:31,029 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-23 16:08:31,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-23 16:08:31,070 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 16:08:31,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-23 16:08:31,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:31,307 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 16:08:31,307 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 2 case distinctions, treesize of input 228 treesize of output 210 [2022-11-23 16:08:31,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:31,397 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:31,397 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 1 case distinctions, treesize of input 229 treesize of output 238 [2022-11-23 16:08:31,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:31,499 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:31,499 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 1 case distinctions, treesize of input 223 treesize of output 232 [2022-11-23 16:08:31,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:31,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:31,545 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-23 16:08:31,545 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 3 case distinctions, treesize of input 232 treesize of output 209 [2022-11-23 16:08:31,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:31,647 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:31,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:31,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:31,728 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:31,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:32,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:32,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:32,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:32,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:32,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:32,046 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 39 treesize of output 17 [2022-11-23 16:08:32,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:32,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:32,062 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 45 treesize of output 7 [2022-11-23 16:08:32,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:32,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:32,077 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 39 treesize of output 17 [2022-11-23 16:08:32,127 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:32,130 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:32,132 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:32,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:32,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:32,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:32,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 15 treesize of output 1 [2022-11-23 16:08:32,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:32,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:32,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:32,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:32,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:32,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:32,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:32,566 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 16:08:34,040 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '972#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-23 16:08:34,040 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 16:08:34,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:08:34,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 42 [2022-11-23 16:08:34,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441338360] [2022-11-23 16:08:34,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:08:34,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-23 16:08:34,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:34,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-23 16:08:34,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1737, Unknown=6, NotChecked=534, Total=2450 [2022-11-23 16:08:34,043 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:38,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:38,913 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-11-23 16:08:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 16:08:38,913 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-23 16:08:38,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:38,914 INFO L225 Difference]: With dead ends: 51 [2022-11-23 16:08:38,915 INFO L226 Difference]: Without dead ends: 49 [2022-11-23 16:08:38,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=480, Invalid=3078, Unknown=6, NotChecked=726, Total=4290 [2022-11-23 16:08:38,918 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 168 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 4 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:38,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 79 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 407 Invalid, 9 Unknown, 161 Unchecked, 0.7s Time] [2022-11-23 16:08:38,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-23 16:08:38,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2022-11-23 16:08:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:38,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-11-23 16:08:38,943 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2022-11-23 16:08:38,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:38,943 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-11-23 16:08:38,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:38,944 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-11-23 16:08:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 16:08:38,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:38,945 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:38,951 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:39,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:39,148 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 16:08:39,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:39,148 INFO L85 PathProgramCache]: Analyzing trace with hash 409571466, now seen corresponding path program 4 times [2022-11-23 16:08:39,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:39,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751558515] [2022-11-23 16:08:39,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:39,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-23 16:08:39,288 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:39,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751558515] [2022-11-23 16:08:39,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751558515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 16:08:39,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 16:08:39,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 16:08:39,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982868004] [2022-11-23 16:08:39,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:39,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 16:08:39,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:39,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 16:08:39,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 16:08:39,291 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:39,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:39,365 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-11-23 16:08:39,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 16:08:39,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 16:08:39,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:39,368 INFO L225 Difference]: With dead ends: 33 [2022-11-23 16:08:39,368 INFO L226 Difference]: Without dead ends: 28 [2022-11-23 16:08:39,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-11-23 16:08:39,369 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:39,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 16:08:39,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-23 16:08:39,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-23 16:08:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:39,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-11-23 16:08:39,390 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2022-11-23 16:08:39,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:39,390 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-11-23 16:08:39,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:39,391 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-11-23 16:08:39,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 16:08:39,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:39,392 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:39,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 16:08:39,392 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 16:08:39,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:39,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1554881251, now seen corresponding path program 5 times [2022-11-23 16:08:39,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:39,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310441940] [2022-11-23 16:08:39,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:39,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 16:08:39,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:39,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310441940] [2022-11-23 16:08:39,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310441940] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:39,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435200754] [2022-11-23 16:08:39,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:08:39,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:39,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:39,512 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:08:39,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 16:08:39,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-23 16:08:39,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:08:39,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 16:08:39,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 16:08:39,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:08:39,836 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 16:08:39,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435200754] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:39,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 16:08:39,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2022-11-23 16:08:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518546348] [2022-11-23 16:08:39,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 16:08:39,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 16:08:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:39,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 16:08:39,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-23 16:08:39,841 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:39,938 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-11-23 16:08:39,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 16:08:39,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 16:08:39,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:39,939 INFO L225 Difference]: With dead ends: 42 [2022-11-23 16:08:39,939 INFO L226 Difference]: Without dead ends: 34 [2022-11-23 16:08:39,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-23 16:08:39,940 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:39,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 15 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:08:39,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-23 16:08:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-11-23 16:08:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-11-23 16:08:39,963 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2022-11-23 16:08:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:39,963 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-11-23 16:08:39,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-11-23 16:08:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 16:08:39,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:39,965 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:39,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:40,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-23 16:08:40,175 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 16:08:40,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:40,175 INFO L85 PathProgramCache]: Analyzing trace with hash 823590399, now seen corresponding path program 6 times [2022-11-23 16:08:40,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:40,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239185663] [2022-11-23 16:08:40,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:40,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 16:08:40,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:40,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239185663] [2022-11-23 16:08:40,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239185663] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:40,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165949510] [2022-11-23 16:08:40,317 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 16:08:40,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:40,317 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:40,318 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:08:40,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 16:08:40,474 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 16:08:40,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:08:40,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-23 16:08:40,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 16:08:40,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:08:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 16:08:40,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165949510] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:08:40,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [354300003] [2022-11-23 16:08:40,613 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-23 16:08:40,613 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 16:08:40,613 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 16:08:40,614 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 16:08:40,614 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 16:08:40,662 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-23 16:08:40,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-23 16:08:40,706 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-23 16:08:40,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-23 16:08:40,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:40,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:40,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:40,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-23 16:08:40,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:40,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:40,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-23 16:08:40,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:40,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-23 16:08:40,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:40,792 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 13 [2022-11-23 16:08:40,899 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-23 16:08:40,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-11-23 16:08:40,986 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-23 16:08:40,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-11-23 16:08:41,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:41,370 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:41,370 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 229 treesize of output 238 [2022-11-23 16:08:41,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:41,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:41,420 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 16:08:41,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 204 [2022-11-23 16:08:41,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:41,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:41,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:41,522 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-23 16:08:41,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 238 treesize of output 215 [2022-11-23 16:08:41,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:41,619 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:41,619 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 219 treesize of output 228 [2022-11-23 16:08:41,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:41,675 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:41,676 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:41,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:41,721 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:41,722 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:41,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:41,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:41,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:41,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:41,953 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 45 treesize of output 7 [2022-11-23 16:08:41,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:41,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:41,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:41,975 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 39 treesize of output 17 [2022-11-23 16:08:41,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:41,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:41,998 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 39 treesize of output 17 [2022-11-23 16:08:42,051 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:42,054 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:42,057 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:42,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:42,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:42,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:42,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:42,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:42,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:42,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:42,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:42,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:42,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:42,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:42,522 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 16:08:43,430 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1633#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-23 16:08:43,430 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 16:08:43,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:08:43,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2022-11-23 16:08:43,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549684254] [2022-11-23 16:08:43,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:08:43,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 16:08:43,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:43,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 16:08:43,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-11-23 16:08:43,433 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:43,736 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-11-23 16:08:43,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 16:08:43,737 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 16:08:43,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:43,738 INFO L225 Difference]: With dead ends: 53 [2022-11-23 16:08:43,738 INFO L226 Difference]: Without dead ends: 41 [2022-11-23 16:08:43,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2022-11-23 16:08:43,739 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 56 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:43,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 36 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:08:43,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-23 16:08:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2022-11-23 16:08:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-11-23 16:08:43,774 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2022-11-23 16:08:43,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:43,775 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-11-23 16:08:43,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-11-23 16:08:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 16:08:43,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:43,783 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:43,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:43,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 16:08:43,990 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 16:08:43,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:43,991 INFO L85 PathProgramCache]: Analyzing trace with hash 74992768, now seen corresponding path program 1 times [2022-11-23 16:08:43,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:43,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285364519] [2022-11-23 16:08:43,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:43,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 16:08:44,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:44,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285364519] [2022-11-23 16:08:44,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285364519] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:44,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131606489] [2022-11-23 16:08:44,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:44,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:44,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:44,489 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:08:44,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 16:08:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:44,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-23 16:08:44,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:44,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:45,010 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-23 16:08:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 16:08:45,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:08:45,174 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 32 [2022-11-23 16:08:45,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:45,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 16:08:45,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131606489] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:08:45,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [341194428] [2022-11-23 16:08:45,297 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-23 16:08:45,297 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 16:08:45,297 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 16:08:45,297 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 16:08:45,297 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 16:08:45,348 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-23 16:08:45,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-23 16:08:45,401 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-23 16:08:45,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-23 16:08:45,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:45,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:45,446 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:45,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-23 16:08:45,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:45,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-23 16:08:45,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:45,472 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 13 [2022-11-23 16:08:45,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:45,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-23 16:08:45,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:45,497 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 13 [2022-11-23 16:08:45,592 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-23 16:08:45,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-11-23 16:08:45,678 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-23 16:08:45,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-11-23 16:08:45,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:45,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:45,986 INFO L321 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-11-23 16:08:45,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 308 treesize of output 292 [2022-11-23 16:08:46,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:46,106 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:46,106 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 305 treesize of output 314 [2022-11-23 16:08:46,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:46,198 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:46,198 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 299 treesize of output 308 [2022-11-23 16:08:46,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:46,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:46,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:46,291 INFO L321 Elim1Store]: treesize reduction 89, result has 26.4 percent of original size [2022-11-23 16:08:46,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 325 treesize of output 307 [2022-11-23 16:08:46,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:46,353 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:46,353 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:46,407 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:46,434 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:46,434 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:46,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:46,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:46,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:46,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:46,835 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 45 treesize of output 7 [2022-11-23 16:08:46,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:46,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:46,854 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:46,855 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 39 treesize of output 17 [2022-11-23 16:08:46,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:46,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:46,876 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 39 treesize of output 17 [2022-11-23 16:08:46,928 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:46,933 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:46,935 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:47,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:47,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 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:47,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:47,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:47,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:47,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:47,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:47,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:47,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:47,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:47,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:47,496 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 16:08:48,416 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1951#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-23 16:08:48,416 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 16:08:48,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:08:48,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 24 [2022-11-23 16:08:48,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902742973] [2022-11-23 16:08:48,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:08:48,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-23 16:08:48,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:48,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-23 16:08:48,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2022-11-23 16:08:48,418 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:49,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:49,067 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-11-23 16:08:49,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 16:08:49,068 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-23 16:08:49,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:49,069 INFO L225 Difference]: With dead ends: 44 [2022-11-23 16:08:49,069 INFO L226 Difference]: Without dead ends: 42 [2022-11-23 16:08:49,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=269, Invalid=1453, Unknown=0, NotChecked=0, Total=1722 [2022-11-23 16:08:49,070 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 131 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:49,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 72 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 16:08:49,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-23 16:08:49,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-11-23 16:08:49,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:49,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-11-23 16:08:49,095 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 20 [2022-11-23 16:08:49,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:49,096 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-11-23 16:08:49,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 24 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:49,096 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-11-23 16:08:49,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 16:08:49,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:49,097 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:49,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:49,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:49,303 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 16:08:49,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:49,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1025716738, now seen corresponding path program 7 times [2022-11-23 16:08:49,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:49,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613982219] [2022-11-23 16:08:49,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:49,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 16:08:49,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:49,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613982219] [2022-11-23 16:08:49,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613982219] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:49,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267331274] [2022-11-23 16:08:49,413 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 16:08:49,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:49,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:49,415 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:08:49,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 16:08:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:49,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 16:08:49,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:49,633 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 16:08:49,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:08:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 16:08:49,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267331274] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:08:49,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [839262063] [2022-11-23 16:08:49,685 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-23 16:08:49,685 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 16:08:49,686 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 16:08:49,686 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 16:08:49,686 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 16:08:49,743 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-23 16:08:49,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-23 16:08:49,755 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-23 16:08:49,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:49,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:49,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-23 16:08:49,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:49,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-23 16:08:49,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:49,823 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 13 [2022-11-23 16:08:49,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:49,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:49,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:49,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-23 16:08:49,955 INFO L321 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-23 16:08:49,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 235 [2022-11-23 16:08:50,033 INFO L321 Elim1Store]: treesize reduction 78, result has 26.4 percent of original size [2022-11-23 16:08:50,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 230 treesize of output 245 [2022-11-23 16:08:50,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:50,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:50,282 INFO L321 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2022-11-23 16:08:50,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 228 treesize of output 220 [2022-11-23 16:08:50,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:50,419 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:50,420 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 225 treesize of output 234 [2022-11-23 16:08:50,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:50,564 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:50,565 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 219 treesize of output 228 [2022-11-23 16:08:50,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:50,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:50,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:50,679 INFO L321 Elim1Store]: treesize reduction 89, result has 26.4 percent of original size [2022-11-23 16:08:50,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 245 treesize of output 235 [2022-11-23 16:08:50,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:50,762 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:50,762 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:50,789 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:50,812 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:50,813 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:51,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:51,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:51,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:51,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:51,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:51,109 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 39 treesize of output 17 [2022-11-23 16:08:51,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:51,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:51,126 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 45 treesize of output 7 [2022-11-23 16:08:51,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:51,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:51,143 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 39 treesize of output 17 [2022-11-23 16:08:51,178 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:51,180 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:51,183 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:51,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:51,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:51,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:51,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:51,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:51,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:51,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:51,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:51,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:51,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:51,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:51,574 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 16:08:52,719 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2241#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (= |ULTIMATE.start_main_~len~0#1| 2) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 3 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-23 16:08:52,719 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 16:08:52,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:08:52,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-11-23 16:08:52,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652205297] [2022-11-23 16:08:52,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:08:52,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 16:08:52,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:52,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 16:08:52,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-23 16:08:52,720 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:52,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:52,831 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-11-23 16:08:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 16:08:52,832 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-23 16:08:52,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:52,832 INFO L225 Difference]: With dead ends: 45 [2022-11-23 16:08:52,832 INFO L226 Difference]: Without dead ends: 22 [2022-11-23 16:08:52,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2022-11-23 16:08:52,833 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 42 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:52,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 17 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:08:52,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-23 16:08:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-11-23 16:08:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-11-23 16:08:52,851 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-11-23 16:08:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:52,851 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-11-23 16:08:52,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-11-23 16:08:52,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 16:08:52,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 16:08:52,852 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 16:08:52,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:53,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:53,055 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 16:08:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 16:08:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1971844054, now seen corresponding path program 2 times [2022-11-23 16:08:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 16:08:53,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525626801] [2022-11-23 16:08:53,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 16:08:53,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 16:08:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 16:08:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 16:08:53,204 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 16:08:53,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525626801] [2022-11-23 16:08:53,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525626801] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 16:08:53,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751537487] [2022-11-23 16:08:53,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 16:08:53,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 16:08:53,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 16:08:53,206 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 16:08:53,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 16:08:53,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 16:08:53,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 16:08:53,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 16:08:53,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 16:08:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 16:08:53,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 16:08:53,537 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-23 16:08:53,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751537487] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 16:08:53,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1064812029] [2022-11-23 16:08:53,540 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-23 16:08:53,540 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 16:08:53,541 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 16:08:53,541 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 16:08:53,541 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 16:08:53,603 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-23 16:08:53,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-23 16:08:53,618 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-23 16:08:53,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:53,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:53,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:53,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 28 [2022-11-23 16:08:53,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:53,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:53,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 17 [2022-11-23 16:08:53,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:53,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-23 16:08:53,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:53,709 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 13 [2022-11-23 16:08:53,832 INFO L321 Elim1Store]: treesize reduction 70, result has 34.0 percent of original size [2022-11-23 16:08:53,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 232 treesize of output 255 [2022-11-23 16:08:53,887 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 16:08:53,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 233 [2022-11-23 16:08:54,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:54,279 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:54,279 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 1 case distinctions, treesize of input 309 treesize of output 318 [2022-11-23 16:08:54,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:54,327 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 16:08:54,327 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 2 case distinctions, treesize of input 302 treesize of output 276 [2022-11-23 16:08:54,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:54,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:54,394 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-23 16:08:54,394 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 3 case distinctions, treesize of input 318 treesize of output 287 [2022-11-23 16:08:54,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:54,501 INFO L321 Elim1Store]: treesize reduction 52, result has 33.3 percent of original size [2022-11-23 16:08:54,502 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 1 case distinctions, treesize of input 299 treesize of output 308 [2022-11-23 16:08:54,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:54,548 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:54,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:54,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:54,615 INFO L321 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2022-11-23 16:08:54,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 42 [2022-11-23 16:08:54,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:54,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:54,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:54,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:54,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:54,979 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 39 treesize of output 17 [2022-11-23 16:08:54,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:54,997 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:54,999 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 45 treesize of output 7 [2022-11-23 16:08:55,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 16:08:55,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 16:08:55,016 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 39 treesize of output 17 [2022-11-23 16:08:55,059 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:55,073 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:55,076 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 16:08:55,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:55,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:55,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:55,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:55,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:55,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:55,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:55,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-23 16:08:55,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 16:08:55,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 16:08:55,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-23 16:08:55,824 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 16:08:57,800 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2508#(and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) (<= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |#NULL.base|) (<= 2 |ULTIMATE.start_main_~len~0#1|) (or (and (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= 1 |ULTIMATE.start_sll_get_data_at_#in~index#1|) (<= 3 |ULTIMATE.start_main_~expected~0#1|)) (and (= (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|) |ULTIMATE.start_sll_get_data_at_#res#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_sll_get_data_at_~head#1.offset|) (not (= |ULTIMATE.start_sll_get_data_at_#res#1| |ULTIMATE.start_main_~expected~0#1|)) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) (= (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~expected~0#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (exists ((|v_ULTIMATE.start_sll_get_data_at_~head#1.base_51| Int) (|v_ULTIMATE.start_sll_get_data_at_~head#1.offset_51| Int)) (and (<= 3 (select (select |#memory_int| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_51|) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_51|)) (<= (select (select |#memory_int| |v_ULTIMATE.start_sll_get_data_at_~head#1.base_51|) |v_ULTIMATE.start_sll_get_data_at_~head#1.offset_51|) 3))) (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|))) (<= 1 |ULTIMATE.start_sll_create_#in~data#1|) (<= |ULTIMATE.start_sll_create_#in~data#1| 1) (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= |ULTIMATE.start_sll_create_~len#1| 0) (<= |ULTIMATE.start_sll_create_#res#1.offset| 0) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= 1 |ULTIMATE.start_sll_create_~data#1|) (<= |ULTIMATE.start_main_~expected~0#1| 3) (<= 0 |ULTIMATE.start_sll_get_data_at_#in~head#1.offset|) (<= |ULTIMATE.start_sll_create_~data#1| 1) (<= |#NULL.base| 0) (<= |ULTIMATE.start_sll_create_#in~len#1| 2) (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|) (<= |ULTIMATE.start_sll_get_data_at_#res#1| 2147483647) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 1 |ULTIMATE.start_main_~data~0#1|) (<= 0 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_sll_create_#in~len#1|) (<= |ULTIMATE.start_main_~s~0#1.offset| 0) (<= |ULTIMATE.start_sll_get_data_at_#in~index#1| 1) (<= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| 0) (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|) (<= 0 (+ |ULTIMATE.start_sll_get_data_at_#res#1| 2147483648)))' at error location [2022-11-23 16:08:57,801 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 16:08:57,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 16:08:57,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-11-23 16:08:57,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593919165] [2022-11-23 16:08:57,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 16:08:57,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 16:08:57,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 16:08:57,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 16:08:57,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-11-23 16:08:57,803 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:57,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 16:08:57,910 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-11-23 16:08:57,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 16:08:57,910 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-23 16:08:57,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 16:08:57,911 INFO L225 Difference]: With dead ends: 22 [2022-11-23 16:08:57,911 INFO L226 Difference]: Without dead ends: 0 [2022-11-23 16:08:57,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2022-11-23 16:08:57,912 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 17 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 16:08:57,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 11 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 16:08:57,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-23 16:08:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-23 16:08:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-23 16:08:57,913 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-11-23 16:08:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 16:08:57,913 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-23 16:08:57,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 16:08:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-23 16:08:57,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-23 16:08:57,916 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 16:08:57,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 16:08:58,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-23 16:08:58,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-23 16:09:04,069 INFO L902 garLoopResultBuilder]: At program point L572(line 572) the Hoare annotation is: true [2022-11-23 16:09:04,069 INFO L895 garLoopResultBuilder]: At program point L622-3(lines 622 627) the Hoare annotation is: (let ((.cse28 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse0 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_update_at_~data#1|)) (.cse1 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse2 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse3 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse4 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse6 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse7 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse8 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse9 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse10 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse11 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse12 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse13 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse14 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse15 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse16 (<= .cse28 |ULTIMATE.start_main_~len~0#1|)) (.cse17 (= |#NULL.offset| 0)) (.cse18 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse19 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse20 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse21 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse22 (<= 0 |#StackHeapBarrier|)) (.cse23 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse24 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse25 (<= |ULTIMATE.start_main_~len~0#1| .cse28)) (.cse26 (= |#NULL.base| 0))) (or (and (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~s~0#1.offset|) .cse0 .cse1 .cse2 .cse3 (<= |ULTIMATE.start_main_~i~0#1| 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= |ULTIMATE.start_sll_update_at_~index#1| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse24 .cse25 .cse26) (let ((.cse27 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) 4))) (and .cse0 .cse1 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1) .cse2 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) (+ 2 |ULTIMATE.start_main_~i~0#1|)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (not (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse27)) .cse21 (<= (+ |ULTIMATE.start_sll_update_at_~index#1| 1) |ULTIMATE.start_main_~i~0#1|) .cse22 .cse23 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| .cse27) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base|) 4))) .cse24 (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse25 .cse26))))) [2022-11-23 16:09:04,069 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-23 16:09:04,069 INFO L902 garLoopResultBuilder]: At program point L631(lines 613 632) the Hoare annotation is: true [2022-11-23 16:09:04,070 INFO L895 garLoopResultBuilder]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse10 (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|))) (let ((.cse14 (* |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse15 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse21 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse0 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse22 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse4 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse23 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse24 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse6 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse25 (= |ULTIMATE.start_sll_update_at_~data#1| .cse10)) (.cse26 (<= |ULTIMATE.start_sll_update_at_~index#1| 1)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse27 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse8 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse9 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse13 (= |#NULL.offset| 0)) (.cse31 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse32 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse33 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse34 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse16 (<= 0 |#StackHeapBarrier|)) (.cse17 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse18 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|))) (.cse35 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse29 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse19 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse20 (= |#NULL.base| 0))) (or (and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_sll_update_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_sll_update_at_#in~head#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|) .cse7 .cse8 (= |ULTIMATE.start_sll_update_at_~data#1| |ULTIMATE.start_sll_update_at_#in~data#1|) .cse9 (= .cse10 |ULTIMATE.start_main_~new_data~0#1|) .cse11 .cse12 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) .cse13 (= .cse14 (+ |ULTIMATE.start_sll_update_at_~data#1| 1)) (= |ULTIMATE.start_sll_update_at_~index#1| |ULTIMATE.start_main_~i~0#1|) .cse15 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse16 .cse17 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (= |ULTIMATE.start_sll_update_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) .cse18 .cse19 .cse20) (let ((.cse28 (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse30 (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base|))) (and .cse21 .cse0 .cse22 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse24 (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~len~0#1|) .cse6 (<= |ULTIMATE.start_sll_update_at_~index#1| 0) (<= 0 |ULTIMATE.start_main_~i~0#1|) .cse25 .cse26 .cse7 .cse27 (forall ((v_ArrVal_406 (Array Int Int)) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (<= (+ (select (select (store |#memory_int| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_406) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base| (store .cse28 |ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_405)) |ULTIMATE.start_main_~s~0#1.base|) .cse29)) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base| (store .cse30 |ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_402)) |ULTIMATE.start_main_~s~0#1.base|) .cse29)) 1) .cse14)) .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse31 .cse32 .cse33 .cse34 .cse16 .cse17 (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| (select .cse28 4)) (select .cse30 4))) .cse35 .cse19 .cse20)) (and .cse21 .cse0 .cse22 .cse1 .cse2 .cse3 .cse4 .cse23 (= |ULTIMATE.start_main_~i~0#1| 1) .cse5 .cse24 .cse6 .cse25 .cse26 (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_399 (Array Int Int)) (v_ArrVal_402 Int)) (= (select (store (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_399) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_402) .cse29) |ULTIMATE.start_sll_update_at_~head#1.offset|)))) .cse7 .cse27 .cse8 .cse9 .cse11 .cse13 .cse31 .cse32 .cse33 .cse34 (<= (+ |ULTIMATE.start_sll_update_at_~index#1| 1) |ULTIMATE.start_main_~i~0#1|) .cse16 .cse17 .cse18 .cse35 (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_405 Int) (v_ArrVal_401 (Array Int Int))) (= |ULTIMATE.start_sll_update_at_~head#1.base| (select (store (select (store |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_401) |ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse29))))) .cse19 .cse20)))) [2022-11-23 16:09:04,070 INFO L899 garLoopResultBuilder]: For program point L624(lines 624 626) no Hoare annotation was computed. [2022-11-23 16:09:04,071 INFO L895 garLoopResultBuilder]: At program point L600-2(lines 600 603) the Hoare annotation is: (let ((.cse45 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) 4)) (.cse44 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|)) (.cse9 (+ 2 |ULTIMATE.start_main_~i~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_sll_get_data_at_~index#1| 0)) (.cse2 (<= 0 |ULTIMATE.start_main_~s~0#1.offset|)) (.cse13 (<= |ULTIMATE.start_sll_update_at_~data#1| 3)) (.cse14 (<= 0 |ULTIMATE.start_main_~i~0#1|)) (.cse15 (<= |ULTIMATE.start_sll_update_at_~index#1| 1)) (.cse27 (<= |ULTIMATE.start_main_~i~0#1| 1)) (.cse31 (<= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse1 (select (select |#memory_int| |ULTIMATE.start_sll_get_data_at_~head#1.base|) |ULTIMATE.start_sll_get_data_at_~head#1.offset|)) (.cse35 (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_update_at_~data#1|)) (.cse3 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse36 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse4 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse37 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse5 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse6 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse7 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse8 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse10 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse11 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse12 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse16 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse39 (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) 4)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) 4)) .cse9)) (.cse17 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse18 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse19 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse20 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse21 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|)) (.cse22 (<= .cse44 |ULTIMATE.start_main_~len~0#1|)) (.cse23 (= |#NULL.offset| 0)) (.cse24 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse25 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse26 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse40 (not (= |ULTIMATE.start_sll_update_at_~head#1.base| .cse45))) (.cse28 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse41 (<= (+ |ULTIMATE.start_sll_update_at_~index#1| 1) |ULTIMATE.start_main_~i~0#1|)) (.cse29 (<= 0 |#StackHeapBarrier|)) (.cse30 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse42 (<= (+ |ULTIMATE.start_main_~len~0#1| 1) (select (select |#memory_int| .cse45) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_update_at_~head#1.base|) 4)))) (.cse32 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse33 (<= |ULTIMATE.start_main_~len~0#1| .cse44)) (.cse34 (= |#NULL.base| 0))) (or (and .cse0 (<= 2 .cse1) .cse2 .cse3 .cse4 .cse5 (<= .cse1 2) .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~len~0#1| .cse9) .cse10 .cse11 .cse12 .cse13 (= 2 |ULTIMATE.start_main_~expected~0#1|) (<= |ULTIMATE.start_sll_update_at_~index#1| 0) .cse14 (= |ULTIMATE.start_sll_update_at_~data#1| (+ |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_main_~i~0#1|)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) (let ((.cse38 (+ .cse1 1))) (and .cse0 .cse2 .cse35 .cse3 .cse36 .cse4 .cse37 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 (= (+ (* 2 (div .cse38 (- 2))) |ULTIMATE.start_main_~expected~0#1| 1) 0) .cse12 .cse13 (= (mod .cse38 2) 0) .cse14 .cse15 .cse16 .cse39 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse40 .cse27 .cse28 .cse41 .cse29 .cse30 .cse31 .cse42 .cse32 .cse33 .cse34)) (and .cse35 .cse3 .cse36 .cse4 .cse37 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_main_~i~0#1|) .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse16 .cse39 .cse17 .cse18 .cse19 (= (+ (* (div (+ (let ((.cse43 (+ |ULTIMATE.start_sll_get_data_at_~head#1.offset| 4))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse43)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse43))) 1) (- 2)) 2) |ULTIMATE.start_main_~expected~0#1| 1) 0) (= |ULTIMATE.start_sll_get_data_at_#in~head#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse20 .cse21 .cse22 .cse23 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse24 (= |ULTIMATE.start_sll_get_data_at_#in~index#1| |ULTIMATE.start_sll_get_data_at_~index#1|) .cse25 .cse26 .cse40 .cse28 (= |ULTIMATE.start_sll_get_data_at_~head#1.offset| 0) .cse41 (= |ULTIMATE.start_sll_get_data_at_#in~head#1.base| |ULTIMATE.start_sll_get_data_at_~head#1.base|) .cse29 .cse30 (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse42 .cse32 (= |ULTIMATE.start_main_~s~0#1.offset| 0) .cse33 .cse34)))) [2022-11-23 16:09:04,071 INFO L895 garLoopResultBuilder]: At program point L625(lines 613 632) the Hoare annotation is: false [2022-11-23 16:09:04,071 INFO L895 garLoopResultBuilder]: At program point L576(lines 576 578) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_node_create_~data#1| |ULTIMATE.start_node_create_#in~data#1|)) (.cse1 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (= 8 (select |#length| |ULTIMATE.start_node_create_~temp~0#1.base|))) (.cse4 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse5 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse6 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse7 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse8 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse9 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse10 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse11 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse12 (< |ULTIMATE.start_node_create_~temp~0#1.base| |#StackHeapBarrier|)) (.cse13 (= |#NULL.offset| 0)) (.cse14 (= |ULTIMATE.start_sll_create_~data#1| |ULTIMATE.start_node_create_#in~data#1|)) (.cse15 (<= 0 |#StackHeapBarrier|)) (.cse16 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse17 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| 0))) (.cse18 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse19 (= |#NULL.base| 0))) (or (and .cse0 (not (= |ULTIMATE.start_node_create_~temp~0#1.base| |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= |ULTIMATE.start_sll_create_~len#1| 2) .cse19) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19))) [2022-11-23 16:09:04,071 INFO L902 garLoopResultBuilder]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2022-11-23 16:09:04,072 INFO L895 garLoopResultBuilder]: At program point L618-3(lines 618 621) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (<= |ULTIMATE.start_sll_update_at_#in~data#1| 3)) (.cse5 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse6 (<= 0 |ULTIMATE.start_sll_update_at_#in~head#1.offset|)) (.cse7 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse8 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse9 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse10 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse1 (* |ULTIMATE.start_main_~len~0#1| 2)) (.cse3 (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse11 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse12 (<= |ULTIMATE.start_sll_create_~len#1| 0)) (.cse13 (<= |ULTIMATE.start_sll_create_#res#1.offset| 0)) (.cse14 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse15 (<= |ULTIMATE.start_sll_update_at_~index#1| 0)) (.cse17 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse18 (<= |ULTIMATE.start_sll_update_at_#in~head#1.offset| 0)) (.cse19 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse20 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse21 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse23 (= |#NULL.offset| 0)) (.cse24 (<= 0 |ULTIMATE.start_sll_create_#res#1.offset|)) (.cse25 (<= |ULTIMATE.start_sll_update_at_#in~index#1| 1)) (.cse26 (<= |ULTIMATE.start_main_~new_data~0#1| 3)) (.cse27 (<= 0 |#StackHeapBarrier|)) (.cse28 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse29 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse30 (= |ULTIMATE.start_main_~s~0#1.offset| 0)) (.cse31 (= |#NULL.base| 0)) (.cse2 (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|))) (or (let ((.cse22 (select (select |#memory_int| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|))) (and (= |ULTIMATE.start_main_~len~0#1| |ULTIMATE.start_sll_update_at_~data#1|) .cse0 (= .cse1 (+ (select (select |#memory_int| (select .cse2 .cse3)) (select .cse4 .cse3)) 1)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= .cse16 0) .cse17 .cse18 .cse19 .cse20 .cse21 (= |ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_update_at_~head#1.offset|) (<= .cse22 |ULTIMATE.start_main_~len~0#1|) .cse23 (= |ULTIMATE.start_sll_update_at_~head#1.base| |ULTIMATE.start_main_~s~0#1.base|) .cse24 .cse25 (not (= |ULTIMATE.start_sll_update_at_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_update_at_~head#1.base|) 4))) .cse26 .cse27 .cse28 .cse29 .cse30 (<= |ULTIMATE.start_main_~len~0#1| .cse22) .cse31)) (and (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|) .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse14 .cse17 .cse19 .cse20 .cse21 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_sll_create_~head~0#1.offset|) .cse23 (= |ULTIMATE.start_sll_create_#res#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) .cse27 .cse28 (= |ULTIMATE.start_main_~len~0#1| .cse16) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse30 .cse31) (let ((.cse33 (+ |ULTIMATE.start_main_~len~0#1| 1)) (.cse32 (select (select |#memory_int| (select .cse2 4)) (select .cse4 4)))) (and (= |ULTIMATE.start_main_~i~0#1| 0) .cse0 .cse5 .cse6 .cse7 (<= .cse32 .cse33) .cse8 .cse9 .cse10 (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_35| Int)) (or (< |ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_35|) (forall ((v_ArrVal_406 (Array Int Int)) (v_ArrVal_405 Int) (v_ArrVal_402 Int)) (<= .cse1 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~s~0#1.base| v_ArrVal_406) (select (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_405) .cse3)) (select (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_35| v_ArrVal_402) .cse3)) 1))))) .cse11 .cse12 .cse13 .cse14 (<= |ULTIMATE.start_sll_update_at_~data#1| 3) .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse23 (<= .cse33 .cse32) .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31)))) [2022-11-23 16:09:04,072 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse5 (<= |ULTIMATE.start_sll_create_~head~0#1.offset| 0)) (.cse14 (<= 0 |ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse0 (= (select |#valid| |ULTIMATE.start_node_create_~temp~0#1.base|) 1)) (.cse1 (= (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|) 1)) (.cse2 (<= 1 |ULTIMATE.start_sll_create_#in~data#1|)) (.cse3 (= |ULTIMATE.start_node_create_~temp~0#1.offset| 0)) (.cse4 (<= |ULTIMATE.start_sll_create_#in~data#1| 1)) (.cse6 (<= 1 |ULTIMATE.start_sll_create_~data#1|)) (.cse7 (= |ULTIMATE.start_main_~data~0#1| 1)) (.cse8 (<= |ULTIMATE.start_sll_create_~data#1| 1)) (.cse9 (<= |ULTIMATE.start_sll_create_#in~len#1| 2)) (.cse10 (= |ULTIMATE.start_main_~len~0#1| 2)) (.cse11 (= |#NULL.offset| 0)) (.cse12 (<= 0 |#StackHeapBarrier|)) (.cse13 (<= 2 |ULTIMATE.start_sll_create_#in~len#1|)) (.cse15 (<= |ULTIMATE.start_sll_create_~len#1| 2)) (.cse16 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 1 |ULTIMATE.start_sll_create_~len#1|) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= 2 |ULTIMATE.start_sll_create_~len#1|) .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_sll_create_~head~0#1.offset| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_create_~head~0#1.base|) 4) |ULTIMATE.start_sll_create_~head~0#1.base|)) .cse15 .cse16))) [2022-11-23 16:09:04,072 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2022-11-23 16:09:04,072 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-23 16:09:04,079 INFO L444 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1, 1, 1] [2022-11-23 16:09:04,082 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 16:09:04,095 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,096 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,096 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,096 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,097 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,101 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,102 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,102 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,103 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,103 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,109 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,111 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,118 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,121 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,122 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,127 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,130 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,130 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,131 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,131 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_406,QUANTIFIED] [2022-11-23 16:09:04,134 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,134 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] [2022-11-23 16:09:04,134 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,135 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,135 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] [2022-11-23 16:09:04,135 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,136 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,137 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,139 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,153 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,153 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,154 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,154 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,154 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_406,QUANTIFIED] [2022-11-23 16:09:04,155 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,155 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] [2022-11-23 16:09:04,156 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,156 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,156 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] [2022-11-23 16:09:04,157 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,157 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,157 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,160 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,160 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,161 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,161 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,161 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,162 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,162 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,162 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,163 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,163 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,163 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,164 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,166 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,174 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,175 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,175 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,175 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,175 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,176 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,176 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,176 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,177 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,180 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,185 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_406,QUANTIFIED] [2022-11-23 16:09:04,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,185 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,186 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] [2022-11-23 16:09:04,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,186 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,187 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] [2022-11-23 16:09:04,187 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,187 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,188 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2022-11-23 16:09:04,188 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] [2022-11-23 16:09:04,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,189 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,189 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,192 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,192 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_401,QUANTIFIED] [2022-11-23 16:09:04,192 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] [2022-11-23 16:09:04,193 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,194 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,196 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_406,QUANTIFIED] [2022-11-23 16:09:04,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,197 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,197 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] [2022-11-23 16:09:04,198 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,199 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,199 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] [2022-11-23 16:09:04,199 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,201 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,201 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,204 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,205 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2022-11-23 16:09:04,205 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] [2022-11-23 16:09:04,205 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,206 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,206 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,206 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,207 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_401,QUANTIFIED] [2022-11-23 16:09:04,207 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] [2022-11-23 16:09:04,207 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:09:04 BoogieIcfgContainer [2022-11-23 16:09:04,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 16:09:04,211 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 16:09:04,211 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 16:09:04,211 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 16:09:04,212 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:08:09" (3/4) ... [2022-11-23 16:09:04,215 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-23 16:09:04,232 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-11-23 16:09:04,233 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-11-23 16:09:04,233 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-23 16:09:04,234 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-23 16:09:04,262 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((len == data && unknown-#in~data-unknown <= 3) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && \valid[temp] == 1) && 0 <= #in~head) && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 0) && i + 1 <= 0) && data == 1) && #in~head <= 0) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && unknown-#in~index-unknown <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || (((((((((((((((((((((s == \result && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && len <= 0) && 1 <= data) && data == 1) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && \result == head) && #NULL == 0) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && len == i + 1) && !(#memory_$Pointer$[head][4] == head)) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((i == 0 && unknown-#in~data-unknown <= 3) && \valid[temp] == 1) && 0 <= #in~head) && \valid[head] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || (forall v_ArrVal_406 : [int]int, v_ArrVal_405 : int, v_ArrVal_402 : int :: len * 2 <= unknown-#memory_int-unknown[s := v_ArrVal_406][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_405][s + 4]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_402][s + 4]] + 1))) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && index <= 0) && data == 1) && #in~head <= 0) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && #NULL == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && 0 <= \result) && unknown-#in~index-unknown <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && 0 <= head) && s == 0) && #NULL == 0) [2022-11-23 16:09:04,262 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && len == data) && unknown-#in~data-unknown <= 3) && 0 <= #in~head) && 1 <= unknown-#in~data-unknown) && i <= 0) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 0) && data == 1) && #in~head <= 0) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && unknown-#in~index-unknown <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && s <= 0) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || ((((((((((((((((((((((((((((((((((len == data && unknown-#in~data-unknown <= 3) && \valid[temp] == 1) && 0 <= #in~head) && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && #in~head <= 0) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && unknown-#in~index-unknown <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && len == i + 1) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) [2022-11-23 16:09:04,263 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((s == \result && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && len <= 0) && 1 <= data) && #in~head == s) && #in~head == head) && data == 1) && data <= 1) && data == unknown-#in~data-unknown) && unknown-#in~len-unknown <= 2) && len + i == new_data) && len == 2) && s == head) && \result == head) && #NULL == 0) && len * 2 == data + 1) && index == i) && head == s) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && len == i + 1) && unknown-#in~index-unknown == i) && !(#memory_$Pointer$[head][4] == head)) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((((((unknown-#in~data-unknown <= 3 && \valid[temp] == 1) && 0 <= #in~head) && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 + i <= len) && 1 <= data) && index <= 0) && 0 <= i) && data == len + i) && index <= 1) && data == 1) && #in~head <= 0) && (forall v_ArrVal_406 : [int]int, v_ArrVal_405 : int, v_ArrVal_402 : int :: unknown-#memory_int-unknown[head := v_ArrVal_406][#memory_$Pointer$[head := #memory_$Pointer$[head][head := v_ArrVal_405]][s][s + 4]][#memory_$Pointer$[head := #memory_$Pointer$[head][head := v_ArrVal_402]][s][s + 4]] + 1 <= len * 2)) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && s == head) && #NULL == 0) && head == s) && 0 <= \result) && unknown-#in~index-unknown <= 1) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((((unknown-#in~data-unknown <= 3 && \valid[temp] == 1) && 0 <= #in~head) && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && i == 1) && len <= 0) && \result <= 0) && 1 <= data) && data == len + i) && index <= 1) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || (forall v_ArrVal_399 : [int]int, v_ArrVal_402 : int :: #memory_$Pointer$[head := v_ArrVal_399][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_402][s + 4] == head))) && data == 1) && #in~head <= 0) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && #NULL == 0) && 0 <= \result) && unknown-#in~index-unknown <= 1) && i <= 1) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && !(#memory_$Pointer$[head][4] == head)) && 0 <= head) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || (forall v_ArrVal_405 : int, v_ArrVal_401 : [int]int :: head == #memory_$Pointer$[head := v_ArrVal_401][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_405][s + 4]))) && s == 0) && #NULL == 0) [2022-11-23 16:09:04,264 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((index <= 0 && 2 <= unknown-#memory_int-unknown[head][head]) && 0 <= s) && unknown-#in~data-unknown <= 3) && 0 <= #in~head) && 1 <= unknown-#in~data-unknown) && unknown-#memory_int-unknown[head][head] <= 2) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && len == 2 + i) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && 2 == expected) && index <= 0) && 0 <= i) && data == len + i) && index <= 1) && data == 1) && #in~head <= 0) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && unknown-#in~index-unknown <= 1) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && s <= 0) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && len == data) && unknown-#in~data-unknown <= 3) && \valid[temp] == 1) && 0 <= #in~head) && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 * ((unknown-#memory_int-unknown[head][head] + 1) / -2) + expected + 1 == 0) && 1 <= data) && data <= 3) && (unknown-#memory_int-unknown[head][head] + 1) % 2 == 0) && 0 <= i) && index <= 1) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && #in~head <= 0) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && unknown-#in~index-unknown <= 1) && !(head == #memory_$Pointer$[head][4])) && i <= 1) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && s <= 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((((len == data && unknown-#in~data-unknown <= 3) && \valid[temp] == 1) && 0 <= #in~head) && \valid[head] == 1) && unknown-#in~index-unknown == i) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && #in~head <= 0) && data <= 1) && unknown-#in~len-unknown <= 2) && (unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] + 1) / -2 * 2 + expected + 1 == 0) && #in~head == s) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && #in~head == s) && head == s) && unknown-#in~index-unknown == index) && 0 <= \result) && unknown-#in~index-unknown <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && head == 0) && index + 1 <= i) && #in~head == head) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && len == i + 1) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) [2022-11-23 16:09:04,285 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 16:09:04,285 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 16:09:04,285 INFO L158 Benchmark]: Toolchain (without parser) took 55866.74ms. Allocated memory was 197.1MB in the beginning and 503.3MB in the end (delta: 306.2MB). Free memory was 152.8MB in the beginning and 238.2MB in the end (delta: -85.4MB). Peak memory consumption was 221.5MB. Max. memory is 16.1GB. [2022-11-23 16:09:04,285 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 138.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 16:09:04,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.68ms. Allocated memory is still 197.1MB. Free memory was 152.2MB in the beginning and 134.8MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 16:09:04,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.93ms. Allocated memory is still 197.1MB. Free memory was 134.8MB in the beginning and 132.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 16:09:04,286 INFO L158 Benchmark]: Boogie Preprocessor took 69.93ms. Allocated memory is still 197.1MB. Free memory was 132.7MB in the beginning and 131.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 16:09:04,287 INFO L158 Benchmark]: RCFGBuilder took 586.07ms. Allocated memory is still 197.1MB. Free memory was 131.2MB in the beginning and 113.0MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-23 16:09:04,287 INFO L158 Benchmark]: TraceAbstraction took 54629.74ms. Allocated memory was 197.1MB in the beginning and 503.3MB in the end (delta: 306.2MB). Free memory was 112.4MB in the beginning and 241.3MB in the end (delta: -129.0MB). Peak memory consumption was 255.2MB. Max. memory is 16.1GB. [2022-11-23 16:09:04,287 INFO L158 Benchmark]: Witness Printer took 74.36ms. Allocated memory is still 503.3MB. Free memory was 241.3MB in the beginning and 238.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 16:09:04,291 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 138.4MB. Free memory is still 81.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.68ms. Allocated memory is still 197.1MB. Free memory was 152.2MB in the beginning and 134.8MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.93ms. Allocated memory is still 197.1MB. Free memory was 134.8MB in the beginning and 132.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.93ms. Allocated memory is still 197.1MB. Free memory was 132.7MB in the beginning and 131.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 586.07ms. Allocated memory is still 197.1MB. Free memory was 131.2MB in the beginning and 113.0MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 54629.74ms. Allocated memory was 197.1MB in the beginning and 503.3MB in the end (delta: 306.2MB). Free memory was 112.4MB in the beginning and 241.3MB in the end (delta: -129.0MB). Peak memory consumption was 255.2MB. Max. memory is 16.1GB. * Witness Printer took 74.36ms. Allocated memory is still 503.3MB. Free memory was 241.3MB in the beginning and 238.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_406,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_406,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_406,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_401,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_406,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_401,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 630]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.4s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 592 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 592 mSDsluCounter, 314 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 161 IncrementalHoareTripleChecker+Unchecked, 249 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 993 IncrementalHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 65 mSDtfsCounter, 993 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 602 GetRequests, 339 SyntacticMatches, 29 SemanticMatches, 234 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=10, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 62 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 28 NumberOfFragments, 1926 HoareAnnotationTreeSize, 10 FomulaSimplifications, 648 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 10 FomulaSimplificationsInter, 17856 FormulaSimplificationTreeSizeReductionInter, 5.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 373 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 512 ConstructedInterpolants, 6 QuantifiedInterpolants, 3040 SizeOfPredicates, 86 NumberOfNonLiveVariables, 2561 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 35 InterpolantComputations, 3 PerfectInterpolantSequences, 246/343 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 6.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 21, DAG_INTERPRETER_EARLY_EXITS: 4, TOOLS_POST_APPLICATIONS: 47, TOOLS_POST_TIME: 6.4s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 45, TOOLS_QUANTIFIERELIM_TIME: 6.4s, TOOLS_QUANTIFIERELIM_MAX_TIME: 1.7s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 100, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 5, DOMAIN_JOIN_TIME: 0.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 8, DOMAIN_WIDEN_TIME: 0.2s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 13, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 21, DOMAIN_ISBOTTOM_TIME: 0.0s, LOOP_SUMMARIZER_APPLICATIONS: 5, LOOP_SUMMARIZER_CACHE_MISSES: 5, LOOP_SUMMARIZER_OVERALL_TIME: 6.5s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 6.5s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 13, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 298, DAG_COMPRESSION_RETAINED_NODES: 91, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 622]: Loop Invariant [2022-11-23 16:09:04,317 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,318 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,319 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,320 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,321 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && len == data) && unknown-#in~data-unknown <= 3) && 0 <= #in~head) && 1 <= unknown-#in~data-unknown) && i <= 0) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 0) && data == 1) && #in~head <= 0) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && unknown-#in~index-unknown <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && s <= 0) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || ((((((((((((((((((((((((((((((((((len == data && unknown-#in~data-unknown <= 3) && \valid[temp] == 1) && 0 <= #in~head) && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && #in~head <= 0) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && unknown-#in~index-unknown <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && len == i + 1) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((data == unknown-#in~data-unknown && !(temp == head)) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && 8 == unknown-#length-unknown[temp]) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == unknown-#in~data-unknown) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && !(temp == 0)) && 0 <= head) && len <= 2) && #NULL == 0) || ((((((((((((((((((((2 == len && data == unknown-#in~data-unknown) && \valid[temp] == 1) && 1 <= unknown-#in~data-unknown) && 8 == unknown-#length-unknown[temp]) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && temp < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && data == unknown-#in~data-unknown) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && !(temp == 0)) && 0 <= head) && #NULL == 0) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 585]: Loop Invariant [2022-11-23 16:09:04,324 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,325 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: ((((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && 1 <= len) && 1 <= data) && data == 1) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && 0 <= head) && len <= 2) && #NULL == 0) || (((((((((((((2 == len && 1 <= unknown-#in~data-unknown) && unknown-#in~data-unknown <= 1) && head <= 0) && 1 <= data) && data == 1) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && 0 <= head) && #NULL == 0)) || ((((((((((((((((\valid[temp] == 1 && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && head == 0) && 1 <= data) && data == 1) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && #NULL == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && !(#memory_$Pointer$[head][4] == head)) && len <= 2) && #NULL == 0) - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant [2022-11-23 16:09:04,326 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,327 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,327 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,327 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,327 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,328 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,328 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,328 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_406,QUANTIFIED] [2022-11-23 16:09:04,329 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,329 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] [2022-11-23 16:09:04,329 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,330 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,330 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] [2022-11-23 16:09:04,330 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,331 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,331 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,334 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,335 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,335 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,335 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,336 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,336 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,336 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,336 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_406,QUANTIFIED] [2022-11-23 16:09:04,337 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,337 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] [2022-11-23 16:09:04,337 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,338 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,338 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] [2022-11-23 16:09:04,338 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,339 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,339 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((((((((((((((((((((((((((len == data && unknown-#in~data-unknown <= 3) && len * 2 == unknown-#memory_int-unknown[#memory_$Pointer$[s][s + 4]][#memory_$Pointer$[s][s + 4]] + 1) && \valid[temp] == 1) && 0 <= #in~head) && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && index <= 0) && i + 1 <= 0) && data == 1) && #in~head <= 0) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && unknown-#in~index-unknown <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || (((((((((((((((((((((s == \result && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && len <= 0) && 1 <= data) && data == 1) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && \result == head) && #NULL == 0) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && len == i + 1) && !(#memory_$Pointer$[head][4] == head)) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((i == 0 && unknown-#in~data-unknown <= 3) && \valid[temp] == 1) && 0 <= #in~head) && \valid[head] == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= len + 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || (forall v_ArrVal_406 : [int]int, v_ArrVal_405 : int, v_ArrVal_402 : int :: len * 2 <= unknown-#memory_int-unknown[s := v_ArrVal_406][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_405][s + 4]][#memory_$Pointer$[s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_402][s + 4]] + 1))) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && index <= 0) && data == 1) && #in~head <= 0) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && #NULL == 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]]) && 0 <= \result) && unknown-#in~index-unknown <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && 0 <= head) && s == 0) && #NULL == 0) - InvariantResult [Line: 600]: Loop Invariant [2022-11-23 16:09:04,340 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,341 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,342 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,343 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,344 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,345 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,346 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,347 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,347 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,347 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,348 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,348 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,349 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,349 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,350 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((((((((((((((((((((((((((((index <= 0 && 2 <= unknown-#memory_int-unknown[head][head]) && 0 <= s) && unknown-#in~data-unknown <= 3) && 0 <= #in~head) && 1 <= unknown-#in~data-unknown) && unknown-#memory_int-unknown[head][head] <= 2) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && len == 2 + i) && len <= 0) && \result <= 0) && 1 <= data) && data <= 3) && 2 == expected) && index <= 0) && 0 <= i) && data == len + i) && index <= 1) && data == 1) && #in~head <= 0) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && unknown-#in~index-unknown <= 1) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && s <= 0) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) || (((((((((((((((((((((((((((((((((((((((((index <= 0 && 0 <= s) && len == data) && unknown-#in~data-unknown <= 3) && \valid[temp] == 1) && 0 <= #in~head) && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 * ((unknown-#memory_int-unknown[head][head] + 1) / -2) + expected + 1 == 0) && 1 <= data) && data <= 3) && (unknown-#memory_int-unknown[head][head] + 1) % 2 == 0) && 0 <= i) && index <= 1) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && #in~head <= 0) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && head == s) && 0 <= \result) && unknown-#in~index-unknown <= 1) && !(head == #memory_$Pointer$[head][4])) && i <= 1) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && s <= 0) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0)) || (((((((((((((((((((((((((((((((((((((((((len == data && unknown-#in~data-unknown <= 3) && \valid[temp] == 1) && 0 <= #in~head) && \valid[head] == 1) && unknown-#in~index-unknown == i) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && len <= 0) && \result <= 0) && 1 <= data) && data == 1) && unknown-#memory_int-unknown[#memory_$Pointer$[s][4]][#memory_$Pointer$[s][4]] <= 2 + i) && #in~head <= 0) && data <= 1) && unknown-#in~len-unknown <= 2) && (unknown-#memory_int-unknown[#memory_$Pointer$[head][head + 4]][#memory_$Pointer$[head][head + 4]] + 1) / -2 * 2 + expected + 1 == 0) && #in~head == s) && len == 2) && s == head) && unknown-#memory_int-unknown[s][s] <= len) && #NULL == 0) && #in~head == s) && head == s) && unknown-#in~index-unknown == index) && 0 <= \result) && unknown-#in~index-unknown <= 1) && !(head == #memory_$Pointer$[head][4])) && new_data <= 3) && head == 0) && index + 1 <= i) && #in~head == head) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && len == i + 1) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && s == 0) && len <= unknown-#memory_int-unknown[s][s]) && #NULL == 0) - InvariantResult [Line: 607]: Loop Invariant [2022-11-23 16:09:04,351 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,352 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_406,QUANTIFIED] [2022-11-23 16:09:04,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,352 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] [2022-11-23 16:09:04,353 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,354 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] [2022-11-23 16:09:04,354 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,355 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,355 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2022-11-23 16:09:04,356 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] [2022-11-23 16:09:04,356 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,356 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,357 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,357 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,357 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_401,QUANTIFIED] [2022-11-23 16:09:04,357 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] [2022-11-23 16:09:04,358 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,360 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,360 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_406,QUANTIFIED] [2022-11-23 16:09:04,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,361 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] [2022-11-23 16:09:04,361 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,362 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] [2022-11-23 16:09:04,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,362 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,363 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,363 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-11-23 16:09:04,363 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_399,QUANTIFIED] [2022-11-23 16:09:04,363 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_402,QUANTIFIED] [2022-11-23 16:09:04,364 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,364 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] [2022-11-23 16:09:04,364 WARN L421 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-11-23 16:09:04,365 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_401,QUANTIFIED] [2022-11-23 16:09:04,365 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ArrVal_405,QUANTIFIED] [2022-11-23 16:09:04,365 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_sll_update_at_~head#1.offset_35,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((((s == \result && head == \result) && \valid[temp] == 1) && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && len <= 0) && 1 <= data) && #in~head == s) && #in~head == head) && data == 1) && data <= 1) && data == unknown-#in~data-unknown) && unknown-#in~len-unknown <= 2) && len + i == new_data) && len == 2) && s == head) && \result == head) && #NULL == 0) && len * 2 == data + 1) && index == i) && head == s) && \result == s) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && len == i + 1) && unknown-#in~index-unknown == i) && !(#memory_$Pointer$[head][4] == head)) && s == 0) && #NULL == 0) || ((((((((((((((((((((((((((((((((((unknown-#in~data-unknown <= 3 && \valid[temp] == 1) && 0 <= #in~head) && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && len <= 0) && \result <= 0) && 2 + i <= len) && 1 <= data) && index <= 0) && 0 <= i) && data == len + i) && index <= 1) && data == 1) && #in~head <= 0) && (forall v_ArrVal_406 : [int]int, v_ArrVal_405 : int, v_ArrVal_402 : int :: unknown-#memory_int-unknown[head := v_ArrVal_406][#memory_$Pointer$[head := #memory_$Pointer$[head][head := v_ArrVal_405]][s][s + 4]][#memory_$Pointer$[head := #memory_$Pointer$[head][head := v_ArrVal_402]][s][s + 4]] + 1 <= len * 2)) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && s == head) && #NULL == 0) && head == s) && 0 <= \result) && unknown-#in~index-unknown <= 1) && i <= 1) && new_data <= 3) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && len + 1 <= unknown-#memory_int-unknown[#memory_$Pointer$[head][4]][#memory_$Pointer$[head][4]]) && 0 <= head) && s == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((((unknown-#in~data-unknown <= 3 && \valid[temp] == 1) && 0 <= #in~head) && \valid[head] == 1) && 1 <= unknown-#in~data-unknown) && temp == 0) && unknown-#in~data-unknown <= 1) && head <= 0) && i == 1) && len <= 0) && \result <= 0) && 1 <= data) && data == len + i) && index <= 1) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || (forall v_ArrVal_399 : [int]int, v_ArrVal_402 : int :: #memory_$Pointer$[head := v_ArrVal_399][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_402][s + 4] == head))) && data == 1) && #in~head <= 0) && data <= 1) && unknown-#in~len-unknown <= 2) && len == 2) && #NULL == 0) && 0 <= \result) && unknown-#in~index-unknown <= 1) && i <= 1) && new_data <= 3) && index + 1 <= i) && 0 <= unknown-#StackHeapBarrier-unknown) && 2 <= unknown-#in~len-unknown) && !(#memory_$Pointer$[head][4] == head)) && 0 <= head) && (forall v_ULTIMATE.start_sll_update_at_~head#1.offset_35 : int :: s < v_ULTIMATE.start_sll_update_at_~head#1.offset_35 || (forall v_ArrVal_405 : int, v_ArrVal_401 : [int]int :: head == #memory_$Pointer$[head := v_ArrVal_401][s][v_ULTIMATE.start_sll_update_at_~head#1.offset_35 := v_ArrVal_405][s + 4]))) && s == 0) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-23 16:09:04,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a773fe7b-1686-4f55-848d-bd373ee0f083/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE