./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur --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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- 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-38b53e6 [2022-11-25 22:39:54,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:39:54,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:39:54,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:39:54,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:39:55,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:39:55,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:39:55,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:39:55,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:39:55,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:39:55,019 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:39:55,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:39:55,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:39:55,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:39:55,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:39:55,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:39:55,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:39:55,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:39:55,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:39:55,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:39:55,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:39:55,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:39:55,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:39:55,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:39:55,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:39:55,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:39:55,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:39:55,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:39:55,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:39:55,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:39:55,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:39:55,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:39:55,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:39:55,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:39:55,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:39:55,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:39:55,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:39:55,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:39:55,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:39:55,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:39:55,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:39:55,052 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 22:39:55,077 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:39:55,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:39:55,078 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:39:55,078 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:39:55,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:39:55,079 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:39:55,079 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:39:55,079 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:39:55,079 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:39:55,080 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:39:55,080 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:39:55,080 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:39:55,080 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:39:55,081 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:39:55,081 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:39:55,081 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:39:55,081 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:39:55,081 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:39:55,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:39:55,082 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:39:55,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:39:55,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:39:55,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:39:55,083 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 22:39:55,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:39:55,083 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 22:39:55,084 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:39:55,084 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 22:39:55,084 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:39:55,084 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 22:39:55,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:39:55,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:39:55,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:39:55,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:39:55,085 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:39:55,085 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:39:55,085 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 22:39:55,086 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:39:55,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:39:55,086 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 22:39:55,086 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:39:55,086 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_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/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_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2022-11-25 22:39:55,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:39:55,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:39:55,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:39:55,469 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:39:55,470 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:39:55,471 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-11-25 22:39:58,432 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:39:58,740 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:39:58,742 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-11-25 22:39:58,754 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/data/f9d3d2615/eb80394d0be24ee68fd79b2924c54d26/FLAGc1bea5739 [2022-11-25 22:39:58,772 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/data/f9d3d2615/eb80394d0be24ee68fd79b2924c54d26 [2022-11-25 22:39:58,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:39:58,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:39:58,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:39:58,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:39:58,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:39:58,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:39:58" (1/1) ... [2022-11-25 22:39:58,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c51661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:39:58, skipping insertion in model container [2022-11-25 22:39:58,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:39:58" (1/1) ... [2022-11-25 22:39:58,792 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:39:58,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:39:59,180 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_1a60c425-b696-4378-b3b6-bbb1122f1f2d/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-11-25 22:39:59,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:39:59,202 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:39:59,240 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_1a60c425-b696-4378-b3b6-bbb1122f1f2d/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-11-25 22:39:59,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:39:59,266 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:39:59,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:39:59 WrapperNode [2022-11-25 22:39:59,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:39:59,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:39:59,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:39:59,268 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:39:59,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:39:59" (1/1) ... [2022-11-25 22:39:59,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:39:59" (1/1) ... [2022-11-25 22:39:59,345 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-11-25 22:39:59,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:39:59,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:39:59,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:39:59,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:39:59,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:39:59" (1/1) ... [2022-11-25 22:39:59,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:39:59" (1/1) ... [2022-11-25 22:39:59,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:39:59" (1/1) ... [2022-11-25 22:39:59,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:39:59" (1/1) ... [2022-11-25 22:39:59,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:39:59" (1/1) ... [2022-11-25 22:39:59,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:39:59" (1/1) ... [2022-11-25 22:39:59,400 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:39:59" (1/1) ... [2022-11-25 22:39:59,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:39:59" (1/1) ... [2022-11-25 22:39:59,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:39:59,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:39:59,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:39:59,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:39:59,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:39:59" (1/1) ... [2022-11-25 22:39:59,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:39:59,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:39:59,444 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:39:59,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:39:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 22:39:59,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 22:39:59,499 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-25 22:39:59,499 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-25 22:39:59,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 22:39:59,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:39:59,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 22:39:59,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 22:39:59,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 22:39:59,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:39:59,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 22:39:59,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 22:39:59,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:39:59,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:39:59,618 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:39:59,620 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:39:59,881 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:39:59,940 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:39:59,940 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 22:39:59,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:39:59 BoogieIcfgContainer [2022-11-25 22:39:59,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:39:59,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:39:59,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:39:59,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:39:59,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:39:58" (1/3) ... [2022-11-25 22:39:59,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263f591f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:39:59, skipping insertion in model container [2022-11-25 22:39:59,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:39:59" (2/3) ... [2022-11-25 22:39:59,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263f591f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:39:59, skipping insertion in model container [2022-11-25 22:39:59,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:39:59" (3/3) ... [2022-11-25 22:39:59,953 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2022-11-25 22:39:59,973 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:39:59,974 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 22:40:00,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:40:00,058 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;@49a1a2f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:40:00,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 22:40:00,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:40:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 22:40:00,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:40:00,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:40:00,087 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:40:00,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:40:00,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1657314583, now seen corresponding path program 1 times [2022-11-25 22:40:00,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:40:00,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179738037] [2022-11-25 22:40:00,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:40:00,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:40:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:40:00,502 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-25 22:40:00,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:40:00,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179738037] [2022-11-25 22:40:00,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179738037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:40:00,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:40:00,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:40:00,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425563908] [2022-11-25 22:40:00,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:40:00,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:40:00,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:40:00,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:40:00,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:40:00,564 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:40:00,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:40:00,633 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-11-25 22:40:00,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:40:00,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-11-25 22:40:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:40:00,648 INFO L225 Difference]: With dead ends: 37 [2022-11-25 22:40:00,648 INFO L226 Difference]: Without dead ends: 18 [2022-11-25 22:40:00,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:40:00,655 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:40:00,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:40:00,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-25 22:40:00,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-11-25 22:40:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:40:00,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-11-25 22:40:00,695 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2022-11-25 22:40:00,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:40:00,697 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-11-25 22:40:00,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:40:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-11-25 22:40:00,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 22:40:00,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:40:00,700 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:40:00,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 22:40:00,701 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:40:00,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:40:00,702 INFO L85 PathProgramCache]: Analyzing trace with hash -323849658, now seen corresponding path program 1 times [2022-11-25 22:40:00,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:40:00,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551275685] [2022-11-25 22:40:00,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:40:00,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:40:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:40:00,950 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-25 22:40:00,950 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:40:00,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551275685] [2022-11-25 22:40:00,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551275685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:40:00,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100326402] [2022-11-25 22:40:00,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:40:00,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:40:00,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:40:00,955 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:40:00,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 22:40:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:40:01,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:40:01,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:40:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:40:01,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:40:01,263 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-25 22:40:01,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100326402] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:40:01,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [609584247] [2022-11-25 22:40:01,285 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-25 22:40:01,285 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:40:01,289 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:40:01,295 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:40:01,296 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:40:01,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:01,494 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:40:01,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-25 22:40:01,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:01,535 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 22:40:01,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-25 22:40:01,600 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-25 22:40:01,607 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-25 22:40:01,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:01,621 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 20 treesize of output 9 [2022-11-25 22:40:01,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:01,630 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 20 treesize of output 9 [2022-11-25 22:40:01,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:01,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-25 22:40:01,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:01,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-25 22:40:01,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:01,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-25 22:40:01,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:01,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-25 22:40:01,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:01,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-25 22:40:01,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:01,899 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 21 treesize of output 13 [2022-11-25 22:40:01,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:01,912 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 21 treesize of output 13 [2022-11-25 22:40:01,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:01,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 22:40:02,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:40:02,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:40:02,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:40:02,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:40:02,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:40:02,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:40:02,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:40:02,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:40:02,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:40:02,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:40:02,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:02,387 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 222 treesize of output 202 [2022-11-25 22:40:02,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:02,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 204 [2022-11-25 22:40:02,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:02,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 208 [2022-11-25 22:40:02,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:40:02,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:40:02,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:40:02,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:40:02,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:40:02,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:40:02,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:40:02,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:40:02,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:40:02,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:40:02,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:02,795 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 222 treesize of output 202 [2022-11-25 22:40:02,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:02,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 204 [2022-11-25 22:40:02,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:02,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 208 [2022-11-25 22:40:03,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:40:03,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:40:03,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:40:03,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:40:03,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:03,465 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-11-25 22:40:03,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 212 [2022-11-25 22:40:03,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 22:40:03,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:03,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:03,509 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:40:03,510 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 1 case distinctions, treesize of input 249 treesize of output 224 [2022-11-25 22:40:03,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:03,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:03,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:40:03,546 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 1 case distinctions, treesize of input 241 treesize of output 216 [2022-11-25 22:40:03,782 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-11-25 22:40:03,789 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-25 22:40:03,797 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-25 22:40:03,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:03,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-25 22:40:03,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:03,826 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 20 treesize of output 9 [2022-11-25 22:40:03,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:03,834 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 20 treesize of output 9 [2022-11-25 22:40:03,836 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 22:40:06,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [609584247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:40:06,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:40:06,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 4, 4] total 13 [2022-11-25 22:40:06,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129916272] [2022-11-25 22:40:06,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:40:06,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 22:40:06,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 22:40:06,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 22:40:06,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-25 22:40:06,706 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:40:07,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:40:07,056 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-11-25 22:40:07,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 22:40:07,057 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-11-25 22:40:07,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:40:07,058 INFO L225 Difference]: With dead ends: 22 [2022-11-25 22:40:07,058 INFO L226 Difference]: Without dead ends: 17 [2022-11-25 22:40:07,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-25 22:40:07,060 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 22:40:07,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 22:40:07,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-25 22:40:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-25 22:40:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:40:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-25 22:40:07,074 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 17 [2022-11-25 22:40:07,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:40:07,074 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-25 22:40:07,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:40:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-25 22:40:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 22:40:07,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:40:07,075 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:40:07,087 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 22:40:07,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:40:07,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:40:07,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:40:07,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1525107315, now seen corresponding path program 1 times [2022-11-25 22:40:07,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:40:07,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561431047] [2022-11-25 22:40:07,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:40:07,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:40:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:40:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 22:40:07,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 22:40:07,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561431047] [2022-11-25 22:40:07,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561431047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:40:07,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070651767] [2022-11-25 22:40:07,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:40:07,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:40:07,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:40:07,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:40:07,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 22:40:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:40:07,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:40:07,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:40:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 22:40:07,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:40:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 22:40:07,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070651767] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:40:07,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [545603020] [2022-11-25 22:40:07,610 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-11-25 22:40:07,610 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 22:40:07,611 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 22:40:07,611 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 22:40:07,611 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 22:40:07,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:07,640 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:40:07,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-25 22:40:07,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:07,666 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 22:40:07,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-25 22:40:07,696 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-25 22:40:07,700 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-25 22:40:07,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:07,709 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 20 treesize of output 9 [2022-11-25 22:40:07,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:07,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-11-25 22:40:07,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:07,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-11-25 22:40:07,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:07,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-25 22:40:07,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:07,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-25 22:40:07,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:07,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-25 22:40:07,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:07,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-25 22:40:07,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:07,845 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 21 treesize of output 13 [2022-11-25 22:40:07,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:07,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-25 22:40:07,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:07,892 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 21 treesize of output 13 [2022-11-25 22:40:07,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:40:07,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:40:07,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:40:07,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:40:07,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:40:08,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:40:08,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-11-25 22:40:08,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:40:08,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:40:08,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:40:08,158 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-25 22:40:08,167 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-25 22:40:08,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 22:40:08,303 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 76 treesize of output 58 [2022-11-25 22:40:08,315 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 51 treesize of output 45 [2022-11-25 22:40:08,451 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 57 treesize of output 51 [2022-11-25 22:40:08,462 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 70 treesize of output 52 [2022-11-25 22:40:08,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-25 22:40:08,530 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-25 22:40:08,542 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-25 22:40:08,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:40:08,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:40:08,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:40:08,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:40:09,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 112 [2022-11-25 22:40:09,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 94 [2022-11-25 22:40:09,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 76 [2022-11-25 22:40:09,891 INFO L321 Elim1Store]: treesize reduction 144, result has 36.0 percent of original size [2022-11-25 22:40:09,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 265 treesize of output 473 [2022-11-25 22:40:09,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:40:10,022 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 21 treesize of output 17 [2022-11-25 22:40:10,090 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 10 treesize of output 9 [2022-11-25 22:40:10,149 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 10 treesize of output 9 [2022-11-25 22:40:10,182 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 10 treesize of output 9 [2022-11-25 22:40:10,301 INFO L321 Elim1Store]: treesize reduction 21, result has 12.5 percent of original size [2022-11-25 22:40:10,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2022-11-25 22:40:10,508 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 10 treesize of output 9 [2022-11-25 22:40:10,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:10,605 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 26 treesize of output 27 [2022-11-25 22:40:10,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:10,637 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 26 treesize of output 27 [2022-11-25 22:40:10,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:10,678 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 16 treesize of output 20 [2022-11-25 22:40:10,834 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:10,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:10,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:11,294 INFO L321 Elim1Store]: treesize reduction 82, result has 43.8 percent of original size [2022-11-25 22:40:11,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 1027 treesize of output 1537 [2022-11-25 22:40:13,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:13,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:13,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:13,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:13,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:13,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:13,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:13,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 684 treesize of output 3376 [2022-11-25 22:40:14,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:14,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:14,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:14,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:14,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:14,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:14,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:14,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:14,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 923 treesize of output 5962 [2022-11-25 22:40:14,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:14,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:14,719 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:14,731 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:15,417 INFO L321 Elim1Store]: treesize reduction 129, result has 7.9 percent of original size [2022-11-25 22:40:15,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 2411 treesize of output 4271 [2022-11-25 22:40:16,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:17,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:17,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:17,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:17,434 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:17,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:17,466 INFO L217 Elim1Store]: Index analysis took 1191 ms [2022-11-25 22:40:17,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 2782 treesize of output 7614 [2022-11-25 22:40:18,421 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:18,424 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:18,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:18,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:18,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:18,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:18,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:18,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:18,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:18,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:18,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:18,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:18,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:18,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:18,602 INFO L217 Elim1Store]: Index analysis took 192 ms [2022-11-25 22:40:18,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 624 treesize of output 4185 [2022-11-25 22:40:41,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,281 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,282 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,284 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1125 treesize of output 3111 [2022-11-25 22:40:41,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:41,956 INFO L321 Elim1Store]: treesize reduction 180, result has 5.8 percent of original size [2022-11-25 22:40:41,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 4456 treesize of output 7056 [2022-11-25 22:40:44,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:44,379 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:44,653 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:44,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:44,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:44,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:44,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:44,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:44,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:44,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:44,834 INFO L217 Elim1Store]: Index analysis took 360 ms [2022-11-25 22:40:44,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 14 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 9075 treesize of output 39530 [2022-11-25 22:40:45,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:40:45,541 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:45,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:45,897 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:45,917 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:45,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:45,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:45,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:45,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:45,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:45,945 INFO L217 Elim1Store]: Index analysis took 330 ms [2022-11-25 22:40:45,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 14 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 13138 treesize of output 43109 [2022-11-25 22:40:46,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:46,853 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:46,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:46,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:46,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:46,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:46,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:46,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:46,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:46,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:46,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 22450 treesize of output 24955 [2022-11-25 22:40:50,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:50,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:50,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:50,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:50,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:50,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:50,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:50,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:50,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:50,615 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:50,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 22443 treesize of output 24950 [2022-11-25 22:40:53,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:53,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:53,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:53,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:53,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:53,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:53,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:53,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:53,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:53,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:40:53,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 22443 treesize of output 24950 [2022-11-25 22:41:34,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:34,707 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:34,715 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-11-25 22:41:34,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:34,727 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:34,733 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-11-25 22:41:34,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:34,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:34,766 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-11-25 22:41:34,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:34,832 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:34,905 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:34,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:34,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:34,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:34,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:34,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:34,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 930 treesize of output 3395 [2022-11-25 22:41:35,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,105 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-11-25 22:41:35,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,121 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-11-25 22:41:35,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,199 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,201 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,202 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 953 treesize of output 3570 [2022-11-25 22:41:35,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,331 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1125 treesize of output 3111 [2022-11-25 22:41:35,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,560 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 953 treesize of output 3570 [2022-11-25 22:41:35,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:35,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1125 treesize of output 3111 [2022-11-25 22:41:36,472 INFO L321 Elim1Store]: treesize reduction 117, result has 17.6 percent of original size [2022-11-25 22:41:36,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 245 treesize of output 332 [2022-11-25 22:41:36,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:36,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:36,900 INFO L321 Elim1Store]: treesize reduction 66, result has 46.3 percent of original size [2022-11-25 22:41:36,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 622 treesize of output 946 [2022-11-25 22:41:37,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:37,100 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:37,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:37,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:37,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:37,253 INFO L217 Elim1Store]: Index analysis took 179 ms [2022-11-25 22:41:37,277 INFO L321 Elim1Store]: treesize reduction 67, result has 1.5 percent of original size [2022-11-25 22:41:37,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 236 treesize of output 824 [2022-11-25 22:41:39,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:39,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:39,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 611 treesize of output 929 [2022-11-25 22:41:40,119 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:40,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:40,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:40,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:40,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:40,199 INFO L217 Elim1Store]: Index analysis took 132 ms [2022-11-25 22:41:40,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 626 [2022-11-25 22:41:52,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:52,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:52,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:52,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:52,588 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-11-25 22:41:52,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:52,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:52,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:52,608 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:52,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:52,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 524 treesize of output 2159 [2022-11-25 22:41:52,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:52,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 97 [2022-11-25 22:41:52,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:52,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:52,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:52,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:52,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:52,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 519 treesize of output 2156 [2022-11-25 22:41:52,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:52,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 115 [2022-11-25 22:41:53,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:53,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:53,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:53,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:53,096 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:53,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 507 treesize of output 2146 [2022-11-25 22:41:53,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:53,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 79 [2022-11-25 22:41:53,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:53,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:53,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:53,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:53,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:53,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 519 treesize of output 2156 [2022-11-25 22:41:53,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:53,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 97 [2022-11-25 22:41:53,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:53,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:53,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:53,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:53,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:53,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 524 treesize of output 2159 [2022-11-25 22:41:53,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:53,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:53,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 7 [2022-11-25 22:41:53,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:53,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:53,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:53,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:53,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:53,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:53,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 767 treesize of output 11317 [2022-11-25 22:41:54,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:54,109 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:54,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:54,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:54,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:54,152 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:54,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 762 treesize of output 11314 [2022-11-25 22:41:54,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:54,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:54,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:54,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:54,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:55,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:55,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 767 treesize of output 11317 [2022-11-25 22:41:55,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:55,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:55,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:55,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:55,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:55,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:55,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 762 treesize of output 11314 [2022-11-25 22:41:56,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:56,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:56,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:56,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:56,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:56,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:56,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 750 treesize of output 11304 [2022-11-25 22:41:57,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:57,266 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:57,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:57,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:57,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:57,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:57,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 767 treesize of output 11317 [2022-11-25 22:41:58,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:58,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:58,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:58,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:58,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:58,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:58,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 755 treesize of output 11307 [2022-11-25 22:41:58,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:58,831 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:58,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:58,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:58,842 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:58,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:58,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 772 treesize of output 11320 [2022-11-25 22:41:59,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:59,395 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:59,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:59,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:41:59,407 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:59,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:41:59,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 11 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 767 treesize of output 11317 [2022-11-25 22:42:06,108 INFO L217 Elim1Store]: Index analysis took 589 ms [2022-11-25 22:42:30,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 22:42:30,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:42:30,384 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 178905 column 7: canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:345) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:119) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 178905 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.pushContext(SimplifyDDA.java:736) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:389) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:648) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 68 more [2022-11-25 22:42:30,389 INFO L158 Benchmark]: Toolchain (without parser) took 151613.16ms. Allocated memory was 125.8MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 94.5MB in the beginning and 9.1GB in the end (delta: -9.0GB). Peak memory consumption was 2.3GB. Max. memory is 16.1GB. [2022-11-25 22:42:30,390 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 125.8MB. Free memory is still 101.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:42:30,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.50ms. Allocated memory is still 125.8MB. Free memory was 94.5MB in the beginning and 77.1MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 22:42:30,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.75ms. Allocated memory is still 125.8MB. Free memory was 77.1MB in the beginning and 75.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:42:30,390 INFO L158 Benchmark]: Boogie Preprocessor took 65.53ms. Allocated memory is still 125.8MB. Free memory was 75.0MB in the beginning and 72.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:42:30,391 INFO L158 Benchmark]: RCFGBuilder took 529.51ms. Allocated memory is still 125.8MB. Free memory was 72.9MB in the beginning and 53.6MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 22:42:30,391 INFO L158 Benchmark]: TraceAbstraction took 150443.69ms. Allocated memory was 125.8MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 52.7MB in the beginning and 9.1GB in the end (delta: -9.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2022-11-25 22:42:30,392 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.24ms. Allocated memory is still 125.8MB. Free memory is still 101.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.50ms. Allocated memory is still 125.8MB. Free memory was 94.5MB in the beginning and 77.1MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.75ms. Allocated memory is still 125.8MB. Free memory was 77.1MB in the beginning and 75.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.53ms. Allocated memory is still 125.8MB. Free memory was 75.0MB in the beginning and 72.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 529.51ms. Allocated memory is still 125.8MB. Free memory was 72.9MB in the beginning and 53.6MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 150443.69ms. Allocated memory was 125.8MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 52.7MB in the beginning and 9.1GB in the end (delta: -9.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 178905 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 178905 column 7: canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-25 22:42:30,604 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-25 22:42:30,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur --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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- 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-38b53e6 [2022-11-25 22:42:32,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:42:32,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:42:33,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:42:33,011 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:42:33,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:42:33,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:42:33,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:42:33,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:42:33,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:42:33,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:42:33,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:42:33,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:42:33,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:42:33,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:42:33,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:42:33,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:42:33,042 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:42:33,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:42:33,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:42:33,051 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:42:33,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:42:33,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:42:33,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:42:33,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:42:33,067 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:42:33,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:42:33,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:42:33,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:42:33,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:42:33,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:42:33,073 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:42:33,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:42:33,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:42:33,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:42:33,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:42:33,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:42:33,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:42:33,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:42:33,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:42:33,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:42:33,095 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-25 22:42:33,130 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:42:33,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:42:33,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:42:33,133 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:42:33,134 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:42:33,134 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:42:33,134 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:42:33,135 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:42:33,135 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:42:33,135 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:42:33,136 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:42:33,137 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:42:33,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:42:33,138 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:42:33,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:42:33,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:42:33,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 22:42:33,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:42:33,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 22:42:33,140 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:42:33,140 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 22:42:33,140 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 22:42:33,141 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:42:33,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 22:42:33,141 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:42:33,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 22:42:33,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:42:33,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 22:42:33,143 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:42:33,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:42:33,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:42:33,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:42:33,144 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 22:42:33,144 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 22:42:33,144 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 22:42:33,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 22:42:33,145 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:42:33,145 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 22:42:33,146 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/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_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2022-11-25 22:42:33,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:42:33,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:42:33,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:42:33,549 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:42:33,549 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:42:33,551 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-11-25 22:42:36,700 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:42:36,965 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:42:36,966 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-11-25 22:42:36,978 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/data/262318ce3/4b9d3dd35a5e4d35bf56894f06abdb7a/FLAGf54fb4966 [2022-11-25 22:42:36,998 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/data/262318ce3/4b9d3dd35a5e4d35bf56894f06abdb7a [2022-11-25 22:42:37,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:42:37,003 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:42:37,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:42:37,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:42:37,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:42:37,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:42:37" (1/1) ... [2022-11-25 22:42:37,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca771cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:37, skipping insertion in model container [2022-11-25 22:42:37,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:42:37" (1/1) ... [2022-11-25 22:42:37,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:42:37,051 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:42:37,422 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_1a60c425-b696-4378-b3b6-bbb1122f1f2d/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-11-25 22:42:37,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:42:37,452 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:42:37,513 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_1a60c425-b696-4378-b3b6-bbb1122f1f2d/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-11-25 22:42:37,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:42:37,545 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:42:37,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:37 WrapperNode [2022-11-25 22:42:37,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:42:37,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:42:37,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:42:37,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:42:37,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:37" (1/1) ... [2022-11-25 22:42:37,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:37" (1/1) ... [2022-11-25 22:42:37,616 INFO L138 Inliner]: procedures = 130, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2022-11-25 22:42:37,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:42:37,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:42:37,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:42:37,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:42:37,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:37" (1/1) ... [2022-11-25 22:42:37,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:37" (1/1) ... [2022-11-25 22:42:37,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:37" (1/1) ... [2022-11-25 22:42:37,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:37" (1/1) ... [2022-11-25 22:42:37,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:37" (1/1) ... [2022-11-25 22:42:37,646 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:37" (1/1) ... [2022-11-25 22:42:37,649 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:37" (1/1) ... [2022-11-25 22:42:37,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:37" (1/1) ... [2022-11-25 22:42:37,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:42:37,666 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:42:37,666 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:42:37,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:42:37,667 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:37" (1/1) ... [2022-11-25 22:42:37,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:42:37,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:42:37,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:42:37,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:42:37,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-25 22:42:37,761 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-25 22:42:37,761 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-25 22:42:37,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 22:42:37,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:42:37,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 22:42:37,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 22:42:37,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 22:42:37,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 22:42:37,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 22:42:37,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 22:42:37,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 22:42:37,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:42:37,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:42:37,933 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:42:37,935 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:42:38,381 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:42:38,387 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:42:38,388 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 22:42:38,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:42:38 BoogieIcfgContainer [2022-11-25 22:42:38,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:42:38,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:42:38,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:42:38,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:42:38,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:42:37" (1/3) ... [2022-11-25 22:42:38,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4249f7e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:42:38, skipping insertion in model container [2022-11-25 22:42:38,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:42:37" (2/3) ... [2022-11-25 22:42:38,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4249f7e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:42:38, skipping insertion in model container [2022-11-25 22:42:38,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:42:38" (3/3) ... [2022-11-25 22:42:38,409 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2022-11-25 22:42:38,429 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:42:38,429 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 22:42:38,496 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:42:38,502 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;@42279786, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:42:38,503 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 22:42:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:42:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 22:42:38,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:38,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:42:38,518 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:42:38,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:38,526 INFO L85 PathProgramCache]: Analyzing trace with hash -497301104, now seen corresponding path program 1 times [2022-11-25 22:42:38,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:38,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816166093] [2022-11-25 22:42:38,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:38,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:42:38,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:38,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:42:38,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 22:42:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:38,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 22:42:38,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:38,788 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-25 22:42:38,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:38,789 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:38,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816166093] [2022-11-25 22:42:38,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816166093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:38,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:38,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:42:38,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754153779] [2022-11-25 22:42:38,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:38,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 22:42:38,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:38,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 22:42:38,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 22:42:38,830 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:42:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:38,858 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2022-11-25 22:42:38,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 22:42:38,861 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-25 22:42:38,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:38,869 INFO L225 Difference]: With dead ends: 54 [2022-11-25 22:42:38,869 INFO L226 Difference]: Without dead ends: 24 [2022-11-25 22:42:38,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 22:42:38,878 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:38,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:42:38,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-25 22:42:38,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-25 22:42:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:42:38,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-11-25 22:42:38,926 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 19 [2022-11-25 22:42:38,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:38,927 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-11-25 22:42:38,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:42:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-11-25 22:42:38,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 22:42:38,929 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:38,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:42:38,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 22:42:39,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:42:39,154 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:42:39,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:39,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1988891516, now seen corresponding path program 1 times [2022-11-25 22:42:39,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:39,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965806778] [2022-11-25 22:42:39,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:39,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:42:39,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:39,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:42:39,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 22:42:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:39,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:42:39,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:39,386 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-25 22:42:39,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:39,389 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:39,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965806778] [2022-11-25 22:42:39,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965806778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:39,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:39,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 22:42:39,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336967913] [2022-11-25 22:42:39,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:39,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:42:39,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:39,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:42:39,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 22:42:39,401 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:42:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:39,420 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-11-25 22:42:39,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:42:39,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-25 22:42:39,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:39,427 INFO L225 Difference]: With dead ends: 46 [2022-11-25 22:42:39,427 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 22:42:39,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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-25 22:42:39,429 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:39,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:42:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 22:42:39,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-11-25 22:42:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:42:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-11-25 22:42:39,446 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2022-11-25 22:42:39,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:39,447 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-11-25 22:42:39,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 22:42:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-11-25 22:42:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 22:42:39,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:39,449 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:42:39,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 22:42:39,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:42:39,663 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:42:39,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:39,664 INFO L85 PathProgramCache]: Analyzing trace with hash 208174980, now seen corresponding path program 1 times [2022-11-25 22:42:39,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:39,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759498693] [2022-11-25 22:42:39,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:39,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:42:39,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:39,675 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:42:39,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 22:42:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:39,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:42:39,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:42:39,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:42:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 22:42:39,961 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:39,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759498693] [2022-11-25 22:42:39,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759498693] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:42:39,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1080453089] [2022-11-25 22:42:39,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:39,967 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:42:39,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:42:40,015 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:42:40,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-11-25 22:42:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:40,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 22:42:40,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 22:42:40,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:40,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1080453089] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:40,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 22:42:40,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2022-11-25 22:42:40,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051752990] [2022-11-25 22:42:40,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:40,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 22:42:40,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:40,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 22:42:40,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:42:40,245 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:42:40,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:40,298 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-11-25 22:42:40,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 22:42:40,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-11-25 22:42:40,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:40,300 INFO L225 Difference]: With dead ends: 41 [2022-11-25 22:42:40,300 INFO L226 Difference]: Without dead ends: 34 [2022-11-25 22:42:40,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:42:40,302 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:40,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 52 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:42:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-25 22:42:40,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2022-11-25 22:42:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:42:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-11-25 22:42:40,309 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 28 [2022-11-25 22:42:40,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:40,309 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-11-25 22:42:40,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 22:42:40,310 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-11-25 22:42:40,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 22:42:40,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:40,311 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:42:40,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 22:42:40,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2022-11-25 22:42:40,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 22:42:40,735 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:42:40,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:40,736 INFO L85 PathProgramCache]: Analyzing trace with hash 265433282, now seen corresponding path program 1 times [2022-11-25 22:42:40,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:40,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866434756] [2022-11-25 22:42:40,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:40,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:42:40,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:40,738 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:42:40,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 22:42:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:40,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:42:40,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:42:40,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:42:40,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 22:42:40,995 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:40,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866434756] [2022-11-25 22:42:40,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866434756] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:42:40,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1069250644] [2022-11-25 22:42:40,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:40,996 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:42:40,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:42:40,997 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:42:41,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-11-25 22:42:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:41,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:42:41,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:42:41,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:42:41,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 22:42:41,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1069250644] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:42:41,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958984445] [2022-11-25 22:42:41,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:41,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:42:41,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:42:41,289 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:42:41,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 22:42:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:41,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 22:42:41,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 22:42:41,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:42:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 22:42:41,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958984445] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:42:41,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:42:41,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 5] total 7 [2022-11-25 22:42:41,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779105681] [2022-11-25 22:42:41,560 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:42:41,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 22:42:41,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:41,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 22:42:41,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-25 22:42:41,564 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 22:42:41,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:41,683 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-11-25 22:42:41,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 22:42:41,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-11-25 22:42:41,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:41,684 INFO L225 Difference]: With dead ends: 59 [2022-11-25 22:42:41,684 INFO L226 Difference]: Without dead ends: 39 [2022-11-25 22:42:41,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:42:41,685 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:41,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 89 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:42:41,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-25 22:42:41,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-25 22:42:41,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:42:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2022-11-25 22:42:41,699 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 28 [2022-11-25 22:42:41,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:41,700 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-11-25 22:42:41,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 22:42:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-11-25 22:42:41,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 22:42:41,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:41,703 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:42:41,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-11-25 22:42:41,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 22:42:42,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 22:42:42,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:42:42,306 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:42:42,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:42,306 INFO L85 PathProgramCache]: Analyzing trace with hash -883753534, now seen corresponding path program 2 times [2022-11-25 22:42:42,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:42,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705492313] [2022-11-25 22:42:42,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:42:42,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:42:42,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:42,308 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:42:42,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 22:42:42,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 22:42:42,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:42:42,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 22:42:42,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 22:42:42,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:42:42,510 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:42,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705492313] [2022-11-25 22:42:42,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705492313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:42:42,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:42:42,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 22:42:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797571886] [2022-11-25 22:42:42,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:42:42,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 22:42:42,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:42,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 22:42:42,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 22:42:42,514 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:42:42,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:42:42,584 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-11-25 22:42:42,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 22:42:42,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-11-25 22:42:42,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:42:42,587 INFO L225 Difference]: With dead ends: 46 [2022-11-25 22:42:42,587 INFO L226 Difference]: Without dead ends: 38 [2022-11-25 22:42:42,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 22:42:42,588 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:42:42,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 56 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:42:42,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-25 22:42:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-25 22:42:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:42:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-11-25 22:42:42,607 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 37 [2022-11-25 22:42:42,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:42:42,607 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-11-25 22:42:42,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 22:42:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-11-25 22:42:42,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 22:42:42,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:42:42,610 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:42:42,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 22:42:42,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:42:42,824 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:42:42,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:42:42,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1457377551, now seen corresponding path program 1 times [2022-11-25 22:42:42,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:42:42,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432784278] [2022-11-25 22:42:42,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:42,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:42:42,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:42:42,826 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:42:42,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 22:42:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:43,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-25 22:42:43,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:43,420 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 6 treesize of output 5 [2022-11-25 22:42:43,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-25 22:42:44,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:44,032 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 22 treesize of output 22 [2022-11-25 22:42:44,583 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:42:44,584 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 26 treesize of output 27 [2022-11-25 22:42:45,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:45,253 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 22 treesize of output 22 [2022-11-25 22:42:45,473 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 23 treesize of output 11 [2022-11-25 22:42:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:42:45,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:42:46,552 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:46,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432784278] [2022-11-25 22:42:46,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432784278] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:42:46,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [420784303] [2022-11-25 22:42:46,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:46,553 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:42:46,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:42:46,558 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:42:46,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-11-25 22:42:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:46,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-25 22:42:46,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:47,995 INFO L321 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-11-25 22:42:47,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 57 [2022-11-25 22:42:48,041 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:42:48,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 56 [2022-11-25 22:42:48,097 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 38 treesize of output 32 [2022-11-25 22:42:48,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,622 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-25 22:42:48,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 71 [2022-11-25 22:42:48,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:48,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2022-11-25 22:42:51,258 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 114 treesize of output 98 [2022-11-25 22:42:51,316 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:42:51,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 89 [2022-11-25 22:42:51,793 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-25 22:42:51,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:42:51,947 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_469 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_469) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) (forall ((v_ArrVal_470 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_470) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))))) is different from false [2022-11-25 22:42:52,556 INFO L321 Elim1Store]: treesize reduction 21, result has 65.0 percent of original size [2022-11-25 22:42:52,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 79 [2022-11-25 22:42:52,591 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:42:52,592 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 172 treesize of output 163 [2022-11-25 22:42:52,605 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 114 treesize of output 110 [2022-11-25 22:42:52,618 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 110 treesize of output 102 [2022-11-25 22:42:52,705 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:42:52,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 78 [2022-11-25 22:42:52,726 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 20 treesize of output 18 [2022-11-25 22:42:53,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [420784303] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:42:53,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210163212] [2022-11-25 22:42:53,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:53,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:42:53,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:42:53,810 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:42:53,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 22:42:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:54,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-25 22:42:54,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:42:54,046 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 7 [2022-11-25 22:42:54,227 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 7 treesize of output 5 [2022-11-25 22:42:54,611 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 22:42:54,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 22:42:54,956 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 7 treesize of output 5 [2022-11-25 22:42:55,275 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-25 22:42:55,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-25 22:42:56,036 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 17 treesize of output 9 [2022-11-25 22:42:56,605 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:42:56,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2022-11-25 22:42:56,621 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 13 treesize of output 9 [2022-11-25 22:42:57,468 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:42:57,471 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 27 treesize of output 28 [2022-11-25 22:42:57,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:42:57,842 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 23 treesize of output 23 [2022-11-25 22:42:58,088 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 24 treesize of output 12 [2022-11-25 22:42:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:42:58,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:42:58,178 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-11-25 22:42:59,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210163212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:42:59,376 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:42:59,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 22] total 47 [2022-11-25 22:42:59,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488180715] [2022-11-25 22:42:59,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:42:59,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-25 22:42:59,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:42:59,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-25 22:42:59,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=3369, Unknown=151, NotChecked=242, Total=4032 [2022-11-25 22:42:59,380 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 47 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 38 states have internal predecessors, (73), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-25 22:43:12,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:43:12,171 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-11-25 22:43:12,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 22:43:12,172 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 38 states have internal predecessors, (73), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 38 [2022-11-25 22:43:12,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:43:12,173 INFO L225 Difference]: With dead ends: 63 [2022-11-25 22:43:12,174 INFO L226 Difference]: Without dead ends: 56 [2022-11-25 22:43:12,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1597 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=672, Invalid=5636, Unknown=180, NotChecked=318, Total=6806 [2022-11-25 22:43:12,177 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 271 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 34 mSolverCounterUnsat, 43 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 43 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-25 22:43:12,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 328 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 493 Invalid, 43 Unknown, 0 Unchecked, 4.5s Time] [2022-11-25 22:43:12,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-25 22:43:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2022-11-25 22:43:12,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:43:12,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-11-25 22:43:12,192 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 38 [2022-11-25 22:43:12,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:43:12,193 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-11-25 22:43:12,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.6590909090909092) internal successors, (73), 38 states have internal predecessors, (73), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-11-25 22:43:12,193 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-11-25 22:43:12,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-25 22:43:12,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:43:12,194 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:43:12,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:12,426 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:12,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-11-25 22:43:12,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 22:43:12,802 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:43:12,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:43:12,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1457379225, now seen corresponding path program 1 times [2022-11-25 22:43:12,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:43:12,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775659726] [2022-11-25 22:43:12,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:12,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:43:12,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:43:12,806 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:43:12,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-25 22:43:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:13,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-25 22:43:13,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:13,228 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 7 [2022-11-25 22:43:13,298 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-25 22:43:13,446 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 6 treesize of output 5 [2022-11-25 22:43:13,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:13,461 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 21 treesize of output 20 [2022-11-25 22:43:13,781 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 30 treesize of output 18 [2022-11-25 22:43:13,788 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 7 treesize of output 5 [2022-11-25 22:43:13,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:43:13,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:43:14,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,164 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 34 [2022-11-25 22:43:14,212 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 22:43:14,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-25 22:43:14,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:43:14,245 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-25 22:43:14,245 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 17 treesize of output 17 [2022-11-25 22:43:14,290 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:43:14,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 22:43:14,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:43:14,909 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:43:14,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2022-11-25 22:43:14,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:14,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-11-25 22:43:14,963 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 22:43:14,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-25 22:43:14,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:43:15,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,314 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 33 treesize of output 31 [2022-11-25 22:43:15,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 22:43:15,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:15,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:43:15,632 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 34 treesize of output 18 [2022-11-25 22:43:15,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:43:15,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:43:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:43:15,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:16,067 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_617) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_619) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_618) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-25 22:43:20,202 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:43:20,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775659726] [2022-11-25 22:43:20,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775659726] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:43:20,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1794357364] [2022-11-25 22:43:20,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:20,203 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:43:20,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:43:20,204 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:43:20,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-11-25 22:43:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:20,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-25 22:43:20,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:20,938 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 7 [2022-11-25 22:43:20,991 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-25 22:43:21,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:21,279 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 21 treesize of output 20 [2022-11-25 22:43:22,076 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 30 treesize of output 18 [2022-11-25 22:43:22,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:43:22,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:43:22,101 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 7 treesize of output 5 [2022-11-25 22:43:22,412 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2022-11-25 22:43:22,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:22,771 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 34 [2022-11-25 22:43:22,810 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-25 22:43:22,810 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 17 treesize of output 17 [2022-11-25 22:43:22,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 22:43:22,869 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:43:22,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 22:43:22,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:43:24,144 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:43:24,145 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 87 treesize of output 78 [2022-11-25 22:43:24,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2022-11-25 22:43:24,213 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-25 22:43:24,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2022-11-25 22:43:24,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,795 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 33 treesize of output 31 [2022-11-25 22:43:24,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-25 22:43:24,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:24,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:43:25,431 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 34 treesize of output 18 [2022-11-25 22:43:25,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:43:25,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 22:43:25,737 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:43:25,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:25,772 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_709 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) v_ArrVal_709)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_710) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-25 22:43:27,832 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (_ BitVec 32)) (v_ArrVal_705 (_ BitVec 32)) (v_ArrVal_708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_704 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_709 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse1 v_ArrVal_706)))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) v_ArrVal_709))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_704) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_708) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse1 v_ArrVal_705)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_710) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-25 22:43:39,544 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:43:39,545 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 160 [2022-11-25 22:43:46,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1794357364] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:43:46,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141903172] [2022-11-25 22:43:46,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:43:46,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:43:46,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:43:46,557 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:43:46,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 22:43:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:43:46,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-25 22:43:46,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:46,816 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 7 [2022-11-25 22:43:47,198 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 7 treesize of output 5 [2022-11-25 22:43:47,589 WARN L859 $PredicateComparison]: unable to prove that (and (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((v_ArrVal_785 (_ BitVec 1)) (|node_create_~temp~0#1.base| (_ BitVec 32))) (and (= (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_785) |c_#valid|) (= (_ bv0 1) (select |c_old(#valid)| |node_create_~temp~0#1.base|))))) is different from true [2022-11-25 22:43:47,721 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:43:47,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:43:47,818 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 7 treesize of output 5 [2022-11-25 22:43:48,343 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-25 22:43:48,985 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:43:48,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:43:49,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:49,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 22:43:50,983 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 20 treesize of output 12 [2022-11-25 22:43:50,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:43:51,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-25 22:43:51,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:51,747 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 37 treesize of output 35 [2022-11-25 22:43:51,807 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 22:43:51,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2022-11-25 22:43:51,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:43:51,915 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-25 22:43:51,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2022-11-25 22:43:51,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:43:54,124 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:43:54,125 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 73 treesize of output 66 [2022-11-25 22:43:54,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:54,140 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 37 treesize of output 32 [2022-11-25 22:43:54,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 22:43:57,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:57,224 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 34 treesize of output 32 [2022-11-25 22:43:57,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 22:43:57,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:43:57,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:43:58,305 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 19 [2022-11-25 22:43:58,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:43:59,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:43:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2022-11-25 22:43:59,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:43:59,050 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_801) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_799) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-25 22:44:13,967 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_797 (_ BitVec 32)) (v_ArrVal_798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_800 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_801 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)) v_ArrVal_797)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_801) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_796) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_799) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_798) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_800) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-25 22:44:20,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141903172] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:44:20,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:44:20,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 50 [2022-11-25 22:44:20,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488674191] [2022-11-25 22:44:20,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:44:20,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-25 22:44:20,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:44:20,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 22:44:20,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=3245, Unknown=166, NotChecked=738, Total=4422 [2022-11-25 22:44:20,380 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 50 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 41 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-25 22:44:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:43,654 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-11-25 22:44:43,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 22:44:43,656 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 41 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) Word has length 38 [2022-11-25 22:44:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:43,657 INFO L225 Difference]: With dead ends: 53 [2022-11-25 22:44:43,658 INFO L226 Difference]: Without dead ends: 51 [2022-11-25 22:44:43,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 73.1s TimeCoverageRelationStatistics Valid=605, Invalid=4953, Unknown=166, NotChecked=918, Total=6642 [2022-11-25 22:44:43,660 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 217 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 45 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:43,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 304 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 702 Invalid, 11 Unknown, 41 Unchecked, 8.9s Time] [2022-11-25 22:44:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-25 22:44:43,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2022-11-25 22:44:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:44:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2022-11-25 22:44:43,706 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 38 [2022-11-25 22:44:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:43,707 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2022-11-25 22:44:43,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 41 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (9), 9 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-25 22:44:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-11-25 22:44:43,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 22:44:43,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:43,711 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:44:43,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-25 22:44:43,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 22:44:44,144 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-11-25 22:44:44,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-25 22:44:44,340 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:44:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1501962780, now seen corresponding path program 2 times [2022-11-25 22:44:44,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:44:44,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102932082] [2022-11-25 22:44:44,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:44:44,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:44:44,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:44:44,342 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:44:44,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-25 22:44:44,554 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:44:44,554 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:44:44,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:44:44,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 22:44:44,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:44:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 22:44:45,714 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:44:45,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102932082] [2022-11-25 22:44:45,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102932082] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:44:45,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [307862391] [2022-11-25 22:44:45,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:44:45,714 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:44:45,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:44:45,715 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:44:45,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-25 22:44:46,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:44:46,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:44:46,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:44:46,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 22:44:46,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:44:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 22:44:46,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [307862391] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:44:46,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256082094] [2022-11-25 22:44:46,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 22:44:46,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:44:46,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:44:46,889 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:44:46,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 22:44:47,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 22:44:47,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 22:44:47,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 22:44:47,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 22:44:47,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:44:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 22:44:48,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256082094] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 22:44:48,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-25 22:44:48,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-11-25 22:44:48,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607891657] [2022-11-25 22:44:48,281 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-25 22:44:48,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 22:44:48,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:44:48,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 22:44:48,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 22:44:48,283 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 22:44:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:44:48,439 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-11-25 22:44:48,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 22:44:48,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 39 [2022-11-25 22:44:48,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:44:48,441 INFO L225 Difference]: With dead ends: 49 [2022-11-25 22:44:48,441 INFO L226 Difference]: Without dead ends: 40 [2022-11-25 22:44:48,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-25 22:44:48,442 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 22:44:48,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 104 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 22:44:48,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-25 22:44:48,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-25 22:44:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:44:48,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-11-25 22:44:48,466 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 39 [2022-11-25 22:44:48,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:44:48,466 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-11-25 22:44:48,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 22:44:48,467 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-11-25 22:44:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 22:44:48,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:44:48,468 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:44:48,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-25 22:44:48,690 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-25 22:44:48,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-25 22:44:49,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:44:49,088 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:44:49,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:44:49,088 INFO L85 PathProgramCache]: Analyzing trace with hash 382129514, now seen corresponding path program 1 times [2022-11-25 22:44:49,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:44:49,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087216189] [2022-11-25 22:44:49,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:44:49,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:44:49,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:44:49,091 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:44:49,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-25 22:44:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:44:49,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-25 22:44:49,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:44:49,577 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 7 [2022-11-25 22:44:49,896 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 6 treesize of output 5 [2022-11-25 22:44:50,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 22:44:50,371 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 7 treesize of output 5 [2022-11-25 22:44:50,662 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 6 treesize of output 5 [2022-11-25 22:44:50,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:44:50,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-25 22:44:50,989 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-25 22:44:50,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-11-25 22:44:51,794 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-25 22:44:51,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 37 [2022-11-25 22:44:51,909 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 22:44:51,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 38 [2022-11-25 22:44:51,927 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 15 treesize of output 13 [2022-11-25 22:44:52,388 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-25 22:44:52,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 88 [2022-11-25 22:44:52,463 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:44:52,464 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 78 treesize of output 77 [2022-11-25 22:44:52,977 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 65 treesize of output 49 [2022-11-25 22:44:53,240 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-11-25 22:44:53,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 21 [2022-11-25 22:44:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:44:53,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:44:54,327 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1068))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32)))) is different from false [2022-11-25 22:44:54,364 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1068))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1064) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32)))) is different from false [2022-11-25 22:44:56,184 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:44:56,185 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 6502 treesize of output 6226 [2022-11-25 22:44:56,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:44:56,301 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 6214 treesize of output 6079 [2022-11-25 22:44:56,333 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 6070 treesize of output 6038 [2022-11-25 22:44:56,374 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 6038 treesize of output 5974 [2022-11-25 22:44:59,974 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_sll_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse24 (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_124 (_ BitVec 32)) (v_arrayElimCell_126 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (select v_ArrVal_1074 |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse46)) (not (= (select (let ((.cse47 (store (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_ArrVal_1074))) (store .cse48 .cse46 (store (select .cse48 .cse46) (bvadd v_arrayElimCell_124 (_ bv4 32)) |c_ULTIMATE.start_sll_insert_~head#1.base|))) |c_ULTIMATE.start_sll_insert_~head#1.base| v_ArrVal_1068))) (select .cse47 (select (select .cse47 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_126 (_ bv4 32))) (_ bv0 32))))))) (.cse38 (not .cse9)) (.cse20 (not (= (select |c_#valid| |c_ULTIMATE.start_sll_insert_~head#1.base|) (_ bv0 1)))) (.cse21 (not (bvult |c_ULTIMATE.start_sll_insert_~head#1.base| |c_#StackHeapBarrier|))) (.cse22 (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_124 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse43 (select v_ArrVal_1074 |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse43) (not (= (select (let ((.cse44 (store (let ((.cse45 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_ArrVal_1074))) (store .cse45 .cse43 (store (select .cse45 .cse43) (bvadd v_arrayElimCell_124 (_ bv4 32)) |c_ULTIMATE.start_sll_insert_~head#1.base|))) |c_ULTIMATE.start_sll_insert_~head#1.base| v_ArrVal_1068))) (select .cse44 (select (select .cse44 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_122 (_ bv4 32))) (_ bv0 32))))))) (.cse23 (= |c_ULTIMATE.start_sll_insert_~head#1.base| (_ bv0 32)))) (let ((.cse5 (or .cse9 .cse20 .cse21 .cse22 .cse23)) (.cse8 (or .cse38 (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_124 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_127 (_ BitVec 32))) (let ((.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1074))) (let ((.cse42 (select (select .cse41 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (select (select (store (store .cse41 .cse42 (store (select .cse41 .cse42) (bvadd v_arrayElimCell_124 (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1068) (select v_ArrVal_1068 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd v_arrayElimCell_127 (_ bv4 32))) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse42)))))))) (.cse12 (or .cse38 (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_124 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_127 (_ BitVec 32))) (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1074))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (select (select (store (store .cse39 .cse40 (store (select .cse39 .cse40) (bvadd v_arrayElimCell_124 (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1068) (select v_ArrVal_1068 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd v_arrayElimCell_127 (_ bv4 32))) (_ bv0 32))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse40))))))) (.cse14 (or .cse24 .cse9 .cse20 .cse21 .cse23)) (.cse6 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 1)))) (.cse7 (not (bvult |c_ULTIMATE.start_main_~#s~0#1.base| |c_#StackHeapBarrier|))) (.cse13 (= |c_ULTIMATE.start_main_~#s~0#1.base| (_ bv0 32))) (.cse10 (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_123 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_127 (_ BitVec 32))) (let ((.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1074))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (_ bv0 32) (select (select (store (store .cse36 .cse37 (store (select .cse36 .cse37) (bvadd v_arrayElimCell_123 (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1068) (select v_ArrVal_1068 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd v_arrayElimCell_127 (_ bv4 32))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse37)))))) (.cse11 (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_123 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_127 (_ BitVec 32))) (let ((.cse34 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1074))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (_ bv0 32) (select (select (store (store .cse34 .cse35 (store (select .cse34 .cse35) (bvadd v_arrayElimCell_123 (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1068) (select v_ArrVal_1068 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd v_arrayElimCell_127 (_ bv4 32))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse35))))))) (.cse4 (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_insert_~head#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|) (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_123 (_ BitVec 32)) (v_arrayElimCell_126 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| v_ArrVal_1074))) (let ((.cse33 (select (select .cse32 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (select (let ((.cse31 (store (store .cse32 .cse33 (store (select .cse32 .cse33) (bvadd v_arrayElimCell_123 (_ bv4 32)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| v_ArrVal_1068))) (select .cse31 (select (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_126 (_ bv4 32))) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse33)))))) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|)))))) (.cse15 (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_insert_~head#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_123 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse30 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| v_ArrVal_1074))) (let ((.cse28 (select (select .cse30 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse28) (not (= (select (let ((.cse29 (store (store .cse30 .cse28 (store (select .cse30 .cse28) (bvadd v_arrayElimCell_123 (_ bv4 32)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| v_ArrVal_1068))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_122 (_ bv4 32))) (_ bv0 32))))))) (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|))))))) (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_insert_~head#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|))) (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| v_ArrVal_1074))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0) (not (= (let ((.cse3 (bvadd v_arrayElimCell_122 (_ bv4 32)))) (select (let ((.cse1 (store (store .cse2 .cse0 (store (select .cse2 .cse0) .cse3 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| v_ArrVal_1068))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3)) (_ bv0 32))))))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_insert_~head#1.offset|) (and .cse4 .cse5 (or .cse6 .cse7 (and .cse8 (or .cse9 .cse10) (or .cse9 .cse11) .cse12) .cse13) .cse14 .cse15)) .cse5 (or .cse6 .cse7 .cse13 (and .cse8 .cse12 (or .cse9 (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1074))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (select (select (store (store .cse16 .cse17 (store (select .cse16 .cse17) (bvadd v_arrayElimCell_122 (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1068) (select v_ArrVal_1068 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd v_arrayElimCell_127 (_ bv4 32))) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse17))))))) (or .cse9 (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1074))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse18) (not (= (select (select (store (store .cse19 .cse18 (store (select .cse19 .cse18) (bvadd v_arrayElimCell_122 (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1068) (select v_ArrVal_1068 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd v_arrayElimCell_127 (_ bv4 32))) (_ bv0 32)))))))))) .cse14 (or .cse9 (and (or .cse6 .cse7 .cse13 (and .cse10 .cse11)) .cse4 (or .cse20 .cse21 .cse22 .cse23) (or .cse24 .cse20 .cse21 .cse23) .cse15)) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_insert_~head#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|) (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_126 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse26 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| v_ArrVal_1074))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (_ bv0 32) (select (let ((.cse25 (store (store .cse26 .cse27 (store (select .cse26 .cse27) (bvadd v_arrayElimCell_122 (_ bv4 32)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| v_ArrVal_1068))) (select .cse25 (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_126 (_ bv4 32))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse27)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|))))))))) is different from false [2022-11-25 22:45:01,998 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_sll_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse24 (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_124 (_ BitVec 32)) (v_arrayElimCell_126 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (select v_ArrVal_1074 |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse46)) (not (= (select (let ((.cse47 (store (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_ArrVal_1074))) (store .cse48 .cse46 (store (select .cse48 .cse46) (bvadd v_arrayElimCell_124 (_ bv4 32)) |c_ULTIMATE.start_sll_insert_~head#1.base|))) |c_ULTIMATE.start_sll_insert_~head#1.base| v_ArrVal_1068))) (select .cse47 (select (select .cse47 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_126 (_ bv4 32))) (_ bv0 32))))))) (.cse38 (not .cse9)) (.cse20 (not (= (select |c_#valid| |c_ULTIMATE.start_sll_insert_~head#1.base|) (_ bv0 1)))) (.cse21 (not (bvult |c_ULTIMATE.start_sll_insert_~head#1.base| |c_#StackHeapBarrier|))) (.cse22 (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_124 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse43 (select v_ArrVal_1074 |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse43) (not (= (select (let ((.cse44 (store (let ((.cse45 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base| v_ArrVal_1074))) (store .cse45 .cse43 (store (select .cse45 .cse43) (bvadd v_arrayElimCell_124 (_ bv4 32)) |c_ULTIMATE.start_sll_insert_~head#1.base|))) |c_ULTIMATE.start_sll_insert_~head#1.base| v_ArrVal_1068))) (select .cse44 (select (select .cse44 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_122 (_ bv4 32))) (_ bv0 32))))))) (.cse23 (= |c_ULTIMATE.start_sll_insert_~head#1.base| (_ bv0 32)))) (let ((.cse5 (or .cse9 .cse20 .cse21 .cse22 .cse23)) (.cse8 (or .cse38 (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_124 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_127 (_ BitVec 32))) (let ((.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1074))) (let ((.cse42 (select (select .cse41 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (select (select (store (store .cse41 .cse42 (store (select .cse41 .cse42) (bvadd v_arrayElimCell_124 (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1068) (select v_ArrVal_1068 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd v_arrayElimCell_127 (_ bv4 32))) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse42)))))))) (.cse12 (or .cse38 (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_124 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_127 (_ BitVec 32))) (let ((.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1074))) (let ((.cse40 (select (select .cse39 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (select (select (store (store .cse39 .cse40 (store (select .cse39 .cse40) (bvadd v_arrayElimCell_124 (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1068) (select v_ArrVal_1068 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd v_arrayElimCell_127 (_ bv4 32))) (_ bv0 32))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse40))))))) (.cse14 (or .cse24 .cse9 .cse20 .cse21 .cse23)) (.cse6 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) (_ bv0 1)))) (.cse7 (not (bvult |c_ULTIMATE.start_main_~#s~0#1.base| |c_#StackHeapBarrier|))) (.cse13 (= |c_ULTIMATE.start_main_~#s~0#1.base| (_ bv0 32))) (.cse10 (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_123 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_127 (_ BitVec 32))) (let ((.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1074))) (let ((.cse37 (select (select .cse36 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (_ bv0 32) (select (select (store (store .cse36 .cse37 (store (select .cse36 .cse37) (bvadd v_arrayElimCell_123 (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1068) (select v_ArrVal_1068 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd v_arrayElimCell_127 (_ bv4 32))))) (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse37)))))) (.cse11 (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_123 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_127 (_ BitVec 32))) (let ((.cse34 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1074))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (_ bv0 32) (select (select (store (store .cse34 .cse35 (store (select .cse34 .cse35) (bvadd v_arrayElimCell_123 (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1068) (select v_ArrVal_1068 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd v_arrayElimCell_127 (_ bv4 32))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse35))))))) (.cse4 (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_insert_~head#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|) (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_123 (_ BitVec 32)) (v_arrayElimCell_126 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse32 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| v_ArrVal_1074))) (let ((.cse33 (select (select .cse32 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (select (let ((.cse31 (store (store .cse32 .cse33 (store (select .cse32 .cse33) (bvadd v_arrayElimCell_123 (_ bv4 32)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| v_ArrVal_1068))) (select .cse31 (select (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_126 (_ bv4 32))) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse33)))))) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|)))))) (.cse15 (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_insert_~head#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_123 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse30 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| v_ArrVal_1074))) (let ((.cse28 (select (select .cse30 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse28) (not (= (select (let ((.cse29 (store (store .cse30 .cse28 (store (select .cse30 .cse28) (bvadd v_arrayElimCell_123 (_ bv4 32)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| v_ArrVal_1068))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_122 (_ bv4 32))) (_ bv0 32))))))) (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|))))))) (and (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_insert_~head#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|))) (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| v_ArrVal_1074))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0) (not (= (let ((.cse3 (bvadd v_arrayElimCell_122 (_ bv4 32)))) (select (let ((.cse1 (store (store .cse2 .cse0 (store (select .cse2 .cse0) .cse3 |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| v_ArrVal_1068))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse3)) (_ bv0 32))))))))) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_insert_~head#1.offset|) (and .cse4 .cse5 (or .cse6 .cse7 (and .cse8 (or .cse9 .cse10) (or .cse9 .cse11) .cse12) .cse13) .cse14 .cse15)) .cse5 (or .cse6 .cse7 .cse13 (and .cse8 .cse12 (or .cse9 (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1074))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (select (select (store (store .cse16 .cse17 (store (select .cse16 .cse17) (bvadd v_arrayElimCell_122 (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1068) (select v_ArrVal_1068 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd v_arrayElimCell_127 (_ bv4 32))) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse17))))))) (or .cse9 (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_127 (_ BitVec 32)) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1074))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse18) (not (= (select (select (store (store .cse19 .cse18 (store (select .cse19 .cse18) (bvadd v_arrayElimCell_122 (_ bv4 32)) |c_ULTIMATE.start_main_~#s~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base| v_ArrVal_1068) (select v_ArrVal_1068 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd v_arrayElimCell_127 (_ bv4 32))) (_ bv0 32)))))))))) .cse14 (or .cse9 (and (or .cse6 .cse7 .cse13 (and .cse10 .cse11)) .cse4 (or .cse20 .cse21 .cse22 .cse23) (or .cse24 .cse20 .cse21 .cse23) .cse15)) (forall ((|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| (_ BitVec 32))) (or (= |c_ULTIMATE.start_sll_insert_~head#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|) (not (bvult |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| |c_#StackHeapBarrier|)) (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#s~0#1.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|) (forall ((v_ArrVal_1074 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_126 (_ BitVec 32)) (v_ArrVal_1068 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_122 (_ BitVec 32))) (let ((.cse26 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| v_ArrVal_1074))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (or (not (= (_ bv0 32) (select (let ((.cse25 (store (store .cse26 .cse27 (store (select .cse26 .cse27) (bvadd v_arrayElimCell_122 (_ bv4 32)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47| v_ArrVal_1068))) (select .cse25 (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd v_arrayElimCell_126 (_ bv4 32))))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse27)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_47|))))))))) is different from true [2022-11-25 22:45:02,004 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:45:02,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087216189] [2022-11-25 22:45:02,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087216189] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:45:02,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1278362433] [2022-11-25 22:45:02,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:02,005 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:45:02,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:45:02,006 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:45:02,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-25 22:45:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:02,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-25 22:45:02,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:03,027 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 7 [2022-11-25 22:45:05,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 22:45:05,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:45:05,201 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 7 treesize of output 5 [2022-11-25 22:45:06,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:06,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-25 22:45:06,395 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-25 22:45:06,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-11-25 22:45:06,482 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:45:06,483 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 14 treesize of output 20 [2022-11-25 22:45:06,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:45:08,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:08,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-11-25 22:45:08,484 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-25 22:45:08,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 43 [2022-11-25 22:45:08,521 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 17 [2022-11-25 22:45:09,226 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-25 22:45:09,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 88 [2022-11-25 22:45:09,296 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:45:09,296 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 85 treesize of output 82 [2022-11-25 22:45:10,014 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 72 treesize of output 52 [2022-11-25 22:45:10,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:10,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 21 [2022-11-25 22:45:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:45:10,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:10,793 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1144))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32)))) is different from false [2022-11-25 22:45:10,837 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1144))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1140) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32)))) is different from false [2022-11-25 22:45:10,899 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1144 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1143 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (bvadd |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1144))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1140) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32)))) is different from false [2022-11-25 22:45:13,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1278362433] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:45:13,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121295259] [2022-11-25 22:45:13,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:13,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:45:13,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:45:13,598 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:45:13,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-25 22:45:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:13,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-25 22:45:13,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:13,894 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 7 [2022-11-25 22:45:15,086 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-25 22:45:15,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-25 22:45:16,650 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-11-25 22:45:16,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2022-11-25 22:45:19,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:19,831 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 34 treesize of output 32 [2022-11-25 22:45:19,966 INFO L321 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2022-11-25 22:45:19,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 35 [2022-11-25 22:45:20,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 22:45:21,581 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-25 22:45:21,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 38 [2022-11-25 22:45:21,608 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 35 treesize of output 35 [2022-11-25 22:45:22,184 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-25 22:45:22,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 90 [2022-11-25 22:45:22,234 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 22:45:22,234 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 86 treesize of output 83 [2022-11-25 22:45:22,768 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 73 treesize of output 53 [2022-11-25 22:45:23,267 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 22:45:23,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 23 [2022-11-25 22:45:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 22:45:23,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:23,332 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1222 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1222))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv0 32)))) is different from false [2022-11-25 22:45:23,367 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1220 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1222))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1220) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))))) is different from false [2022-11-25 22:45:25,008 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1220 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1222))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1220) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-25 22:45:25,365 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1221 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1220 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_sll_insert_#t~ret7#1.base_53| (_ BitVec 32)) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1228 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_53| v_ArrVal_1227))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_53| v_ArrVal_1228)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (let ((.cse0 (store (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_53|)) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_53| v_ArrVal_1222))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 32) (select (select (store (store .cse3 .cse2 v_ArrVal_1220) |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_53| v_ArrVal_1221) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (_ bv0 32))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_53|) (_ bv0 1))) (= |v_ULTIMATE.start_sll_insert_#t~ret7#1.base_53| (_ bv0 32)))) is different from false [2022-11-25 22:45:25,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121295259] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:45:25,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 22:45:25,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 25] total 60 [2022-11-25 22:45:25,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434094902] [2022-11-25 22:45:25,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 22:45:25,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-25 22:45:25,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:45:25,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-25 22:45:25,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=4068, Unknown=137, NotChecked=1390, Total=5852 [2022-11-25 22:45:25,384 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 60 states, 57 states have (on average 1.543859649122807) internal successors, (88), 49 states have internal predecessors, (88), 7 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-25 22:45:48,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:45:48,823 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-11-25 22:45:48,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-25 22:45:48,825 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 57 states have (on average 1.543859649122807) internal successors, (88), 49 states have internal predecessors, (88), 7 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Word has length 40 [2022-11-25 22:45:48,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:45:48,826 INFO L225 Difference]: With dead ends: 48 [2022-11-25 22:45:48,826 INFO L226 Difference]: Without dead ends: 45 [2022-11-25 22:45:48,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 2018 ImplicationChecksByTransitivity, 38.5s TimeCoverageRelationStatistics Valid=651, Invalid=6390, Unknown=139, NotChecked=1750, Total=8930 [2022-11-25 22:45:48,829 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 188 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 27 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-11-25 22:45:48,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 529 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 843 Invalid, 4 Unknown, 0 Unchecked, 9.0s Time] [2022-11-25 22:45:48,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-25 22:45:48,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2022-11-25 22:45:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 22:45:48,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-11-25 22:45:48,849 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 40 [2022-11-25 22:45:48,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:45:48,850 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-11-25 22:45:48,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 57 states have (on average 1.543859649122807) internal successors, (88), 49 states have internal predecessors, (88), 7 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-25 22:45:48,850 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-11-25 22:45:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 22:45:48,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:45:48,851 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:45:48,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-25 22:45:49,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-25 22:45:49,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-25 22:45:49,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:45:49,453 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:45:49,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:45:49,454 INFO L85 PathProgramCache]: Analyzing trace with hash 382131188, now seen corresponding path program 1 times [2022-11-25 22:45:49,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:45:49,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779476506] [2022-11-25 22:45:49,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:45:49,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 22:45:49,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:45:49,456 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 22:45:49,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a60c425-b696-4378-b3b6-bbb1122f1f2d/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-25 22:45:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:45:49,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-25 22:45:49,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:45:50,163 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 7 [2022-11-25 22:45:50,578 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 6 treesize of output 5 [2022-11-25 22:45:51,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-25 22:45:51,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-25 22:45:51,201 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 7 treesize of output 5 [2022-11-25 22:45:51,606 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-25 22:45:51,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:51,930 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 25 treesize of output 25 [2022-11-25 22:45:52,006 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-25 22:45:52,007 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 17 treesize of output 17 [2022-11-25 22:45:52,105 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 22:45:52,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 22:45:52,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:45:53,201 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-11-25 22:45:53,201 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 76 treesize of output 54 [2022-11-25 22:45:53,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-25 22:45:53,318 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-25 22:45:53,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 40 [2022-11-25 22:45:53,709 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-25 22:45:53,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 93 [2022-11-25 22:45:53,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:53,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2022-11-25 22:45:53,811 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-11-25 22:45:53,811 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 33 treesize of output 50 [2022-11-25 22:45:53,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 22:45:54,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 22:45:54,882 INFO L321 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-11-25 22:45:54,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 47 [2022-11-25 22:45:54,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 22:45:54,956 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 22:45:54,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-11-25 22:45:55,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 22:45:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 22:45:55,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:45:56,506 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1302)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1304))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) v_ArrVal_1305)) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-25 22:45:56,630 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1302)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1304))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1301))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) v_ArrVal_1305))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-25 22:45:56,832 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (bvadd |c_ULTIMATE.start_sll_insert_~last~0#1.offset| (_ bv4 32)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1302)) (.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) .cse5 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1304))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1301))) (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|) v_ArrVal_1305))) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-11-25 22:45:57,084 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1304 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse6 (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) (_ bv4 32)))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1302)) (.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse6 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1304))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_1301))) (store .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|) v_ArrVal_1305))) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4))))))) is different from false [2022-11-25 22:45:57,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:57,984 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 319 treesize of output 312 [2022-11-25 22:45:58,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:45:58,113 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 3128 treesize of output 2992 [2022-11-25 22:45:58,200 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 3400 treesize of output 2856 [2022-11-25 22:46:02,125 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 995 treesize of output 723 [2022-11-25 22:48:02,605 WARN L233 SmtUtils]: Spent 2.00m on a formula simplification that was a NOOP. DAG size: 159 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-25 22:48:02,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 22:48:02,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1985 treesize of output 3527