./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh --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-2329fc7 [2022-12-14 07:35:49,562 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:35:49,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:35:49,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:35:49,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:35:49,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:35:49,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:35:49,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:35:49,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:35:49,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:35:49,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:35:49,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:35:49,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:35:49,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:35:49,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:35:49,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:35:49,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:35:49,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:35:49,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:35:49,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:35:49,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:35:49,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:35:49,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:35:49,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:35:49,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:35:49,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:35:49,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:35:49,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:35:49,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:35:49,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:35:49,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:35:49,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:35:49,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:35:49,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:35:49,611 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:35:49,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:35:49,612 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:35:49,612 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:35:49,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:35:49,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:35:49,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:35:49,614 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 07:35:49,635 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:35:49,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:35:49,635 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:35:49,635 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:35:49,636 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:35:49,636 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:35:49,636 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:35:49,636 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:35:49,637 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:35:49,637 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 07:35:49,637 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:35:49,637 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:35:49,637 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 07:35:49,637 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 07:35:49,637 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:35:49,638 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 07:35:49,638 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 07:35:49,638 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 07:35:49,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:35:49,639 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:35:49,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:35:49,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:35:49,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:35:49,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 07:35:49,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:35:49,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 07:35:49,640 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:35:49,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 07:35:49,640 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:35:49,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 07:35:49,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:35:49,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:35:49,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:35:49,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:35:49,641 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 07:35:49,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:35:49,641 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 07:35:49,642 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 07:35:49,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 07:35:49,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 07:35:49,642 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:35:49,642 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_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh 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-12-14 07:35:49,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:35:49,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:35:49,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:35:49,852 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:35:49,853 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:35:49,854 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-12-14 07:35:52,419 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:35:52,612 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:35:52,613 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-12-14 07:35:52,623 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/data/4541b5bc9/3c35b09c301843f3add177d79eeec781/FLAG5b5a231c0 [2022-12-14 07:35:52,637 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/data/4541b5bc9/3c35b09c301843f3add177d79eeec781 [2022-12-14 07:35:52,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:35:52,641 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:35:52,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:35:52,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:35:52,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:35:52,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:35:52" (1/1) ... [2022-12-14 07:35:52,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262540f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:35:52, skipping insertion in model container [2022-12-14 07:35:52,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:35:52" (1/1) ... [2022-12-14 07:35:52,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:35:52,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:35:52,871 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_a966f981-1abe-44e2-9c94-43bb4641d1c2/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-12-14 07:35:52,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:35:52,882 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:35:52,912 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_a966f981-1abe-44e2-9c94-43bb4641d1c2/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-12-14 07:35:52,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:35:52,929 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:35:52,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:35:52 WrapperNode [2022-12-14 07:35:52,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:35:52,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:35:52,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:35:52,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:35:52,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:35:52" (1/1) ... [2022-12-14 07:35:52,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:35:52" (1/1) ... [2022-12-14 07:35:52,959 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-12-14 07:35:52,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:35:52,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:35:52,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:35:52,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:35:52,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:35:52" (1/1) ... [2022-12-14 07:35:52,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:35:52" (1/1) ... [2022-12-14 07:35:52,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:35:52" (1/1) ... [2022-12-14 07:35:52,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:35:52" (1/1) ... [2022-12-14 07:35:52,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:35:52" (1/1) ... [2022-12-14 07:35:52,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:35:52" (1/1) ... [2022-12-14 07:35:52,978 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:35:52" (1/1) ... [2022-12-14 07:35:52,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:35:52" (1/1) ... [2022-12-14 07:35:52,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:35:52,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:35:52,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:35:52,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:35:52,983 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:35:52" (1/1) ... [2022-12-14 07:35:52,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:35:52,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:35:53,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:35:53,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:35:53,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 07:35:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 07:35:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-14 07:35:53,047 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-14 07:35:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 07:35:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:35:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 07:35:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 07:35:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 07:35:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 07:35:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 07:35:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 07:35:53,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:35:53,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:35:53,136 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:35:53,138 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:35:53,298 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:35:53,378 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:35:53,379 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 07:35:53,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:35:53 BoogieIcfgContainer [2022-12-14 07:35:53,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:35:53,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:35:53,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:35:53,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:35:53,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:35:52" (1/3) ... [2022-12-14 07:35:53,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774e89c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:35:53, skipping insertion in model container [2022-12-14 07:35:53,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:35:52" (2/3) ... [2022-12-14 07:35:53,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774e89c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:35:53, skipping insertion in model container [2022-12-14 07:35:53,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:35:53" (3/3) ... [2022-12-14 07:35:53,389 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2022-12-14 07:35:53,406 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:35:53,406 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 07:35:53,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:35:53,452 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;@48f2fbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:35:53,453 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 07:35:53,457 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-12-14 07:35:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 07:35:53,463 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:35:53,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:35:53,464 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:35:53,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:35:53,468 INFO L85 PathProgramCache]: Analyzing trace with hash -840701354, now seen corresponding path program 1 times [2022-12-14 07:35:53,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:35:53,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820783103] [2022-12-14 07:35:53,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:35:53,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:35:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:35:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:35:53,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:35:53,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820783103] [2022-12-14 07:35:53,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820783103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:35:53,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:35:53,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:35:53,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259468814] [2022-12-14 07:35:53,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:35:53,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:35:53,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:35:53,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:35:53,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:35:53,773 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-12-14 07:35:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:35:53,835 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-12-14 07:35:53,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:35:53,837 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-12-14 07:35:53,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:35:53,842 INFO L225 Difference]: With dead ends: 37 [2022-12-14 07:35:53,842 INFO L226 Difference]: Without dead ends: 18 [2022-12-14 07:35:53,843 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-12-14 07:35:53,846 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-12-14 07:35:53,847 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-12-14 07:35:53,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-14 07:35:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-12-14 07:35:53,870 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-12-14 07:35:53,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-12-14 07:35:53,871 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2022-12-14 07:35:53,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:35:53,872 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-12-14 07:35:53,872 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-12-14 07:35:53,872 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-12-14 07:35:53,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 07:35:53,873 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:35:53,873 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:35:53,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 07:35:53,873 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:35:53,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:35:53,874 INFO L85 PathProgramCache]: Analyzing trace with hash 119792004, now seen corresponding path program 1 times [2022-12-14 07:35:53,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:35:53,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797521033] [2022-12-14 07:35:53,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:35:53,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:35:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:35:54,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:35:54,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:35:54,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797521033] [2022-12-14 07:35:54,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797521033] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:35:54,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860009700] [2022-12-14 07:35:54,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:35:54,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:35:54,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:35:54,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:35:54,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 07:35:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:35:54,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 07:35:54,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:35:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:35:54,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:35:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:35:54,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860009700] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:35:54,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1543414246] [2022-12-14 07:35:54,221 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-12-14 07:35:54,221 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:35:54,225 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:35:54,230 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:35:54,231 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:35:54,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:54,314 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 07:35:54,314 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-12-14 07:35:54,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:54,342 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 07:35:54,343 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-12-14 07:35:54,399 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-12-14 07:35:54,405 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-12-14 07:35:54,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:54,417 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-12-14 07:35:54,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:54,425 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-12-14 07:35:54,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:54,439 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-12-14 07:35:54,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:54,473 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-12-14 07:35:54,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:54,484 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-12-14 07:35:54,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:54,539 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-12-14 07:35:54,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:54,551 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-12-14 07:35:54,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:35:54,597 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-12-14 07:35:54,610 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:35:54,611 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-12-14 07:35:54,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:54,624 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-12-14 07:35:54,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 07:35:54,694 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-12-14 07:35:54,702 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-12-14 07:35:54,716 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-12-14 07:35:54,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 07:35:54,766 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-12-14 07:35:54,777 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-12-14 07:35:54,784 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-12-14 07:35:54,791 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-12-14 07:35:54,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:35:54,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:54,875 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-12-14 07:35:54,887 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:35:54,888 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-12-14 07:35:54,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:35:54,904 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-12-14 07:35:54,987 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-12-14 07:35:54,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 9 treesize of output 3 [2022-12-14 07:35:55,008 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-12-14 07:35:55,015 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-12-14 07:35:55,023 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-12-14 07:35:55,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-14 07:35:55,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-12-14 07:35:55,081 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-12-14 07:35:55,090 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-12-14 07:35:55,099 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-12-14 07:35:55,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:55,156 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-12-14 07:35:55,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:35:55,173 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-12-14 07:35:55,183 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:35:55,184 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-12-14 07:35:55,320 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-12-14 07:35:55,335 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-12-14 07:35:55,418 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-12-14 07:35:55,435 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-12-14 07:35:55,540 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:35:55,549 INFO L321 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-12-14 07:35:55,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 212 [2022-12-14 07:35:55,564 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-12-14 07:35:55,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:35:55,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:55,585 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:35:55,585 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-12-14 07:35:55,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:35:55,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:55,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:35:55,607 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-12-14 07:35:55,760 INFO L197 IcfgInterpreter]: Interpreting procedure node_create with input of size 11 for LOIs [2022-12-14 07:35:55,766 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-12-14 07:35:55,770 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-12-14 07:35:55,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:55,782 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-12-14 07:35:55,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:55,789 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-12-14 07:35:55,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:55,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2022-12-14 07:35:55,797 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:35:57,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1543414246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:35:57,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:35:57,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 4, 4] total 14 [2022-12-14 07:35:57,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156231807] [2022-12-14 07:35:57,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:35:57,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 07:35:57,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:35:57,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 07:35:57,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-12-14 07:35:57,410 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-12-14 07:35:57,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:35:57,638 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-12-14 07:35:57,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 07:35:57,639 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-12-14 07:35:57,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:35:57,639 INFO L225 Difference]: With dead ends: 22 [2022-12-14 07:35:57,639 INFO L226 Difference]: Without dead ends: 17 [2022-12-14 07:35:57,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-12-14 07:35:57,640 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:35:57,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 14 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:35:57,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-12-14 07:35:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-12-14 07:35:57,645 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-12-14 07:35:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-12-14 07:35:57,645 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 17 [2022-12-14 07:35:57,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:35:57,646 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-12-14 07:35:57,646 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-12-14 07:35:57,646 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-12-14 07:35:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 07:35:57,646 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:35:57,646 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:35:57,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 07:35:57,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:35:57,847 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:35:57,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:35:57,848 INFO L85 PathProgramCache]: Analyzing trace with hash -657117681, now seen corresponding path program 1 times [2022-12-14 07:35:57,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:35:57,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233907373] [2022-12-14 07:35:57,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:35:57,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:35:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:35:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 07:35:57,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:35:57,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233907373] [2022-12-14 07:35:57,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233907373] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:35:57,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984305943] [2022-12-14 07:35:57,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:35:57,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:35:57,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:35:57,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:35:57,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 07:35:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:35:58,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 07:35:58,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:35:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:35:58,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:35:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 07:35:58,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984305943] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:35:58,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2033660405] [2022-12-14 07:35:58,050 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2022-12-14 07:35:58,050 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:35:58,051 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:35:58,051 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:35:58,051 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:35:58,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:58,075 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 07:35:58,076 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-12-14 07:35:58,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:58,098 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 07:35:58,098 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-12-14 07:35:58,123 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 07:35:58,126 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-12-14 07:35:58,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:58,133 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-12-14 07:35:58,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:58,140 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-12-14 07:35:58,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:58,145 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-12-14 07:35:58,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:58,160 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-12-14 07:35:58,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:58,167 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-12-14 07:35:58,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:58,198 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-12-14 07:35:58,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:58,206 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-12-14 07:35:58,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:35:58,235 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-12-14 07:35:58,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:35:58,244 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-12-14 07:35:58,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:35:58,255 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-12-14 07:35:58,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 07:35:58,296 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-12-14 07:35:58,303 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-12-14 07:35:58,312 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-12-14 07:35:58,318 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-12-14 07:35:58,353 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-12-14 07:35:58,360 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-12-14 07:35:58,367 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-12-14 07:35:58,374 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-12-14 07:35:58,381 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-12-14 07:35:58,425 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-12-14 07:35:58,432 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-12-14 07:35:58,447 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-12-14 07:35:58,531 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-12-14 07:35:58,537 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-12-14 07:35:58,636 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-12-14 07:35:58,643 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-12-14 07:35:58,692 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-12-14 07:35:58,700 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-12-14 07:35:58,708 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-12-14 07:35:58,844 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-12-14 07:35:58,852 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-12-14 07:35:58,922 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-12-14 07:35:58,932 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-12-14 07:35:59,066 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-12-14 07:35:59,077 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-12-14 07:35:59,090 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-12-14 07:35:59,667 INFO L321 Elim1Store]: treesize reduction 144, result has 36.0 percent of original size [2022-12-14 07:35:59,667 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-12-14 07:35:59,709 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-12-14 07:35:59,734 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-12-14 07:35:59,784 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-12-14 07:35:59,827 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-12-14 07:35:59,849 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-12-14 07:35:59,918 INFO L321 Elim1Store]: treesize reduction 21, result has 12.5 percent of original size [2022-12-14 07:35:59,918 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-12-14 07:36:00,109 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-12-14 07:36:00,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:36:00,169 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-12-14 07:36:00,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:36:00,196 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-12-14 07:36:00,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:36:00,227 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-12-14 07:36:00,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:00,341 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:00,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:00,638 INFO L321 Elim1Store]: treesize reduction 82, result has 43.8 percent of original size [2022-12-14 07:36:00,639 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-12-14 07:36:02,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:36:02,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:36:02,139 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:02,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:02,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:02,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:02,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:02,198 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-12-14 07:36:02,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:36:02,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:02,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:02,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:02,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:02,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:02,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:02,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:02,593 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-12-14 07:36:02,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:02,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:02,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:02,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:03,342 INFO L321 Elim1Store]: treesize reduction 129, result has 7.9 percent of original size [2022-12-14 07:36:03,344 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-12-14 07:36:04,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:04,310 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:04,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:04,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:04,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:04,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:04,872 INFO L217 Elim1Store]: Index analysis took 1032 ms [2022-12-14 07:36:04,880 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-12-14 07:36:05,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:05,471 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:05,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:05,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:05,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:05,575 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:05,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:05,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:05,586 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:05,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:05,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:05,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:05,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:05,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:05,590 INFO L217 Elim1Store]: Index analysis took 121 ms [2022-12-14 07:36:05,594 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-12-14 07:36:24,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:24,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:24,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:24,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:24,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:24,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:24,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:24,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:24,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:24,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:24,888 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-12-14 07:36:24,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:25,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:25,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:25,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:25,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:25,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:25,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:25,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:25,420 INFO L321 Elim1Store]: treesize reduction 180, result has 5.8 percent of original size [2022-12-14 07:36:25,421 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-12-14 07:36:27,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:36:27,381 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:27,552 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:27,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:27,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:27,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:27,695 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:27,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:27,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:27,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:27,699 INFO L217 Elim1Store]: Index analysis took 260 ms [2022-12-14 07:36:27,711 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-12-14 07:36:28,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:36:28,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:28,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:28,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:28,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:28,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:28,424 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:28,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:28,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:28,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:28,429 INFO L217 Elim1Store]: Index analysis took 186 ms [2022-12-14 07:36:28,441 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-12-14 07:36:29,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:29,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:29,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:29,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:29,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:29,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:29,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:29,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:29,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:29,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:29,312 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-12-14 07:36:32,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:32,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:32,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:32,485 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:32,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:32,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:32,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:32,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:32,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:32,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:32,495 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-12-14 07:36:35,204 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:35,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:35,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:35,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:35,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:35,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:35,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:35,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:35,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:35,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:36:35,233 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-12-14 07:37:12,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,595 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:37:12,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,609 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:37:12,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,638 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:37:12,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:12,689 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,776 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-12-14 07:37:12,906 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,911 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:37:12,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,925 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:37:12,962 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,963 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:12,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,004 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,006 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-12-14 07:37:13,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,111 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-12-14 07:37:13,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,312 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-12-14 07:37:13,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:13,503 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-12-14 07:37:14,100 INFO L321 Elim1Store]: treesize reduction 117, result has 17.6 percent of original size [2022-12-14 07:37:14,100 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-12-14 07:37:14,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:14,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:14,440 INFO L321 Elim1Store]: treesize reduction 66, result has 46.3 percent of original size [2022-12-14 07:37:14,440 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-12-14 07:37:14,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:14,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:14,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:14,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:14,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:14,768 INFO L217 Elim1Store]: Index analysis took 192 ms [2022-12-14 07:37:14,786 INFO L321 Elim1Store]: treesize reduction 67, result has 1.5 percent of original size [2022-12-14 07:37:14,787 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-12-14 07:37:17,099 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:17,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:17,107 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-12-14 07:37:17,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:17,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:17,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:17,335 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:17,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:17,354 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-12-14 07:37:28,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:28,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:28,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:28,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:28,389 WARN L193 Elim1Store]: Array PQE input equivalent to false [2022-12-14 07:37:28,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:28,397 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:28,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:28,404 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:28,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:28,430 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-12-14 07:37:28,520 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:28,533 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-12-14 07:37:28,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:28,593 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:28,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:28,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:28,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:28,626 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-12-14 07:37:28,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:28,741 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-12-14 07:37:28,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:28,894 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:28,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:28,901 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:28,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:28,942 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-12-14 07:37:29,056 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:29,061 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-12-14 07:37:29,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:29,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:29,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:29,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:29,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:29,183 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-12-14 07:37:29,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:29,267 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-12-14 07:37:29,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:29,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:29,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:29,330 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:29,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:29,352 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-12-14 07:37:29,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:29,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:29,371 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-12-14 07:37:29,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:29,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:29,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:29,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:29,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:29,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:29,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 767 treesize of output 11317 [2022-12-14 07:37:29,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:29,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:29,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:29,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:29,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:29,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:29,830 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-12-14 07:37:30,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:30,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:30,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:30,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:30,572 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:30,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:30,599 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-12-14 07:37:31,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:31,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:31,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:31,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:31,236 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:31,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:31,264 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-12-14 07:37:31,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:31,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:31,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:31,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:31,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:31,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:31,706 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-12-14 07:37:32,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:32,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:32,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:32,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:32,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:32,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:32,418 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-12-14 07:37:32,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:32,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:32,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:32,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:32,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:33,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:33,020 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-12-14 07:37:33,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:33,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:33,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:33,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:33,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:33,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:33,617 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-12-14 07:37:33,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:33,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:33,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:33,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:37:33,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:34,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:37:34,028 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-12-14 07:37:39,778 INFO L217 Elim1Store]: Index analysis took 558 ms [2022-12-14 07:37:57,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 07:37:57,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:37:57,569 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 179437 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 179437 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-12-14 07:37:57,580 INFO L158 Benchmark]: Toolchain (without parser) took 124939.55ms. Allocated memory was 130.0MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 88.2MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2022-12-14 07:37:57,580 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 130.0MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 07:37:57,580 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.64ms. Allocated memory is still 130.0MB. Free memory was 88.2MB in the beginning and 70.9MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 07:37:57,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.35ms. Allocated memory is still 130.0MB. Free memory was 70.9MB in the beginning and 68.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 07:37:57,581 INFO L158 Benchmark]: Boogie Preprocessor took 21.21ms. Allocated memory is still 130.0MB. Free memory was 68.9MB in the beginning and 67.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 07:37:57,581 INFO L158 Benchmark]: RCFGBuilder took 399.84ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 66.9MB in the beginning and 125.6MB in the end (delta: -58.8MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2022-12-14 07:37:57,581 INFO L158 Benchmark]: TraceAbstraction took 124196.23ms. Allocated memory was 157.3MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 125.3MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2022-12-14 07:37:57,582 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.17ms. Allocated memory is still 130.0MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 287.64ms. Allocated memory is still 130.0MB. Free memory was 88.2MB in the beginning and 70.9MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.35ms. Allocated memory is still 130.0MB. Free memory was 70.9MB in the beginning and 68.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.21ms. Allocated memory is still 130.0MB. Free memory was 68.9MB in the beginning and 67.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 399.84ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 66.9MB in the beginning and 125.6MB in the end (delta: -58.8MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * TraceAbstraction took 124196.23ms. Allocated memory was 157.3MB in the beginning and 5.3GB in the end (delta: 5.1GB). Free memory was 125.3MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 2.1GB. 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 179437 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 179437 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-12-14 07:37:57,787 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-14 07:37:57,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh --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-2329fc7 [2022-12-14 07:37:59,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:37:59,536 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:37:59,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:37:59,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:37:59,558 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:37:59,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:37:59,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:37:59,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:37:59,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:37:59,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:37:59,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:37:59,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:37:59,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:37:59,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:37:59,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:37:59,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:37:59,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:37:59,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:37:59,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:37:59,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:37:59,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:37:59,580 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:37:59,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:37:59,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:37:59,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:37:59,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:37:59,586 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:37:59,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:37:59,588 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:37:59,588 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:37:59,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:37:59,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:37:59,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:37:59,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:37:59,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:37:59,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:37:59,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:37:59,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:37:59,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:37:59,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:37:59,595 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-12-14 07:37:59,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:37:59,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:37:59,618 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:37:59,618 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:37:59,619 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:37:59,619 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:37:59,619 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:37:59,620 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:37:59,620 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:37:59,620 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:37:59,620 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:37:59,620 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:37:59,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:37:59,621 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:37:59,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:37:59,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:37:59,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 07:37:59,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:37:59,622 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 07:37:59,622 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 07:37:59,622 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 07:37:59,622 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 07:37:59,622 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:37:59,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 07:37:59,622 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:37:59,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 07:37:59,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:37:59,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 07:37:59,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:37:59,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:37:59,624 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:37:59,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:37:59,624 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 07:37:59,624 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 07:37:59,624 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 07:37:59,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 07:37:59,625 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:37:59,625 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 07:37:59,625 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_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh 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-12-14 07:37:59,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:37:59,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:37:59,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:37:59,868 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:37:59,868 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:37:59,869 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-12-14 07:38:02,495 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:38:02,703 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:38:02,704 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-12-14 07:38:02,714 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/data/d83fa0c15/ab68c906cdb641bab6378a0ae4a23eb3/FLAG95df20fd1 [2022-12-14 07:38:02,725 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/data/d83fa0c15/ab68c906cdb641bab6378a0ae4a23eb3 [2022-12-14 07:38:02,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:38:02,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:38:02,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:38:02,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:38:02,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:38:02,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:38:02" (1/1) ... [2022-12-14 07:38:02,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca94b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:02, skipping insertion in model container [2022-12-14 07:38:02,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:38:02" (1/1) ... [2022-12-14 07:38:02,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:38:02,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:38:02,953 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_a966f981-1abe-44e2-9c94-43bb4641d1c2/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-12-14 07:38:02,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:38:02,966 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:38:03,008 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_a966f981-1abe-44e2-9c94-43bb4641d1c2/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-12-14 07:38:03,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:38:03,032 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:38:03,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:03 WrapperNode [2022-12-14 07:38:03,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:38:03,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:38:03,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:38:03,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:38:03,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:03" (1/1) ... [2022-12-14 07:38:03,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:03" (1/1) ... [2022-12-14 07:38:03,065 INFO L138 Inliner]: procedures = 130, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2022-12-14 07:38:03,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:38:03,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:38:03,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:38:03,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:38:03,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:03" (1/1) ... [2022-12-14 07:38:03,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:03" (1/1) ... [2022-12-14 07:38:03,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:03" (1/1) ... [2022-12-14 07:38:03,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:03" (1/1) ... [2022-12-14 07:38:03,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:03" (1/1) ... [2022-12-14 07:38:03,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:03" (1/1) ... [2022-12-14 07:38:03,086 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:03" (1/1) ... [2022-12-14 07:38:03,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:03" (1/1) ... [2022-12-14 07:38:03,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:38:03,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:38:03,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:38:03,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:38:03,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:03" (1/1) ... [2022-12-14 07:38:03,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:38:03,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:38:03,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:38:03,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:38:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 07:38:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-14 07:38:03,144 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-14 07:38:03,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 07:38:03,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:38:03,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 07:38:03,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 07:38:03,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 07:38:03,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 07:38:03,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 07:38:03,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-14 07:38:03,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 07:38:03,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:38:03,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:38:03,234 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:38:03,236 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:38:03,481 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:38:03,486 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:38:03,486 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 07:38:03,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:38:03 BoogieIcfgContainer [2022-12-14 07:38:03,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:38:03,489 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:38:03,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:38:03,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:38:03,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:38:02" (1/3) ... [2022-12-14 07:38:03,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556dfc26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:38:03, skipping insertion in model container [2022-12-14 07:38:03,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:03" (2/3) ... [2022-12-14 07:38:03,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@556dfc26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:38:03, skipping insertion in model container [2022-12-14 07:38:03,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:38:03" (3/3) ... [2022-12-14 07:38:03,494 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2022-12-14 07:38:03,509 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:38:03,509 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 07:38:03,546 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:38:03,551 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;@596f7d89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:38:03,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 07:38:03,554 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-12-14 07:38:03,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 07:38:03,561 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:38:03,561 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-12-14 07:38:03,562 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:38:03,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:38:03,566 INFO L85 PathProgramCache]: Analyzing trace with hash -497301104, now seen corresponding path program 1 times [2022-12-14 07:38:03,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:38:03,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827302454] [2022-12-14 07:38:03,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:38:03,577 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-12-14 07:38:03,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:38:03,578 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:03,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:38:03,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 07:38:03,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:38:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:38:03,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:38:03,714 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:38:03,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827302454] [2022-12-14 07:38:03,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827302454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:38:03,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:38:03,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:38:03,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771332059] [2022-12-14 07:38:03,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:38:03,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 07:38:03,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:38:03,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 07:38:03,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 07:38:03,750 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-12-14 07:38:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:38:03,772 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2022-12-14 07:38:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 07:38:03,774 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-12-14 07:38:03,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:38:03,780 INFO L225 Difference]: With dead ends: 54 [2022-12-14 07:38:03,780 INFO L226 Difference]: Without dead ends: 24 [2022-12-14 07:38:03,783 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-12-14 07:38:03,786 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-12-14 07:38:03,788 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-12-14 07:38:03,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-12-14 07:38:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-12-14 07:38:03,817 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-12-14 07:38:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-12-14 07:38:03,818 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 19 [2022-12-14 07:38:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:38:03,819 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-12-14 07:38:03,819 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-12-14 07:38:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-12-14 07:38:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 07:38:03,820 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:38:03,820 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-12-14 07:38:03,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:04,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:04,021 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:38:04,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:38:04,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1988891516, now seen corresponding path program 1 times [2022-12-14 07:38:04,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:38:04,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663188626] [2022-12-14 07:38:04,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:38:04,022 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-12-14 07:38:04,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:38:04,024 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:04,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:38:04,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:38:04,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:38:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:38:04,160 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:38:04,160 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:38:04,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663188626] [2022-12-14 07:38:04,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663188626] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:38:04,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:38:04,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:38:04,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116541264] [2022-12-14 07:38:04,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:38:04,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:38:04,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:38:04,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:38:04,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:38:04,162 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-12-14 07:38:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:38:04,175 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-12-14 07:38:04,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:38:04,175 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-12-14 07:38:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:38:04,176 INFO L225 Difference]: With dead ends: 46 [2022-12-14 07:38:04,176 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 07:38:04,176 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-12-14 07:38:04,177 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-12-14 07:38:04,177 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-12-14 07:38:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 07:38:04,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-12-14 07:38:04,181 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-12-14 07:38:04,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-12-14 07:38:04,182 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2022-12-14 07:38:04,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:38:04,182 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-12-14 07:38:04,182 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-12-14 07:38:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-12-14 07:38:04,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 07:38:04,183 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:38:04,183 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-12-14 07:38:04,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:04,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:04,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:38:04,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:38:04,386 INFO L85 PathProgramCache]: Analyzing trace with hash 208174980, now seen corresponding path program 1 times [2022-12-14 07:38:04,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:38:04,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264203880] [2022-12-14 07:38:04,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:38:04,389 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-12-14 07:38:04,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:38:04,392 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:04,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:38:04,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 07:38:04,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:38:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:38:04,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:38:04,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 07:38:04,723 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:38:04,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264203880] [2022-12-14 07:38:04,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264203880] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:38:04,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [601822325] [2022-12-14 07:38:04,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:38:04,724 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:38:04,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:38:04,725 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:38:04,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-12-14 07:38:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:38:04,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:38:04,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:38:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:38:04,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:38:04,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [601822325] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:38:04,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 07:38:04,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2022-12-14 07:38:04,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331545367] [2022-12-14 07:38:04,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:38:04,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:38:04,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:38:04,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:38:04,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:38:04,880 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-12-14 07:38:04,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:38:04,919 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-12-14 07:38:04,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:38:04,919 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-12-14 07:38:04,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:38:04,920 INFO L225 Difference]: With dead ends: 41 [2022-12-14 07:38:04,920 INFO L226 Difference]: Without dead ends: 34 [2022-12-14 07:38:04,921 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-12-14 07:38:04,922 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-12-14 07:38:04,922 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-12-14 07:38:04,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-14 07:38:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2022-12-14 07:38:04,927 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-12-14 07:38:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-12-14 07:38:04,928 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 28 [2022-12-14 07:38:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:38:04,928 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-12-14 07:38:04,928 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-12-14 07:38:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-12-14 07:38:04,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 07:38:04,929 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:38:04,929 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-12-14 07:38:04,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 07:38:05,135 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2022-12-14 07:38:05,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 07:38:05,332 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:38:05,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:38:05,335 INFO L85 PathProgramCache]: Analyzing trace with hash 265433282, now seen corresponding path program 1 times [2022-12-14 07:38:05,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:38:05,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104923446] [2022-12-14 07:38:05,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:38:05,337 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-12-14 07:38:05,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:38:05,338 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:05,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:38:05,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 07:38:05,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:38:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:38:05,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:38:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 07:38:05,551 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:38:05,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104923446] [2022-12-14 07:38:05,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104923446] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:38:05,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [814593148] [2022-12-14 07:38:05,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:38:05,551 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:38:05,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:38:05,552 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:38:05,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-12-14 07:38:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:38:05,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 07:38:05,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:38:05,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:38:05,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:38:05,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 07:38:05,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [814593148] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:38:05,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003764822] [2022-12-14 07:38:05,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:38:05,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:38:05,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:38:05,769 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:38:05,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 07:38:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:38:05,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 07:38:05,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:38:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:38:05,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:38:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 07:38:05,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003764822] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:38:05,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 07:38:05,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 5] total 7 [2022-12-14 07:38:05,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055522] [2022-12-14 07:38:05,928 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 07:38:05,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 07:38:05,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:38:05,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 07:38:05,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:38:05,929 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-12-14 07:38:05,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:38:05,991 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-12-14 07:38:05,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:38:05,992 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-12-14 07:38:05,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:38:05,992 INFO L225 Difference]: With dead ends: 59 [2022-12-14 07:38:05,992 INFO L226 Difference]: Without dead ends: 39 [2022-12-14 07:38:05,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 07:38:05,993 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:38:05,993 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.0s Time] [2022-12-14 07:38:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-12-14 07:38:06,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-12-14 07:38:06,002 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-12-14 07:38:06,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2022-12-14 07:38:06,003 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 28 [2022-12-14 07:38:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:38:06,003 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-12-14 07:38:06,003 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-12-14 07:38:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-12-14 07:38:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 07:38:06,004 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:38:06,004 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-12-14 07:38:06,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 07:38:06,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2022-12-14 07:38:06,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 07:38:06,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:38:06,606 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:38:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:38:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash -883753534, now seen corresponding path program 2 times [2022-12-14 07:38:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:38:06,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1882881578] [2022-12-14 07:38:06,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:38:06,610 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-12-14 07:38:06,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:38:06,613 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:06,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:06,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-14 07:38:06,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:38:06,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:38:06,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:38:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 07:38:06,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:38:06,774 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:38:06,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1882881578] [2022-12-14 07:38:06,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1882881578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:38:06,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:38:06,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:38:06,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933486854] [2022-12-14 07:38:06,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:38:06,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:38:06,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:38:06,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:38:06,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:38:06,775 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-12-14 07:38:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:38:06,807 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-12-14 07:38:06,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:38:06,807 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-12-14 07:38:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:38:06,808 INFO L225 Difference]: With dead ends: 46 [2022-12-14 07:38:06,808 INFO L226 Difference]: Without dead ends: 38 [2022-12-14 07:38:06,808 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-12-14 07:38:06,809 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-12-14 07:38:06,809 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-12-14 07:38:06,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-14 07:38:06,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-12-14 07:38:06,814 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-12-14 07:38:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-12-14 07:38:06,814 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 37 [2022-12-14 07:38:06,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:38:06,814 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-12-14 07:38:06,815 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-12-14 07:38:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-12-14 07:38:06,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 07:38:06,815 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:38:06,815 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-12-14 07:38:06,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 07:38:07,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:07,017 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:38:07,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:38:07,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1457377551, now seen corresponding path program 1 times [2022-12-14 07:38:07,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:38:07,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989380957] [2022-12-14 07:38:07,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:38:07,020 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-12-14 07:38:07,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:38:07,023 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:07,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:38:07,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-14 07:38:07,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:38:07,454 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-12-14 07:38:07,606 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-12-14 07:38:07,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:38:07,872 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-12-14 07:38:08,257 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:38:08,257 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-12-14 07:38:08,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:38:08,786 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-12-14 07:38:08,925 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-12-14 07:38:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:38:08,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:38:09,608 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:38:09,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989380957] [2022-12-14 07:38:09,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989380957] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:38:09,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1322782539] [2022-12-14 07:38:09,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:38:09,609 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:38:09,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:38:09,610 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:38:09,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-12-14 07:38:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:38:09,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-14 07:38:09,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:38:10,619 INFO L321 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-12-14 07:38:10,619 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-12-14 07:38:10,641 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 07:38:10,641 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-12-14 07:38:10,672 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-12-14 07:38:11,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:38:11,041 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-14 07:38:11,041 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-12-14 07:38:11,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:38:11,054 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-12-14 07:38:13,397 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-12-14 07:38:13,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:38:13,441 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-12-14 07:38:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 07:38:13,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:38:13,871 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-12-14 07:38:14,257 INFO L321 Elim1Store]: treesize reduction 21, result has 65.0 percent of original size [2022-12-14 07:38:14,257 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-12-14 07:38:14,275 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:38:14,275 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-12-14 07:38:14,285 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-12-14 07:38:14,295 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-12-14 07:38:14,355 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:38:14,355 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-12-14 07:38:14,372 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-12-14 07:38:15,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1322782539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:38:15,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612583355] [2022-12-14 07:38:15,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:38:15,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:38:15,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:38:15,172 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:38:15,172 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 07:38:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:38:15,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 07:38:15,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:38:15,295 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-12-14 07:38:15,389 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-12-14 07:38:15,653 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 07:38:15,654 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-12-14 07:38:15,932 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-12-14 07:38:16,136 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:38:16,136 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-12-14 07:38:16,740 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-12-14 07:38:17,151 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 07:38:17,151 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-12-14 07:38:17,160 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-12-14 07:38:17,790 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:38:17,790 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-12-14 07:38:18,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:38:18,066 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-12-14 07:38:18,256 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-12-14 07:38:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:38:18,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:38:18,326 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-12-14 07:38:19,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612583355] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:38:19,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:38:19,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 22] total 47 [2022-12-14 07:38:19,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221615648] [2022-12-14 07:38:19,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:38:19,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-14 07:38:19,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:38:19,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-14 07:38:19,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=3370, Unknown=150, NotChecked=242, Total=4032 [2022-12-14 07:38:19,236 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-12-14 07:38:30,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:38:30,251 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-12-14 07:38:30,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 07:38:30,252 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-12-14 07:38:30,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:38:30,253 INFO L225 Difference]: With dead ends: 63 [2022-12-14 07:38:30,253 INFO L226 Difference]: Without dead ends: 56 [2022-12-14 07:38:30,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1605 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=672, Invalid=5639, Unknown=177, NotChecked=318, Total=6806 [2022-12-14 07:38:30,254 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 271 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 34 mSolverCounterUnsat, 44 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 44 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:38:30,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 328 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 492 Invalid, 44 Unknown, 0 Unchecked, 3.2s Time] [2022-12-14 07:38:30,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-12-14 07:38:30,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2022-12-14 07:38:30,262 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-12-14 07:38:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-12-14 07:38:30,262 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 38 [2022-12-14 07:38:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:38:30,263 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-12-14 07:38:30,263 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-12-14 07:38:30,263 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-12-14 07:38:30,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-14 07:38:30,263 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:38:30,263 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-12-14 07:38:30,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2022-12-14 07:38:30,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:30,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-14 07:38:30,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:38:30,866 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:38:30,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:38:30,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1457379225, now seen corresponding path program 1 times [2022-12-14 07:38:30,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:38:30,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035956242] [2022-12-14 07:38:30,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:38:30,869 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-12-14 07:38:30,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:38:30,872 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:30,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:38:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:38:31,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-14 07:38:31,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:38:31,269 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-12-14 07:38:31,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:38:31,427 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-12-14 07:38:31,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:38:31,438 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-12-14 07:38:31,666 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-12-14 07:38:31,670 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-12-14 07:38:31,675 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-12-14 07:38:31,680 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-12-14 07:38:31,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:38:31,902 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-12-14 07:38:31,938 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-14 07:38:31,939 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-12-14 07:38:31,950 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-12-14 07:38:31,963 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-12-14 07:38:31,963 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-12-14 07:38:31,993 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 07:38:31,994 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-12-14 07:38:31,999 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-12-14 07:38:32,365 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:38:32,365 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-12-14 07:38:32,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:38:32,385 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-12-14 07:38:32,410 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 07:38:32,410 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-12-14 07:38:32,418 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-12-14 07:38:32,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:38:32,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-12-14 07:38:32,802 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-12-14 07:38:32,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:38:32,817 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-12-14 07:38:33,124 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-12-14 07:38:33,131 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-12-14 07:38:33,251 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-12-14 07:38:33,293 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:38:33,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:38:33,428 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-12-14 07:38:39,403 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:38:39,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035956242] [2022-12-14 07:38:39,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035956242] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:38:39,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1759616782] [2022-12-14 07:38:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:38:39,404 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:38:39,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:38:39,405 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:38:39,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-12-14 07:38:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:38:39,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-14 07:38:39,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:38:39,941 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-12-14 07:38:39,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-14 07:38:40,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:38:40,158 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-12-14 07:38:40,627 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-12-14 07:38:40,631 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-12-14 07:38:40,639 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-12-14 07:38:40,643 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-12-14 07:38:40,852 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-12-14 07:38:41,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:38:41,108 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-12-14 07:38:41,134 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-12-14 07:38:41,134 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-12-14 07:38:41,143 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-12-14 07:38:41,179 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 07:38:41,179 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-12-14 07:38:41,190 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-12-14 07:38:42,079 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:38:42,079 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-12-14 07:38:42,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:38:42,103 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-12-14 07:38:42,127 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 07:38:42,128 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-12-14 07:38:42,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:38:42,497 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-12-14 07:38:42,506 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-12-14 07:38:42,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:38:42,526 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-12-14 07:38:42,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 34 treesize of output 18 [2022-12-14 07:38:42,810 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-12-14 07:38:43,001 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-12-14 07:38:43,006 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:38:43,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:38:43,034 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-12-14 07:38:56,889 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:38:56,890 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-12-14 07:39:02,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1759616782] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:39:02,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912009935] [2022-12-14 07:39:02,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:39:02,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:39:02,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:39:02,603 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:39:02,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 07:39:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:39:02,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-14 07:39:02,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:39:02,752 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-12-14 07:39:02,965 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-12-14 07:39:03,221 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-12-14 07:39:03,288 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 07:39:03,289 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-12-14 07:39:03,339 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-12-14 07:39:03,610 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-12-14 07:39:03,948 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 07:39:03,948 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-12-14 07:39:04,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:04,217 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-12-14 07:39:05,087 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-12-14 07:39:05,094 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-12-14 07:39:05,101 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-12-14 07:39:05,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:05,578 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-12-14 07:39:05,610 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-14 07:39:05,611 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-12-14 07:39:05,625 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-12-14 07:39:05,669 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-12-14 07:39:05,669 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-12-14 07:39:05,712 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-12-14 07:39:06,957 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:39:06,957 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-12-14 07:39:06,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:06,966 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-12-14 07:39:06,972 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-12-14 07:39:07,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:07,854 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-12-14 07:39:07,866 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-12-14 07:39:07,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:39:07,888 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-12-14 07:39:08,902 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-12-14 07:39:08,913 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-12-14 07:39:09,225 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-12-14 07:39:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 8 not checked. [2022-12-14 07:39:09,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:39:09,253 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-12-14 07:39:38,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912009935] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:39:38,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:39:38,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 50 [2022-12-14 07:39:38,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814657778] [2022-12-14 07:39:38,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:39:38,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-14 07:39:38,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:39:38,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-14 07:39:38,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=3416, Unknown=227, NotChecked=500, Total=4422 [2022-12-14 07:39:38,599 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-12-14 07:39:58,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:39:58,425 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-12-14 07:39:58,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 07:39:58,427 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-12-14 07:39:58,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:39:58,428 INFO L225 Difference]: With dead ends: 53 [2022-12-14 07:39:58,428 INFO L226 Difference]: Without dead ends: 51 [2022-12-14 07:39:58,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 75.5s TimeCoverageRelationStatistics Valid=615, Invalid=5179, Unknown=228, NotChecked=620, Total=6642 [2022-12-14 07:39:58,432 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 217 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 45 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-12-14 07:39:58,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 304 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 704 Invalid, 6 Unknown, 41 Unchecked, 6.6s Time] [2022-12-14 07:39:58,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-12-14 07:39:58,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2022-12-14 07:39:58,449 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-12-14 07:39:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2022-12-14 07:39:58,450 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 38 [2022-12-14 07:39:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:39:58,450 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2022-12-14 07:39:58,450 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-12-14 07:39:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-12-14 07:39:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 07:39:58,452 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:39:58,452 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-12-14 07:39:58,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 07:39:58,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 07:39:58,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-12-14 07:39:59,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 07:39:59,055 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:39:59,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:39:59,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1501962780, now seen corresponding path program 2 times [2022-12-14 07:39:59,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:39:59,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404185448] [2022-12-14 07:39:59,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:39:59,057 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-12-14 07:39:59,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:39:59,060 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:39:59,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:39:59,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:39:59,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:39:59,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 07:39:59,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:39:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 07:39:59,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:40:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 07:40:00,058 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:40:00,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404185448] [2022-12-14 07:40:00,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404185448] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:40:00,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [72215189] [2022-12-14 07:40:00,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:40:00,058 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:40:00,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:40:00,059 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:40:00,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-12-14 07:40:00,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:40:00,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:40:00,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 07:40:00,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 07:40:00,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:40:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 07:40:00,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [72215189] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:40:00,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736963472] [2022-12-14 07:40:00,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-14 07:40:00,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:40:00,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:40:00,869 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:40:00,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 07:40:01,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-14 07:40:01,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:40:01,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-14 07:40:01,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 07:40:01,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:40:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-14 07:40:01,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736963472] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:40:01,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-12-14 07:40:01,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2022-12-14 07:40:01,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495643365] [2022-12-14 07:40:01,697 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-12-14 07:40:01,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 07:40:01,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:40:01,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 07:40:01,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-14 07:40:01,697 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-12-14 07:40:01,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:01,802 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-12-14 07:40:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:40:01,803 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-12-14 07:40:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:01,803 INFO L225 Difference]: With dead ends: 49 [2022-12-14 07:40:01,803 INFO L226 Difference]: Without dead ends: 40 [2022-12-14 07:40:01,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-14 07:40:01,804 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:01,804 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.0s Time] [2022-12-14 07:40:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-12-14 07:40:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-12-14 07:40:01,817 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-12-14 07:40:01,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-12-14 07:40:01,817 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 39 [2022-12-14 07:40:01,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:01,818 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-12-14 07:40:01,818 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-12-14 07:40:01,818 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-12-14 07:40:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 07:40:01,819 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:01,819 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-12-14 07:40:01,829 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:40:02,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2022-12-14 07:40:02,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 07:40:02,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:40:02,421 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:40:02,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:02,422 INFO L85 PathProgramCache]: Analyzing trace with hash 382129514, now seen corresponding path program 1 times [2022-12-14 07:40:02,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:40:02,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388624539] [2022-12-14 07:40:02,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:02,424 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-12-14 07:40:02,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:40:02,428 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:40:02,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:40:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:02,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 07:40:02,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:02,753 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-12-14 07:40:03,000 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-12-14 07:40:03,313 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-12-14 07:40:03,326 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-12-14 07:40:03,548 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-12-14 07:40:03,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:03,721 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-12-14 07:40:03,776 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-12-14 07:40:03,776 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-12-14 07:40:04,368 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-14 07:40:04,368 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-12-14 07:40:04,446 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 07:40:04,447 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-12-14 07:40:04,460 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-12-14 07:40:04,792 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-14 07:40:04,792 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-12-14 07:40:04,839 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:40:04,839 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-12-14 07:40:05,240 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-12-14 07:40:05,429 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-12-14 07:40:05,429 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-12-14 07:40:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:40:05,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:40:06,268 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-12-14 07:40:06,299 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-12-14 07:40:07,008 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 (= (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_1068))) (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| .cse1 v_ArrVal_1064) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1067) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (_ bv0 32)))) is different from false [2022-12-14 07:40:07,322 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:40:07,322 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-12-14 07:40:07,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:40:07,420 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-12-14 07:40:07,449 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-12-14 07:40:07,475 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-12-14 07:40:09,884 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-12-14 07:40:11,899 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-12-14 07:40:11,903 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:40:11,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388624539] [2022-12-14 07:40:11,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388624539] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:40:11,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2033467400] [2022-12-14 07:40:11,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:11,904 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 07:40:11,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 07:40:11,905 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 07:40:11,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-12-14 07:40:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:12,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-14 07:40:12,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:12,548 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-12-14 07:40:14,349 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-12-14 07:40:14,358 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-12-14 07:40:14,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 7 treesize of output 5 [2022-12-14 07:40:15,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:15,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-12-14 07:40:15,387 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-12-14 07:40:15,387 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-12-14 07:40:15,469 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 07:40:15,470 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-12-14 07:40:15,479 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-12-14 07:40:16,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:16,976 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-12-14 07:40:17,077 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-12-14 07:40:17,077 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-12-14 07:40:17,114 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-12-14 07:40:17,672 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-14 07:40:17,673 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-12-14 07:40:17,727 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:40:17,727 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-12-14 07:40:18,350 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-12-14 07:40:18,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:40:18,714 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-12-14 07:40:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:40:18,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:40:18,998 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-12-14 07:40:19,032 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-12-14 07:40:19,809 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 (= (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_1144))) (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| .cse1 v_ArrVal_1140) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32)))) (_ bv0 32)))) is different from false [2022-12-14 07:40:20,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2033467400] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:40:20,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159842744] [2022-12-14 07:40:20,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:20,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:40:20,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:40:20,941 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:40:20,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 07:40:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:21,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 07:40:21,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:21,093 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-12-14 07:40:22,092 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-14 07:40:22,092 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-12-14 07:40:23,436 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-12-14 07:40:23,437 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-12-14 07:40:26,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:26,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 34 treesize of output 32 [2022-12-14 07:40:26,249 INFO L321 Elim1Store]: treesize reduction 18, result has 48.6 percent of original size [2022-12-14 07:40:26,249 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-12-14 07:40:26,294 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-12-14 07:40:27,696 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-14 07:40:27,696 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-12-14 07:40:27,721 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-12-14 07:40:28,186 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-14 07:40:28,186 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-12-14 07:40:28,230 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:40:28,231 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-12-14 07:40:28,673 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-12-14 07:40:29,090 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 07:40:29,091 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-12-14 07:40:29,104 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:40:29,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:40:29,148 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-12-14 07:40:29,182 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-12-14 07:40:29,229 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 (= (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_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| |c_ULTIMATE.start_sll_insert_~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|))) (_ bv0 32)))) is different from false [2022-12-14 07:40:29,270 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-12-14 07:40:29,572 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-12-14 07:40:29,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159842744] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:40:29,579 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:40:29,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 25] total 60 [2022-12-14 07:40:29,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972819673] [2022-12-14 07:40:29,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:40:29,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-12-14 07:40:29,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:40:29,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-12-14 07:40:29,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=3893, Unknown=65, NotChecked=1644, Total=5852 [2022-12-14 07:40:29,583 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-12-14 07:40:42,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 07:40:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:48,392 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-12-14 07:40:48,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 07:40:48,394 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-12-14 07:40:48,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:48,394 INFO L225 Difference]: With dead ends: 48 [2022-12-14 07:40:48,394 INFO L226 Difference]: Without dead ends: 45 [2022-12-14 07:40:48,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1929 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=642, Invalid=6147, Unknown=65, NotChecked=2076, Total=8930 [2022-12-14 07:40:48,396 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 188 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 27 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:48,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 530 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 844 Invalid, 5 Unknown, 0 Unchecked, 7.9s Time] [2022-12-14 07:40:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-12-14 07:40:48,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2022-12-14 07:40:48,409 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-12-14 07:40:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2022-12-14 07:40:48,410 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 40 [2022-12-14 07:40:48,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:48,410 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2022-12-14 07:40:48,410 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-12-14 07:40:48,410 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-12-14 07:40:48,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-12-14 07:40:48,410 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:48,411 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-12-14 07:40:48,421 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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)] Ended with exit code 0 [2022-12-14 07:40:48,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-14 07:40:48,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2022-12-14 07:40:49,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt [2022-12-14 07:40:49,014 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:40:49,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:49,015 INFO L85 PathProgramCache]: Analyzing trace with hash 382131188, now seen corresponding path program 1 times [2022-12-14 07:40:49,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:40:49,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134659584] [2022-12-14 07:40:49,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:49,017 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-12-14 07:40:49,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:40:49,020 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:40:49,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a966f981-1abe-44e2-9c94-43bb4641d1c2/bin/utaipan-gh47qXpMRh/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-12-14 07:40:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:49,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-14 07:40:49,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:49,504 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-12-14 07:40:49,931 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-12-14 07:40:50,468 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-12-14 07:40:50,477 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-12-14 07:40:50,491 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-12-14 07:40:50,872 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-12-14 07:40:51,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:51,158 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-12-14 07:40:51,226 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-12-14 07:40:51,226 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-12-14 07:40:51,325 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 07:40:51,325 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-12-14 07:40:51,336 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-12-14 07:40:52,345 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2022-12-14 07:40:52,345 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-12-14 07:40:52,379 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-12-14 07:40:52,451 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-12-14 07:40:52,452 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-12-14 07:40:52,813 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-14 07:40:52,814 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-12-14 07:40:52,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:52,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2022-12-14 07:40:52,916 INFO L321 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-12-14 07:40:52,916 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-12-14 07:40:52,944 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-12-14 07:40:53,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 07:40:53,827 INFO L321 Elim1Store]: treesize reduction 31, result has 8.8 percent of original size [2022-12-14 07:40:53,828 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-12-14 07:40:53,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 07:40:53,882 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-14 07:40:53,882 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-12-14 07:40:54,381 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-12-14 07:40:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:40:54,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:40:55,322 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-12-14 07:40:55,402 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-12-14 07:40:55,560 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-12-14 07:40:55,924 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-12-14 07:40:56,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:40:56,714 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-12-14 07:40:56,807 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:40:56,807 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-12-14 07:40:56,858 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-12-14 07:41:00,240 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-12-14 07:42:43,567 WARN L233 SmtUtils]: Spent 1.71m 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-12-14 07:42:43,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 07:42:43,567 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