./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:36:59,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:36:59,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:36:59,593 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:36:59,594 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:36:59,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:36:59,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:36:59,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:36:59,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:36:59,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:36:59,604 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:36:59,606 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:36:59,607 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:36:59,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:36:59,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:36:59,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:36:59,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:36:59,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:36:59,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:36:59,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:36:59,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:36:59,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:36:59,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:36:59,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:36:59,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:36:59,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:36:59,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:36:59,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:36:59,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:36:59,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:36:59,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:36:59,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:36:59,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:36:59,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:36:59,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:36:59,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:36:59,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:36:59,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:36:59,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:36:59,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:36:59,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:36:59,648 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:36:59,675 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:36:59,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:36:59,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:36:59,677 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:36:59,678 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:36:59,678 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:36:59,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:36:59,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:36:59,679 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:36:59,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:36:59,680 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:36:59,680 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:36:59,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:36:59,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:36:59,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:36:59,682 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:36:59,682 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:36:59,682 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:36:59,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:36:59,683 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:36:59,683 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:36:59,683 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:36:59,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:36:59,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:36:59,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:36:59,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:36:59,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:36:59,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:36:59,685 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:36:59,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:36:59,686 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_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/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_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2022-11-02 20:37:00,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:37:00,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:37:00,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:37:00,062 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:37:00,063 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:37:00,064 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-11-02 20:37:00,152 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/data/831ec083c/31eacbb2b8e045bfbd3dd9991b5b3d44/FLAGfdf4a7fe3 [2022-11-02 20:37:00,921 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:37:00,922 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-11-02 20:37:00,938 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/data/831ec083c/31eacbb2b8e045bfbd3dd9991b5b3d44/FLAGfdf4a7fe3 [2022-11-02 20:37:01,156 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/data/831ec083c/31eacbb2b8e045bfbd3dd9991b5b3d44 [2022-11-02 20:37:01,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:37:01,166 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:37:01,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:37:01,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:37:01,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:37:01,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:37:01" (1/1) ... [2022-11-02 20:37:01,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30caeb80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:01, skipping insertion in model container [2022-11-02 20:37:01,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:37:01" (1/1) ... [2022-11-02 20:37:01,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:37:01,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:37:01,733 WARN L230 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_d73e87f8-c76d-4e4e-b068-db5421003f66/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-11-02 20:37:01,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:37:01,747 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:37:01,833 WARN L230 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_d73e87f8-c76d-4e4e-b068-db5421003f66/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-11-02 20:37:01,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:37:01,870 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:37:01,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:01 WrapperNode [2022-11-02 20:37:01,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:37:01,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:37:01,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:37:01,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:37:01,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:01" (1/1) ... [2022-11-02 20:37:01,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:01" (1/1) ... [2022-11-02 20:37:01,971 INFO L138 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2022-11-02 20:37:01,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:37:01,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:37:01,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:37:01,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:37:01,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:01" (1/1) ... [2022-11-02 20:37:01,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:01" (1/1) ... [2022-11-02 20:37:02,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:01" (1/1) ... [2022-11-02 20:37:02,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:01" (1/1) ... [2022-11-02 20:37:02,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:01" (1/1) ... [2022-11-02 20:37:02,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:01" (1/1) ... [2022-11-02 20:37:02,037 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:01" (1/1) ... [2022-11-02 20:37:02,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:01" (1/1) ... [2022-11-02 20:37:02,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:37:02,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:37:02,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:37:02,057 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:37:02,058 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:01" (1/1) ... [2022-11-02 20:37:02,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:37:02,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:02,102 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:37:02,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:37:02,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:37:02,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:37:02,171 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 20:37:02,172 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 20:37:02,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:37:02,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:37:02,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:37:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:37:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:37:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:37:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:37:02,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:37:02,351 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:37:02,354 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:37:02,740 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:37:02,748 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:37:02,749 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-02 20:37:02,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:37:02 BoogieIcfgContainer [2022-11-02 20:37:02,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:37:02,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:37:02,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:37:02,759 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:37:02,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:37:01" (1/3) ... [2022-11-02 20:37:02,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b68dc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:37:02, skipping insertion in model container [2022-11-02 20:37:02,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:37:01" (2/3) ... [2022-11-02 20:37:02,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b68dc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:37:02, skipping insertion in model container [2022-11-02 20:37:02,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:37:02" (3/3) ... [2022-11-02 20:37:02,763 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2022-11-02 20:37:02,787 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:37:02,788 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-11-02 20:37:02,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:37:02,884 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@1ad8e21b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:37:02,884 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-11-02 20:37:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:02,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:37:02,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:02,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:37:02,916 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:02,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2022-11-02 20:37:02,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:02,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326590198] [2022-11-02 20:37:02,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:02,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:37:03,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:03,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326590198] [2022-11-02 20:37:03,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326590198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:03,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:03,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:37:03,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933999002] [2022-11-02 20:37:03,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:03,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:37:03,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:03,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:37:03,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:37:03,299 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 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, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:03,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:03,474 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-11-02 20:37:03,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:37:03,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-02 20:37:03,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:03,487 INFO L225 Difference]: With dead ends: 81 [2022-11-02 20:37:03,487 INFO L226 Difference]: Without dead ends: 78 [2022-11-02 20:37:03,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:37:03,500 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:03,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:37:03,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-02 20:37:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-02 20:37:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-11-02 20:37:03,579 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2022-11-02 20:37:03,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:03,580 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-11-02 20:37:03,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-11-02 20:37:03,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:37:03,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:03,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:37:03,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:37:03,583 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:03,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:03,584 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2022-11-02 20:37:03,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:03,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225947797] [2022-11-02 20:37:03,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:03,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:37:03,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:03,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225947797] [2022-11-02 20:37:03,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225947797] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:03,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:03,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:37:03,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067921426] [2022-11-02 20:37:03,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:03,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:37:03,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:03,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:37:03,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:37:03,791 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:03,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:03,880 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-11-02 20:37:03,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:37:03,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-02 20:37:03,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:03,883 INFO L225 Difference]: With dead ends: 76 [2022-11-02 20:37:03,883 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 20:37:03,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:37:03,885 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:03,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:37:03,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 20:37:03,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-02 20:37:03,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-11-02 20:37:03,905 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2022-11-02 20:37:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:03,905 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-11-02 20:37:03,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:37:03,906 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-11-02 20:37:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 20:37:03,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:03,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:03,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:37:03,907 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:03,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:03,908 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2022-11-02 20:37:03,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:03,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902409614] [2022-11-02 20:37:03,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:03,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:04,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:37:04,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:04,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902409614] [2022-11-02 20:37:04,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902409614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:04,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:04,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:37:04,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900369054] [2022-11-02 20:37:04,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:04,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:37:04,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:04,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:37:04,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:37:04,187 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:37:04,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:04,364 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-11-02 20:37:04,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:37:04,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 13 [2022-11-02 20:37:04,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:04,367 INFO L225 Difference]: With dead ends: 83 [2022-11-02 20:37:04,367 INFO L226 Difference]: Without dead ends: 83 [2022-11-02 20:37:04,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:37:04,369 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:04,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:37:04,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-02 20:37:04,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-11-02 20:37:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2022-11-02 20:37:04,386 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2022-11-02 20:37:04,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:04,387 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2022-11-02 20:37:04,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:37:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-11-02 20:37:04,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:37:04,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:04,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:04,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:37:04,390 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:04,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:04,391 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2022-11-02 20:37:04,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:04,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622955361] [2022-11-02 20:37:04,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:04,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:04,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:04,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:04,755 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:37:04,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:04,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622955361] [2022-11-02 20:37:04,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622955361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:04,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:04,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:37:04,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626616540] [2022-11-02 20:37:04,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:04,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:37:04,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:04,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:37:04,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:37:04,761 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:05,007 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-11-02 20:37:05,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:37:05,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-02 20:37:05,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:05,012 INFO L225 Difference]: With dead ends: 97 [2022-11-02 20:37:05,012 INFO L226 Difference]: Without dead ends: 97 [2022-11-02 20:37:05,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:37:05,015 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:05,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 268 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:37:05,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-02 20:37:05,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-11-02 20:37:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:05,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-11-02 20:37:05,026 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2022-11-02 20:37:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:05,027 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-11-02 20:37:05,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-11-02 20:37:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:37:05,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:05,029 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:05,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:37:05,030 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:05,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:05,031 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2022-11-02 20:37:05,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:05,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426237369] [2022-11-02 20:37:05,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:05,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:05,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:05,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:37:05,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:05,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426237369] [2022-11-02 20:37:05,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426237369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:05,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:05,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:37:05,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290233303] [2022-11-02 20:37:05,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:05,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:37:05,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:05,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:37:05,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:37:05,440 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:05,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:05,668 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-11-02 20:37:05,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:37:05,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-02 20:37:05,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:05,677 INFO L225 Difference]: With dead ends: 76 [2022-11-02 20:37:05,678 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 20:37:05,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:37:05,688 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:05,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:37:05,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 20:37:05,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-11-02 20:37:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-11-02 20:37:05,703 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2022-11-02 20:37:05,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:05,704 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-11-02 20:37:05,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-11-02 20:37:05,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:37:05,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:05,706 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:05,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:37:05,707 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:05,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:05,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2022-11-02 20:37:05,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:05,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204869090] [2022-11-02 20:37:05,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:05,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:05,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:05,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:37:06,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:06,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204869090] [2022-11-02 20:37:06,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204869090] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:06,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929880206] [2022-11-02 20:37:06,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:06,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:06,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:06,133 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:06,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:37:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:06,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 20:37:06,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:06,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:37:06,669 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:37:06,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:37:06,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:37:06,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:37:06,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929880206] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:06,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:37:06,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-02 20:37:06,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623139161] [2022-11-02 20:37:06,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:37:06,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:37:06,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:06,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:37:06,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:37:06,806 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:37:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:07,029 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-11-02 20:37:07,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:37:07,030 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-11-02 20:37:07,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:07,032 INFO L225 Difference]: With dead ends: 94 [2022-11-02 20:37:07,032 INFO L226 Difference]: Without dead ends: 94 [2022-11-02 20:37:07,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:37:07,040 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 67 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:07,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 355 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 34 Unchecked, 0.2s Time] [2022-11-02 20:37:07,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-02 20:37:07,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2022-11-02 20:37:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:07,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-11-02 20:37:07,051 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2022-11-02 20:37:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:07,052 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-11-02 20:37:07,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:37:07,052 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-11-02 20:37:07,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:37:07,053 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:07,054 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:07,090 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 20:37:07,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-02 20:37:07,273 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:07,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:07,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2022-11-02 20:37:07,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:07,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771310602] [2022-11-02 20:37:07,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:07,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:07,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:07,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:37:07,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:07,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771310602] [2022-11-02 20:37:07,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771310602] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:07,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118122738] [2022-11-02 20:37:07,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:07,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:07,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:07,990 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:08,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:37:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:08,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-02 20:37:08,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:08,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:37:08,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:08,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-02 20:37:08,632 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:37:08,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:37:08,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:37:08,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:37:08,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118122738] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:08,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:37:08,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-11-02 20:37:08,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518011551] [2022-11-02 20:37:08,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:37:08,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 20:37:08,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:08,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 20:37:08,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:37:08,891 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:37:09,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:09,322 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-11-02 20:37:09,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:37:09,328 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-11-02 20:37:09,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:09,329 INFO L225 Difference]: With dead ends: 94 [2022-11-02 20:37:09,329 INFO L226 Difference]: Without dead ends: 94 [2022-11-02 20:37:09,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:37:09,331 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 176 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:09,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 450 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 324 Invalid, 0 Unknown, 33 Unchecked, 0.3s Time] [2022-11-02 20:37:09,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-02 20:37:09,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2022-11-02 20:37:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:09,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-11-02 20:37:09,343 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 25 [2022-11-02 20:37:09,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:09,346 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-11-02 20:37:09,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:37:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-11-02 20:37:09,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:37:09,348 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:09,349 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:09,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:37:09,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:09,564 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:09,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:09,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2022-11-02 20:37:09,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:09,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573372031] [2022-11-02 20:37:09,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:09,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:09,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:09,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:37:09,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:09,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573372031] [2022-11-02 20:37:09,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573372031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:09,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:09,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:37:09,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820503899] [2022-11-02 20:37:09,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:09,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:37:09,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:09,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:37:09,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:37:09,892 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:10,338 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-11-02 20:37:10,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:37:10,339 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-02 20:37:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:10,340 INFO L225 Difference]: With dead ends: 142 [2022-11-02 20:37:10,340 INFO L226 Difference]: Without dead ends: 142 [2022-11-02 20:37:10,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:37:10,341 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 312 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:10,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 479 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:37:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-02 20:37:10,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 76. [2022-11-02 20:37:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-11-02 20:37:10,348 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 30 [2022-11-02 20:37:10,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:10,350 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-11-02 20:37:10,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-11-02 20:37:10,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:37:10,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:10,352 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:10,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:37:10,352 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:10,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:10,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2022-11-02 20:37:10,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:10,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420370935] [2022-11-02 20:37:10,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:10,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:10,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:10,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:37:10,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:10,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420370935] [2022-11-02 20:37:10,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420370935] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:10,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219813049] [2022-11-02 20:37:10,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:10,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:10,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:10,596 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:10,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:37:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:10,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:37:10,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:37:10,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:37:10,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219813049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:10,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:37:10,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-02 20:37:10,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192123481] [2022-11-02 20:37:10,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:10,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:37:10,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:10,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:37:10,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:37:10,837 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:10,906 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-11-02 20:37:10,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:37:10,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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 30 [2022-11-02 20:37:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:10,908 INFO L225 Difference]: With dead ends: 104 [2022-11-02 20:37:10,908 INFO L226 Difference]: Without dead ends: 104 [2022-11-02 20:37:10,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:37:10,911 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 117 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:10,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 216 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:37:10,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-02 20:37:10,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2022-11-02 20:37:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 75 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-11-02 20:37:10,931 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 30 [2022-11-02 20:37:10,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:10,932 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-11-02 20:37:10,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:10,933 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-11-02 20:37:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:37:10,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:10,934 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:10,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:37:11,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:11,135 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:11,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:11,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866881, now seen corresponding path program 1 times [2022-11-02 20:37:11,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:11,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733742930] [2022-11-02 20:37:11,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:11,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:11,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:11,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:37:11,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:11,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733742930] [2022-11-02 20:37:11,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733742930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:11,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:11,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:37:11,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991525109] [2022-11-02 20:37:11,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:11,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:37:11,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:11,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:37:11,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:37:11,602 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:12,062 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2022-11-02 20:37:12,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:37:12,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-02 20:37:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:12,064 INFO L225 Difference]: With dead ends: 127 [2022-11-02 20:37:12,064 INFO L226 Difference]: Without dead ends: 127 [2022-11-02 20:37:12,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:37:12,065 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 307 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:12,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 500 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:37:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-02 20:37:12,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 79. [2022-11-02 20:37:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 75 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-11-02 20:37:12,070 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 30 [2022-11-02 20:37:12,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:12,070 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-11-02 20:37:12,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-11-02 20:37:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:37:12,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:12,072 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:12,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:37:12,072 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:12,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2022-11-02 20:37:12,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:12,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051836860] [2022-11-02 20:37:12,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:12,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:12,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:12,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:37:12,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:12,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051836860] [2022-11-02 20:37:12,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051836860] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:12,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809181541] [2022-11-02 20:37:12,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:12,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:12,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:12,805 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:12,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:37:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:12,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-02 20:37:12,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:13,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:37:13,097 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:37:13,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:37:13,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:37:13,172 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:37:13,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-11-02 20:37:13,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-11-02 20:37:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:37:13,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:37:13,401 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-11-02 20:37:13,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 18 [2022-11-02 20:37:13,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_702) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-11-02 20:37:13,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_702) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-11-02 20:37:13,440 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:13,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 19 [2022-11-02 20:37:13,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 [2022-11-02 20:37:13,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:37:13,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809181541] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:13,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:37:13,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 23 [2022-11-02 20:37:13,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461638682] [2022-11-02 20:37:13,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:37:13,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-02 20:37:13,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:13,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-02 20:37:13,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=549, Unknown=2, NotChecked=94, Total=702 [2022-11-02 20:37:13,568 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:14,721 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2022-11-02 20:37:14,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:37:14,722 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-11-02 20:37:14,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:14,724 INFO L225 Difference]: With dead ends: 125 [2022-11-02 20:37:14,724 INFO L226 Difference]: Without dead ends: 125 [2022-11-02 20:37:14,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=1039, Unknown=2, NotChecked=134, Total=1332 [2022-11-02 20:37:14,726 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 165 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:14,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 896 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:37:14,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-02 20:37:14,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2022-11-02 20:37:14,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 89 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:37:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2022-11-02 20:37:14,732 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 33 [2022-11-02 20:37:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:14,733 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2022-11-02 20:37:14,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2022-11-02 20:37:14,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:37:14,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:14,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:14,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:37:14,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:37:14,957 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:14,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:14,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829058, now seen corresponding path program 1 times [2022-11-02 20:37:14,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:14,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916201599] [2022-11-02 20:37:14,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:14,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:15,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:16,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:37:16,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:16,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916201599] [2022-11-02 20:37:16,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916201599] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:16,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643808410] [2022-11-02 20:37:16,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:16,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:16,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:16,305 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:16,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:37:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:16,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-02 20:37:16,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:16,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:37:16,993 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:37:16,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:37:17,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 [2022-11-02 20:37:17,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:37:17,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:37:17,312 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:37:17,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2022-11-02 20:37:17,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 [2022-11-02 20:37:17,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 19 [2022-11-02 20:37:17,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 14 [2022-11-02 20:37:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:37:17,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:37:18,189 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_818 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_817) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2022-11-02 20:37:18,226 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_818 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_817) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2022-11-02 20:37:18,241 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:18,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2022-11-02 20:37:18,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:18,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 30 [2022-11-02 20:37:18,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 44 [2022-11-02 20:37:18,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 70 [2022-11-02 20:37:18,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 30 [2022-11-02 20:37:18,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 62 treesize of output 58 [2022-11-02 20:37:18,329 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:18,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-02 20:37:18,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:18,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 10 [2022-11-02 20:37:22,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643808410] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:22,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:37:22,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-11-02 20:37:22,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452244708] [2022-11-02 20:37:22,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:37:22,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-02 20:37:22,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:22,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-02 20:37:22,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1945, Unknown=2, NotChecked=178, Total=2256 [2022-11-02 20:37:22,983 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:37:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:25,159 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2022-11-02 20:37:25,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:37:25,160 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-11-02 20:37:25,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:25,161 INFO L225 Difference]: With dead ends: 150 [2022-11-02 20:37:25,161 INFO L226 Difference]: Without dead ends: 150 [2022-11-02 20:37:25,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=263, Invalid=2713, Unknown=2, NotChecked=214, Total=3192 [2022-11-02 20:37:25,163 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 235 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:25,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1402 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:37:25,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-02 20:37:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2022-11-02 20:37:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:37:25,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-11-02 20:37:25,167 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 33 [2022-11-02 20:37:25,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:25,167 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-11-02 20:37:25,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:37:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-11-02 20:37:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:37:25,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:25,169 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:25,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:37:25,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:37:25,369 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:25,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:25,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1020012727, now seen corresponding path program 2 times [2022-11-02 20:37:25,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:25,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52451564] [2022-11-02 20:37:25,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:25,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:25,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:25,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-02 20:37:25,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:25,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52451564] [2022-11-02 20:37:25,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52451564] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:25,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642954274] [2022-11-02 20:37:25,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:37:25,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:25,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:25,585 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:25,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:37:25,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:37:25,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:37:25,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:37:25,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:37:25,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:37:25,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642954274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:25,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:37:25,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-11-02 20:37:25,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778472371] [2022-11-02 20:37:25,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:25,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:37:25,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:25,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:37:25,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:37:25,864 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:25,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:25,931 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-11-02 20:37:25,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:37:25,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 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 36 [2022-11-02 20:37:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:25,934 INFO L225 Difference]: With dead ends: 89 [2022-11-02 20:37:25,935 INFO L226 Difference]: Without dead ends: 89 [2022-11-02 20:37:25,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:37:25,936 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 206 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:25,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 115 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:37:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-02 20:37:25,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-02 20:37:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.373134328358209) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:37:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2022-11-02 20:37:25,942 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 36 [2022-11-02 20:37:25,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:25,946 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2022-11-02 20:37:25,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-11-02 20:37:25,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:37:25,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:25,953 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:26,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:37:26,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:37:26,170 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:26,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:26,170 INFO L85 PathProgramCache]: Analyzing trace with hash 999795886, now seen corresponding path program 1 times [2022-11-02 20:37:26,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:26,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961627773] [2022-11-02 20:37:26,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:26,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:26,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:26,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:37:26,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:26,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961627773] [2022-11-02 20:37:26,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961627773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:26,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:26,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:37:26,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670425349] [2022-11-02 20:37:26,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:26,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:37:26,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:26,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:37:26,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:37:26,427 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:26,800 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-11-02 20:37:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:37:26,801 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2022-11-02 20:37:26,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:26,802 INFO L225 Difference]: With dead ends: 114 [2022-11-02 20:37:26,802 INFO L226 Difference]: Without dead ends: 114 [2022-11-02 20:37:26,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:37:26,803 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 280 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:26,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 314 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:37:26,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-02 20:37:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92. [2022-11-02 20:37:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.4) internal successors, (98), 87 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:37:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-11-02 20:37:26,808 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 40 [2022-11-02 20:37:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:26,808 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-11-02 20:37:26,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-11-02 20:37:26,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:37:26,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:26,810 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:26,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:37:26,812 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:26,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:26,812 INFO L85 PathProgramCache]: Analyzing trace with hash 999795887, now seen corresponding path program 1 times [2022-11-02 20:37:26,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:26,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625293540] [2022-11-02 20:37:26,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:26,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:27,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:27,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:37:27,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:27,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625293540] [2022-11-02 20:37:27,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625293540] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:27,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98733702] [2022-11-02 20:37:27,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:27,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:27,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:27,034 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:27,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:37:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:27,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:37:27,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:37:27,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:37:27,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:37:27,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98733702] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:37:27,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:37:27,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2022-11-02 20:37:27,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826111167] [2022-11-02 20:37:27,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:37:27,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:37:27,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:27,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:37:27,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:37:27,382 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:37:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:27,514 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-11-02 20:37:27,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:37:27,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-11-02 20:37:27,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:27,516 INFO L225 Difference]: With dead ends: 120 [2022-11-02 20:37:27,516 INFO L226 Difference]: Without dead ends: 120 [2022-11-02 20:37:27,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:37:27,517 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 142 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:27,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 250 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:37:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-02 20:37:27,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2022-11-02 20:37:27,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 107 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:37:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2022-11-02 20:37:27,523 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 40 [2022-11-02 20:37:27,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:27,524 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2022-11-02 20:37:27,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:37:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2022-11-02 20:37:27,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:37:27,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:27,525 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:27,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:37:27,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:37:27,737 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:27,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:27,738 INFO L85 PathProgramCache]: Analyzing trace with hash 968760597, now seen corresponding path program 1 times [2022-11-02 20:37:27,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:27,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994851649] [2022-11-02 20:37:27,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:27,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:27,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:27,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:37:27,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:27,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994851649] [2022-11-02 20:37:27,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994851649] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:27,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461597087] [2022-11-02 20:37:27,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:27,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:27,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:27,955 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:27,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:37:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:28,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:37:28,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:37:28,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:37:28,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-02 20:37:28,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461597087] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:37:28,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:37:28,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-11-02 20:37:28,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258294038] [2022-11-02 20:37:28,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:37:28,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:37:28,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:28,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:37:28,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:37:28,295 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:37:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:28,470 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-11-02 20:37:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:37:28,471 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-11-02 20:37:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:28,471 INFO L225 Difference]: With dead ends: 114 [2022-11-02 20:37:28,472 INFO L226 Difference]: Without dead ends: 114 [2022-11-02 20:37:28,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:37:28,473 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 195 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:28,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 265 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:37:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-02 20:37:28,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2022-11-02 20:37:28,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 103 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:37:28,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2022-11-02 20:37:28,478 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 41 [2022-11-02 20:37:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:28,478 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2022-11-02 20:37:28,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:37:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-11-02 20:37:28,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:37:28,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:28,480 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:28,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:37:28,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:37:28,693 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:28,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:28,694 INFO L85 PathProgramCache]: Analyzing trace with hash -192932373, now seen corresponding path program 3 times [2022-11-02 20:37:28,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:28,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238495275] [2022-11-02 20:37:28,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:28,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:28,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:28,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:28,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-02 20:37:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 20:37:28,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:28,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238495275] [2022-11-02 20:37:28,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238495275] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:28,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634198674] [2022-11-02 20:37:28,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:37:28,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:28,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:28,857 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:28,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:37:29,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-02 20:37:29,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:37:29,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:37:29,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:37:29,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:37:29,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634198674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:29,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:37:29,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-02 20:37:29,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772809542] [2022-11-02 20:37:29,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:29,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:37:29,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:29,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:37:29,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:37:29,137 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:37:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:29,151 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-11-02 20:37:29,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:37:29,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2022-11-02 20:37:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:29,153 INFO L225 Difference]: With dead ends: 92 [2022-11-02 20:37:29,153 INFO L226 Difference]: Without dead ends: 92 [2022-11-02 20:37:29,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:37:29,154 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 58 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:29,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:37:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-02 20:37:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-02 20:37:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 88 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2022-11-02 20:37:29,159 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 45 [2022-11-02 20:37:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:29,159 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2022-11-02 20:37:29,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:37:29,160 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2022-11-02 20:37:29,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:37:29,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:29,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:29,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:37:29,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-02 20:37:29,381 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:29,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:29,381 INFO L85 PathProgramCache]: Analyzing trace with hash 884092027, now seen corresponding path program 2 times [2022-11-02 20:37:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:29,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605374265] [2022-11-02 20:37:29,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:29,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:29,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:29,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:37:29,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:29,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605374265] [2022-11-02 20:37:29,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605374265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:29,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:37:29,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:37:29,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093234244] [2022-11-02 20:37:29,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:29,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:37:29,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:29,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:37:29,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:37:29,909 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:30,257 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-11-02 20:37:30,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:37:30,258 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-11-02 20:37:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:30,259 INFO L225 Difference]: With dead ends: 132 [2022-11-02 20:37:30,259 INFO L226 Difference]: Without dead ends: 132 [2022-11-02 20:37:30,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:37:30,260 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 409 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:30,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 294 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:37:30,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-02 20:37:30,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2022-11-02 20:37:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 88 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2022-11-02 20:37:30,266 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 45 [2022-11-02 20:37:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:30,267 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-11-02 20:37:30,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2022-11-02 20:37:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:37:30,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:30,269 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:30,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:37:30,269 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:30,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:30,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140989, now seen corresponding path program 1 times [2022-11-02 20:37:30,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:30,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013183787] [2022-11-02 20:37:30,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:30,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:30,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:30,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:37:30,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:30,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013183787] [2022-11-02 20:37:30,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013183787] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:30,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808466942] [2022-11-02 20:37:30,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:30,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:30,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:30,490 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:30,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:37:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:30,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:37:30,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:37:30,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:37:30,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808466942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:37:30,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:37:30,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-11-02 20:37:30,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30198189] [2022-11-02 20:37:30,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:37:30,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:37:30,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:30,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:37:30,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:37:30,830 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:30,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:30,913 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-11-02 20:37:30,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:37:30,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 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 48 [2022-11-02 20:37:30,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:30,915 INFO L225 Difference]: With dead ends: 88 [2022-11-02 20:37:30,915 INFO L226 Difference]: Without dead ends: 88 [2022-11-02 20:37:30,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:37:30,916 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 161 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:30,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 117 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:37:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-02 20:37:30,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-02 20:37:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 84 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:30,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2022-11-02 20:37:30,922 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 48 [2022-11-02 20:37:30,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:30,923 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2022-11-02 20:37:30,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:37:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-11-02 20:37:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:37:30,924 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:30,925 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:30,970 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:37:31,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:31,148 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:31,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:31,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140934, now seen corresponding path program 1 times [2022-11-02 20:37:31,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:31,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641321141] [2022-11-02 20:37:31,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:31,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:32,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:32,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:37:32,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:32,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641321141] [2022-11-02 20:37:32,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641321141] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:32,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357273632] [2022-11-02 20:37:32,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:32,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:32,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:32,549 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:32,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:37:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:32,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-02 20:37:32,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:32,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:37:33,014 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:37:33,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:37:33,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:37:33,220 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:37:33,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-11-02 20:37:33,655 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:37:33,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-11-02 20:37:33,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:33,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2022-11-02 20:37:33,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-11-02 20:37:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:37:33,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:37:39,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1754) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2022-11-02 20:37:39,741 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1754) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2022-11-02 20:37:39,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1754) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2022-11-02 20:37:40,146 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-02 20:37:40,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 28 [2022-11-02 20:37:40,155 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1753))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1754)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-11-02 20:37:40,168 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1753))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1754)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2022-11-02 20:37:40,179 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:40,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 29 [2022-11-02 20:37:40,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 136 treesize of output 112 [2022-11-02 20:37:40,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 108 treesize of output 98 [2022-11-02 20:37:40,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2022-11-02 20:37:40,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357273632] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:40,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:37:40,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 39 [2022-11-02 20:37:40,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831362557] [2022-11-02 20:37:40,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:37:40,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-02 20:37:40,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:37:40,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-02 20:37:40,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1809, Unknown=49, NotChecked=450, Total=2450 [2022-11-02 20:37:40,368 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:37:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:37:42,551 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-11-02 20:37:42,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:37:42,552 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-11-02 20:37:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:37:42,553 INFO L225 Difference]: With dead ends: 145 [2022-11-02 20:37:42,553 INFO L226 Difference]: Without dead ends: 145 [2022-11-02 20:37:42,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=380, Invalid=3250, Unknown=50, NotChecked=610, Total=4290 [2022-11-02 20:37:42,556 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 547 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:37:42,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1091 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:37:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-02 20:37:42,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 87. [2022-11-02 20:37:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:37:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-11-02 20:37:42,560 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 48 [2022-11-02 20:37:42,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:37:42,561 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-11-02 20:37:42,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:37:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-11-02 20:37:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-02 20:37:42,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:37:42,563 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:37:42,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:37:42,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:42,764 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:37:42,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:37:42,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140935, now seen corresponding path program 1 times [2022-11-02 20:37:42,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:37:42,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074861468] [2022-11-02 20:37:42,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:42,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:37:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:44,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:37:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:44,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:37:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:37:45,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:37:45,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074861468] [2022-11-02 20:37:45,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074861468] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:37:45,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554031772] [2022-11-02 20:37:45,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:37:45,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:37:45,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:37:45,023 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:37:45,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:37:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:37:45,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-02 20:37:45,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:37:45,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:37:45,981 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:37:45,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:37:45,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-11-02 20:37:46,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:37:46,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:37:46,392 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:37:46,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2022-11-02 20:37:46,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 [2022-11-02 20:37:47,039 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:37:47,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2022-11-02 20:37:47,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 33 [2022-11-02 20:37:47,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:47,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 [2022-11-02 20:37:47,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:37:47,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 [2022-11-02 20:37:47,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 19 [2022-11-02 20:37:47,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 14 [2022-11-02 20:37:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:37:47,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:37:49,396 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1901 Int)) (<= 0 (+ 4 (select (store .cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1901 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ 8 (select (store .cse0 .cse1 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|))))))))) is different from false [2022-11-02 20:37:49,469 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int))) (or (forall ((v_ArrVal_1902 Int) (v_ArrVal_1901 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1897 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)))))) is different from false [2022-11-02 20:37:49,532 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1897 (Array Int Int))) (or (forall ((v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int))) (or (forall ((v_ArrVal_1902 Int) (v_ArrVal_1901 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-11-02 20:37:49,565 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1901 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1897 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))))))) is different from false [2022-11-02 20:37:49,646 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1901 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1897 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))))))) is different from false [2022-11-02 20:37:49,692 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1901 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1897 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (forall ((v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 4))))))) is different from false [2022-11-02 20:37:49,725 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int))) (or (forall ((v_ArrVal_1902 Int) (v_ArrVal_1901 Int)) (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1897 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))))))) is different from false [2022-11-02 20:37:49,762 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1901 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (store (select (store .cse2 .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)))))) is different from false [2022-11-02 20:37:49,826 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int))) (or (forall ((v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1901 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select |c_#length| (select (store (select (store .cse2 .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))))) is different from false [2022-11-02 20:37:49,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:49,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 44 [2022-11-02 20:37:49,868 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:49,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 36 [2022-11-02 20:37:49,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 56 [2022-11-02 20:37:49,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 280 treesize of output 272 [2022-11-02 20:37:49,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:49,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 251 treesize of output 245 [2022-11-02 20:37:49,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:49,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 215 treesize of output 203 [2022-11-02 20:37:49,918 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:49,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 194 treesize of output 186 [2022-11-02 20:37:49,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 126 treesize of output 114 [2022-11-02 20:37:50,052 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:50,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 84 [2022-11-02 20:37:50,064 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:37:50,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 60 [2022-11-02 20:37:50,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:50,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 82 [2022-11-02 20:37:50,097 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:50,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:50,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2022-11-02 20:37:50,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:50,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 20 [2022-11-02 20:37:50,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:50,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 42 [2022-11-02 20:37:50,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:37:50,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 28 [2022-11-02 20:38:00,638 WARN L234 SmtUtils]: Spent 10.09s on a formula simplification. DAG size of input: 31 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:38:00,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554031772] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:38:00,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:38:00,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 47 [2022-11-02 20:38:00,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190321631] [2022-11-02 20:38:00,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:38:00,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-02 20:38:00,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:00,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-02 20:38:00,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2914, Unknown=9, NotChecked=1044, Total=4160 [2022-11-02 20:38:00,646 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:38:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:38:03,586 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2022-11-02 20:38:03,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:38:03,587 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2022-11-02 20:38:03,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:38:03,588 INFO L225 Difference]: With dead ends: 124 [2022-11-02 20:38:03,588 INFO L226 Difference]: Without dead ends: 124 [2022-11-02 20:38:03,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=404, Invalid=4453, Unknown=9, NotChecked=1296, Total=6162 [2022-11-02 20:38:03,591 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 654 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:38:03,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 2115 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1215 Invalid, 0 Unknown, 94 Unchecked, 1.1s Time] [2022-11-02 20:38:03,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-02 20:38:03,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84. [2022-11-02 20:38:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 80 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:38:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-11-02 20:38:03,595 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 48 [2022-11-02 20:38:03,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:38:03,596 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-11-02 20:38:03,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:38:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-11-02 20:38:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 20:38:03,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:38:03,597 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:03,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:38:03,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:38:03,810 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:38:03,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:03,810 INFO L85 PathProgramCache]: Analyzing trace with hash -74907051, now seen corresponding path program 1 times [2022-11-02 20:38:03,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:03,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406330778] [2022-11-02 20:38:03,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:03,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:04,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:38:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:04,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:38:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:38:04,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:04,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406330778] [2022-11-02 20:38:04,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406330778] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:38:04,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141205498] [2022-11-02 20:38:04,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:04,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:38:04,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:38:04,122 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:38:04,153 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:38:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:04,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:38:04,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:38:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:38:04,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:38:04,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141205498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:04,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:38:04,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-02 20:38:04,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25860747] [2022-11-02 20:38:04,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:04,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:38:04,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:04,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:38:04,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:38:04,477 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:38:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:38:04,547 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-11-02 20:38:04,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:38:04,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 49 [2022-11-02 20:38:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:38:04,549 INFO L225 Difference]: With dead ends: 86 [2022-11-02 20:38:04,549 INFO L226 Difference]: Without dead ends: 86 [2022-11-02 20:38:04,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:38:04,550 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 70 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:38:04,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 191 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:38:04,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-02 20:38:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2022-11-02 20:38:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:38:04,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-11-02 20:38:04,554 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 49 [2022-11-02 20:38:04,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:38:04,554 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-11-02 20:38:04,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:38:04,555 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-11-02 20:38:04,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:38:04,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:38:04,556 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:04,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:38:04,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 20:38:04,772 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:38:04,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:04,772 INFO L85 PathProgramCache]: Analyzing trace with hash 836425368, now seen corresponding path program 1 times [2022-11-02 20:38:04,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:04,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764018211] [2022-11-02 20:38:04,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:04,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:07,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:38:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:07,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:38:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:08,012 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:38:08,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:08,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764018211] [2022-11-02 20:38:08,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764018211] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:38:08,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806165230] [2022-11-02 20:38:08,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:08,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:38:08,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:38:08,015 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:38:08,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:38:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:08,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 109 conjunts are in the unsatisfiable core [2022-11-02 20:38:08,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:38:08,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:38:08,689 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:38:08,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:38:08,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:38:08,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:38:08,980 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:38:08,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 20:38:08,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-11-02 20:38:09,547 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:38:09,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 55 [2022-11-02 20:38:09,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 21 [2022-11-02 20:38:09,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-02 20:38:09,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:38:09,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 38 [2022-11-02 20:38:09,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 20:38:09,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:38:09,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2022-11-02 20:38:10,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 48 [2022-11-02 20:38:10,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 48 treesize of output 36 [2022-11-02 20:38:10,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2022-11-02 20:38:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:38:10,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:38:11,531 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4)) (.cse0 (* |c_ULTIMATE.start_main_~len~0#1| 2))) (and (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2184) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse1 .cse2 v_ArrVal_2182)) |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_circular_update_at_~head#1.base| (store .cse3 .cse2 v_ArrVal_2181)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1))) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2184) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse1 .cse2 v_ArrVal_2182)) |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_circular_update_at_~head#1.base| (store .cse3 .cse2 v_ArrVal_2181)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1) .cse0)))) is different from false [2022-11-02 20:38:11,582 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store .cse0 .cse1 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store .cse2 .cse1 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) .cse3)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= .cse3 (+ (let ((.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store .cse0 .cse4 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store .cse2 .cse4 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1))))))) is different from false [2022-11-02 20:38:11,670 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:38:11,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-11-02 20:38:11,685 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:38:11,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2022-11-02 20:38:11,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-02 20:38:11,764 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:38:11,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-11-02 20:38:11,782 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:38:11,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 103 [2022-11-02 20:38:11,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-11-02 20:38:11,864 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-02 20:38:11,954 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|)))) (<= .cse1 .cse0))) is different from false [2022-11-02 20:38:12,005 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (<= .cse1 .cse2) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (<= .cse2 .cse1) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) is different from false [2022-11-02 20:38:12,097 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1)))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) is different from false [2022-11-02 20:38:12,153 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) is different from false [2022-11-02 20:38:12,195 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse0)))))) is different from false [2022-11-02 20:38:12,240 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2175 (Array Int Int))) (or (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2178)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2175 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse1 (select (store (select (store .cse2 .cse1 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2176))) (= (select (store (select (store .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) is different from false [2022-11-02 20:38:12,318 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2175 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2178)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2175 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= (select (store (select (store .cse1 .cse2 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse2)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2176))) (= (select (store (select (store .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) is different from false [2022-11-02 20:38:12,345 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:38:12,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 35 [2022-11-02 20:38:12,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 285 treesize of output 267 [2022-11-02 20:38:12,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:38:12,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 240 treesize of output 232 [2022-11-02 20:38:12,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:38:12,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 222 treesize of output 206 [2022-11-02 20:38:12,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:38:12,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 163 treesize of output 149 [2022-11-02 20:38:12,414 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:38:12,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 1 [2022-11-02 20:38:12,424 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:38:12,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 1 [2022-11-02 20:38:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-02 20:38:13,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806165230] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:38:13,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:38:13,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 28, 29] total 80 [2022-11-02 20:38:13,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211895360] [2022-11-02 20:38:13,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:38:13,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-11-02 20:38:13,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:13,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-11-02 20:38:13,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=4633, Unknown=10, NotChecked=1450, Total=6320 [2022-11-02 20:38:13,306 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 80 states, 79 states have (on average 1.6329113924050633) internal successors, (129), 71 states have internal predecessors, (129), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-02 20:38:15,046 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_sll_circular_create_~len#1|) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2175 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2178)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2175 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= (select (store (select (store .cse2 .cse3 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse3)))))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2176))) (= (select (store (select (store .cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (select (select .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2022-11-02 20:38:16,083 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2175 (Array Int Int))) (or (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2178)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2175 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse2 (select (store (select (store .cse3 .cse2 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2176))) (= (select (store (select (store .cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (= |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2022-11-02 20:38:17,026 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse0)))) (= .cse1 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2022-11-02 20:38:17,930 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse1)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0)) (= .cse1 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= |c_ULTIMATE.start_main_~len~0#1| 2))) is different from false [2022-11-02 20:38:18,842 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= |c_ULTIMATE.start_main_~len~0#1| 2) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (<= 2 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1)))) (= .cse2 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse2)))) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-11-02 20:38:20,120 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1)) (.cse0 (select .cse4 |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (and (<= |c_ULTIMATE.start_main_~len~0#1| 2) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (<= .cse1 .cse2) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse0)) (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse3 0) (<= .cse2 .cse1) (<= 2 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0) (= .cse2 .cse1) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (= (select .cse5 |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-11-02 20:38:21,965 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= |c_ULTIMATE.start_main_~len~0#1| 2) (not (= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (= 0 |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|) (<= .cse0 .cse1) (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|)))) (= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (<= .cse1 .cse0) (<= 2 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-11-02 20:38:23,762 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= |c_ULTIMATE.start_main_~len~0#1| 2) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (<= .cse0 .cse1) (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (<= .cse1 .cse0) (<= 2 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-11-02 20:38:23,770 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= |c_ULTIMATE.start_main_~len~0#1| 2) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store .cse0 .cse1 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store .cse2 .cse1 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) .cse3)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= .cse3 (+ (let ((.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store .cse0 .cse4 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store .cse2 .cse4 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1))))) (= (select (select |c_#memory_int| .cse5) 4) (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (<= 2 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse5)) (= |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2022-11-02 20:38:23,778 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse8 (select .cse0 |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse6 (select |c_#memory_int| .cse8))) (let ((.cse5 (+ (select .cse6 4) 1)) (.cse3 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse7 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store .cse0 .cse1 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store .cse2 .cse1 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) .cse3)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= .cse3 (+ (let ((.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store .cse0 .cse4 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store .cse2 .cse4 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1))))) (<= (+ .cse3 |c_ULTIMATE.start_main_~i~0#1|) .cse5) (<= .cse5 .cse3) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= .cse3 (+ (select .cse6 (+ .cse7 4)) 1)) (= .cse7 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse8))))))) is different from false [2022-11-02 20:38:26,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:38:26,313 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-11-02 20:38:26,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:38:26,314 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 79 states have (on average 1.6329113924050633) internal successors, (129), 71 states have internal predecessors, (129), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 52 [2022-11-02 20:38:26,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:38:26,315 INFO L225 Difference]: With dead ends: 86 [2022-11-02 20:38:26,315 INFO L226 Difference]: Without dead ends: 86 [2022-11-02 20:38:26,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 20 IntricatePredicates, 1 DeprecatedPredicates, 1654 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=436, Invalid=6934, Unknown=20, NotChecked=3740, Total=11130 [2022-11-02 20:38:26,319 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 137 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 646 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:38:26,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1578 Invalid, 1847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1165 Invalid, 0 Unknown, 646 Unchecked, 1.1s Time] [2022-11-02 20:38:26,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-02 20:38:26,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2022-11-02 20:38:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 80 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:38:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-11-02 20:38:26,323 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 52 [2022-11-02 20:38:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:38:26,324 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-11-02 20:38:26,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 1.6329113924050633) internal successors, (129), 71 states have internal predecessors, (129), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-02 20:38:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-11-02 20:38:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-02 20:38:26,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:38:26,325 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:26,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:38:26,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-02 20:38:26,538 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:38:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:26,539 INFO L85 PathProgramCache]: Analyzing trace with hash -368684005, now seen corresponding path program 1 times [2022-11-02 20:38:26,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:26,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796939359] [2022-11-02 20:38:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:26,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:27,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:38:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:27,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:38:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:27,863 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:38:27,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:27,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796939359] [2022-11-02 20:38:27,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796939359] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:38:27,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785743090] [2022-11-02 20:38:27,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:27,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:38:27,865 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:38:27,869 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:38:27,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:38:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:28,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-02 20:38:28,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:38:28,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-11-02 20:38:28,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:38:28,890 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:38:28,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:38:29,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2022-11-02 20:38:29,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:38:29,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:38:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:38:29,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785743090] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:38:29,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:38:29,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 12] total 39 [2022-11-02 20:38:29,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328683546] [2022-11-02 20:38:29,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:38:29,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-02 20:38:29,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:29,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-02 20:38:29,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1368, Unknown=0, NotChecked=0, Total=1482 [2022-11-02 20:38:29,613 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 39 states, 39 states have (on average 3.4615384615384617) internal successors, (135), 37 states have internal predecessors, (135), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:38:31,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:38:31,252 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2022-11-02 20:38:31,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:38:31,253 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.4615384615384617) internal successors, (135), 37 states have internal predecessors, (135), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2022-11-02 20:38:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:38:31,254 INFO L225 Difference]: With dead ends: 118 [2022-11-02 20:38:31,254 INFO L226 Difference]: Without dead ends: 118 [2022-11-02 20:38:31,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=351, Invalid=2301, Unknown=0, NotChecked=0, Total=2652 [2022-11-02 20:38:31,256 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 995 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:38:31,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 926 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:38:31,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-02 20:38:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 88. [2022-11-02 20:38:31,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 84 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:38:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-11-02 20:38:31,263 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 59 [2022-11-02 20:38:31,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:38:31,264 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-11-02 20:38:31,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.4615384615384617) internal successors, (135), 37 states have internal predecessors, (135), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:38:31,264 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-11-02 20:38:31,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-02 20:38:31,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:38:31,270 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:31,320 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:38:31,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-02 20:38:31,490 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:38:31,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:31,491 INFO L85 PathProgramCache]: Analyzing trace with hash 2070538002, now seen corresponding path program 2 times [2022-11-02 20:38:31,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:31,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247294291] [2022-11-02 20:38:31,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:31,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:31,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:38:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:31,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:38:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:31,721 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-02 20:38:31,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:31,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247294291] [2022-11-02 20:38:31,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247294291] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:38:31,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644950127] [2022-11-02 20:38:31,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:38:31,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:38:31,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:38:31,724 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:38:31,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 20:38:32,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:38:32,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:38:32,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:38:32,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:38:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 20:38:32,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:38:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-02 20:38:32,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644950127] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:38:32,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:38:32,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-11-02 20:38:32,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872239223] [2022-11-02 20:38:32,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:38:32,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:38:32,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:32,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:38:32,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:38:32,237 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:38:32,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:38:32,409 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-11-02 20:38:32,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:38:32,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2022-11-02 20:38:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:38:32,410 INFO L225 Difference]: With dead ends: 79 [2022-11-02 20:38:32,410 INFO L226 Difference]: Without dead ends: 79 [2022-11-02 20:38:32,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:38:32,411 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 143 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:38:32,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 228 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:38:32,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-02 20:38:32,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-02 20:38:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:38:32,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-11-02 20:38:32,415 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 62 [2022-11-02 20:38:32,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:38:32,415 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-11-02 20:38:32,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-02 20:38:32,415 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-11-02 20:38:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 20:38:32,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:38:32,416 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:32,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-02 20:38:32,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:38:32,617 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:38:32,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:32,617 INFO L85 PathProgramCache]: Analyzing trace with hash 424234897, now seen corresponding path program 1 times [2022-11-02 20:38:32,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:32,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472230888] [2022-11-02 20:38:32,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:32,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:32,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:38:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:32,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:38:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-02 20:38:32,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:32,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472230888] [2022-11-02 20:38:32,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472230888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:32,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:32,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:38:32,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389620173] [2022-11-02 20:38:32,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:32,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:38:32,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:32,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:38:32,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:38:32,906 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:38:33,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:38:33,250 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-11-02 20:38:33,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:38:33,250 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-11-02 20:38:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:38:33,251 INFO L225 Difference]: With dead ends: 97 [2022-11-02 20:38:33,251 INFO L226 Difference]: Without dead ends: 97 [2022-11-02 20:38:33,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:38:33,252 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 187 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:38:33,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 258 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:38:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-02 20:38:33,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2022-11-02 20:38:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 78 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:38:33,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2022-11-02 20:38:33,256 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 63 [2022-11-02 20:38:33,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:38:33,256 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2022-11-02 20:38:33,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:38:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-11-02 20:38:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-02 20:38:33,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:38:33,257 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:33,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:38:33,258 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:38:33,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash 424234898, now seen corresponding path program 1 times [2022-11-02 20:38:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:33,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130674977] [2022-11-02 20:38:33,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:33,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:38:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:33,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:38:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:38:33,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:33,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130674977] [2022-11-02 20:38:33,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130674977] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:33,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:33,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:38:33,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186929980] [2022-11-02 20:38:33,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:33,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:38:33,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:33,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:38:33,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:38:33,728 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:38:34,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:38:34,057 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-11-02 20:38:34,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:38:34,058 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-11-02 20:38:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:38:34,059 INFO L225 Difference]: With dead ends: 80 [2022-11-02 20:38:34,059 INFO L226 Difference]: Without dead ends: 80 [2022-11-02 20:38:34,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:38:34,060 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 191 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:38:34,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 201 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:38:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-02 20:38:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-02 20:38:34,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:38:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-11-02 20:38:34,063 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 63 [2022-11-02 20:38:34,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:38:34,064 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-11-02 20:38:34,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:38:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-11-02 20:38:34,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-02 20:38:34,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:38:34,065 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:34,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 20:38:34,065 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:38:34,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:34,066 INFO L85 PathProgramCache]: Analyzing trace with hash 266413795, now seen corresponding path program 1 times [2022-11-02 20:38:34,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:34,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541146438] [2022-11-02 20:38:34,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:34,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:38:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:38:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,323 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:38:34,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:34,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541146438] [2022-11-02 20:38:34,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541146438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:34,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:34,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:38:34,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833722360] [2022-11-02 20:38:34,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:34,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:38:34,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:34,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:38:34,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:38:34,327 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:38:34,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:38:34,570 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-11-02 20:38:34,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:38:34,572 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2022-11-02 20:38:34,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:38:34,573 INFO L225 Difference]: With dead ends: 80 [2022-11-02 20:38:34,573 INFO L226 Difference]: Without dead ends: 80 [2022-11-02 20:38:34,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:38:34,574 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 187 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:38:34,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 257 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:38:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-02 20:38:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-02 20:38:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.173913043478261) internal successors, (81), 76 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:38:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-11-02 20:38:34,577 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 64 [2022-11-02 20:38:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:38:34,577 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-11-02 20:38:34,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:38:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-11-02 20:38:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:38:34,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:38:34,578 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:34,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 20:38:34,579 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:38:34,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:34,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1706854879, now seen corresponding path program 1 times [2022-11-02 20:38:34,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:34,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623800818] [2022-11-02 20:38:34,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:34,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:38:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:38:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 20:38:34,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:34,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623800818] [2022-11-02 20:38:34,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623800818] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:38:34,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415136755] [2022-11-02 20:38:34,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:34,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:38:34,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:38:34,905 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:38:34,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-02 20:38:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:35,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-02 20:38:35,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:38:35,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 20:38:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:38:35,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:38:35,896 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-02 20:38:35,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-11-02 20:38:36,003 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 20:38:36,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 11 [2022-11-02 20:38:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 20:38:36,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415136755] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:38:36,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:38:36,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 8] total 26 [2022-11-02 20:38:36,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683939997] [2022-11-02 20:38:36,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:38:36,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 20:38:36,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:36,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:38:36,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:38:36,109 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:38:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:38:37,024 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-11-02 20:38:37,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:38:37,025 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 66 [2022-11-02 20:38:37,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:38:37,027 INFO L225 Difference]: With dead ends: 88 [2022-11-02 20:38:37,028 INFO L226 Difference]: Without dead ends: 88 [2022-11-02 20:38:37,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2022-11-02 20:38:37,030 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 331 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:38:37,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 610 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:38:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-02 20:38:37,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2022-11-02 20:38:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:38:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-11-02 20:38:37,034 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 66 [2022-11-02 20:38:37,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:38:37,034 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-11-02 20:38:37,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:38:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-11-02 20:38:37,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:38:37,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:38:37,036 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:37,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-02 20:38:37,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-02 20:38:37,249 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:38:37,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:37,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1706854878, now seen corresponding path program 1 times [2022-11-02 20:38:37,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:37,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880531569] [2022-11-02 20:38:37,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:37,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:38,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:38:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:39,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:38:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:38:39,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:39,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880531569] [2022-11-02 20:38:39,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880531569] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:38:39,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025962297] [2022-11-02 20:38:39,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:39,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:38:39,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:38:39,237 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:38:39,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-02 20:38:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:39,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 109 conjunts are in the unsatisfiable core [2022-11-02 20:38:39,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:38:39,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:38:39,858 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:38:39,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:38:40,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:38:40,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:38:40,188 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:38:40,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 20:38:40,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:38:40,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 20:38:40,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:38:40,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:38:40,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:38:41,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 [2022-11-02 20:38:41,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 14 [2022-11-02 20:38:41,703 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:38:41,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:38:42,149 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:38:42,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 36 [2022-11-02 20:38:42,424 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:38:42,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 32 [2022-11-02 20:38:46,743 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:38:46,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 37 [2022-11-02 20:38:46,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:38:46,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-11-02 20:38:46,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 42 [2022-11-02 20:38:46,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 196 treesize of output 180 [2022-11-02 20:38:46,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 176 treesize of output 164 [2022-11-02 20:38:46,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 164 treesize of output 158 [2022-11-02 20:38:46,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 98 [2022-11-02 20:38:47,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025962297] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:38:47,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:38:47,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 51 [2022-11-02 20:38:47,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371144123] [2022-11-02 20:38:47,185 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:38:47,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-02 20:38:47,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:47,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-02 20:38:47,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=4824, Unknown=12, NotChecked=0, Total=5112 [2022-11-02 20:38:47,189 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 47 states have internal predecessors, (107), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:38:50,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:38:50,248 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-11-02 20:38:50,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:38:50,248 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 47 states have internal predecessors, (107), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2022-11-02 20:38:50,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:38:50,249 INFO L225 Difference]: With dead ends: 89 [2022-11-02 20:38:50,249 INFO L226 Difference]: Without dead ends: 89 [2022-11-02 20:38:50,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1793 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=668, Invalid=7510, Unknown=12, NotChecked=0, Total=8190 [2022-11-02 20:38:50,253 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 575 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:38:50,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 887 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 20:38:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-02 20:38:50,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2022-11-02 20:38:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 78 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:38:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-11-02 20:38:50,256 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 66 [2022-11-02 20:38:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:38:50,256 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-11-02 20:38:50,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 47 states have internal predecessors, (107), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:38:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-11-02 20:38:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-02 20:38:50,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:38:50,258 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:50,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-02 20:38:50,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:38:50,473 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:38:50,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:50,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1372895080, now seen corresponding path program 1 times [2022-11-02 20:38:50,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:50,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745661633] [2022-11-02 20:38:50,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:50,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:50,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:38:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:50,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:38:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-02 20:38:50,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:50,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745661633] [2022-11-02 20:38:50,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745661633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:38:50,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:38:50,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:38:50,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859417932] [2022-11-02 20:38:50,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:38:50,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:38:50,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:50,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:38:50,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:38:50,779 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:38:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:38:51,042 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-11-02 20:38:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:38:51,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-11-02 20:38:51,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:38:51,043 INFO L225 Difference]: With dead ends: 81 [2022-11-02 20:38:51,043 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 20:38:51,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:38:51,044 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 172 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:38:51,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 222 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:38:51,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 20:38:51,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-02 20:38:51,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.125) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:38:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-11-02 20:38:51,047 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 67 [2022-11-02 20:38:51,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:38:51,048 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-11-02 20:38:51,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:38:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-11-02 20:38:51,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-02 20:38:51,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:38:51,049 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:51,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-02 20:38:51,049 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:38:51,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:51,050 INFO L85 PathProgramCache]: Analyzing trace with hash -795789539, now seen corresponding path program 1 times [2022-11-02 20:38:51,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:51,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796819552] [2022-11-02 20:38:51,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:51,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:52,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:38:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:52,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:38:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:38:52,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:52,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796819552] [2022-11-02 20:38:52,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796819552] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:38:52,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721782001] [2022-11-02 20:38:52,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:52,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:38:52,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:38:52,614 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:38:52,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-02 20:38:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:53,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-02 20:38:53,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:38:53,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:38:53,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:38:53,206 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:38:53,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:38:53,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:38:53,349 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:38:53,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-11-02 20:38:53,655 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:38:53,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 29 [2022-11-02 20:38:53,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:38:53,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 26 [2022-11-02 20:38:54,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2022-11-02 20:38:54,091 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:38:54,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:38:54,998 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3185 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|) (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2022-11-02 20:38:55,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|) (<= (+ 1 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3183) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_main_~s~0#1.offset|)) |c_#StackHeapBarrier|))) is different from false [2022-11-02 20:38:55,054 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_3183) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2022-11-02 20:38:55,070 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3183) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-11-02 20:38:55,094 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3183) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-11-02 20:38:55,113 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_3183) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2022-11-02 20:38:55,128 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3183) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-11-02 20:38:55,145 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3182 (Array Int Int)) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3182))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3183)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2022-11-02 20:38:55,172 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3182 (Array Int Int)) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (<= (+ (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3182))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3183)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2022-11-02 20:38:55,185 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:38:55,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 36 [2022-11-02 20:38:55,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 292 treesize of output 274 [2022-11-02 20:38:55,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:38:55,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 248 treesize of output 240 [2022-11-02 20:38:55,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:38:55,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 230 treesize of output 214 [2022-11-02 20:38:55,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:38:55,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 210 treesize of output 192 [2022-11-02 20:38:55,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721782001] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:38:55,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:38:55,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 33 [2022-11-02 20:38:55,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723743811] [2022-11-02 20:38:55,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:38:55,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-02 20:38:55,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:38:55,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-02 20:38:55,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1370, Unknown=9, NotChecked=738, Total=2256 [2022-11-02 20:38:55,592 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 30 states have internal predecessors, (95), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:38:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:38:57,455 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-11-02 20:38:57,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:38:57,456 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 30 states have internal predecessors, (95), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 69 [2022-11-02 20:38:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:38:57,457 INFO L225 Difference]: With dead ends: 86 [2022-11-02 20:38:57,457 INFO L226 Difference]: Without dead ends: 86 [2022-11-02 20:38:57,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 91 SyntacticMatches, 7 SemanticMatches, 59 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=296, Invalid=2383, Unknown=9, NotChecked=972, Total=3660 [2022-11-02 20:38:57,460 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 254 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:38:57,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 644 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 20:38:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-02 20:38:57,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2022-11-02 20:38:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 78 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:38:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-11-02 20:38:57,464 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 69 [2022-11-02 20:38:57,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:38:57,464 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-11-02 20:38:57,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.878787878787879) internal successors, (95), 30 states have internal predecessors, (95), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:38:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-11-02 20:38:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-02 20:38:57,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:38:57,466 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:38:57,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-02 20:38:57,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-02 20:38:57,669 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:38:57,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:38:57,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1056399479, now seen corresponding path program 1 times [2022-11-02 20:38:57,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:38:57,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296633660] [2022-11-02 20:38:57,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:57,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:38:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:58,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:38:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:58,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:38:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-02 20:38:58,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:38:58,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296633660] [2022-11-02 20:38:58,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296633660] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:38:58,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076100934] [2022-11-02 20:38:58,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:38:58,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:38:58,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:38:58,961 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:38:58,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-02 20:38:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:38:59,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-02 20:38:59,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:38:59,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:38:59,510 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:38:59,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:38:59,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:38:59,731 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:38:59,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 22 [2022-11-02 20:38:59,979 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:38:59,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 22 [2022-11-02 20:39:00,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 19 [2022-11-02 20:39:00,178 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:39:00,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 16 [2022-11-02 20:39:00,345 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:39:00,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:39:00,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3324) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3325) 0)))) is different from false [2022-11-02 20:39:00,774 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_3324) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3325) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2022-11-02 20:39:00,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3324) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3325) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2022-11-02 20:39:00,814 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3324) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3325) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2022-11-02 20:39:00,823 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_3324) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 4) v_ArrVal_3325) 0)))) is different from false [2022-11-02 20:39:00,838 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3324) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_3325) 0)))) is different from false [2022-11-02 20:39:00,846 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3323))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3324)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_3325) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) is different from false [2022-11-02 20:39:00,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3323))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3324)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3325) 0)))) is different from false [2022-11-02 20:39:00,869 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:39:00,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 35 [2022-11-02 20:39:00,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 161 treesize of output 149 [2022-11-02 20:39:00,888 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:39:00,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 162 treesize of output 158 [2022-11-02 20:39:00,909 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:39:00,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 158 treesize of output 157 [2022-11-02 20:39:00,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 174 treesize of output 170 [2022-11-02 20:39:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 7 not checked. [2022-11-02 20:39:01,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076100934] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:39:01,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:39:01,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 26] total 58 [2022-11-02 20:39:01,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007013922] [2022-11-02 20:39:01,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:39:01,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-11-02 20:39:01,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:39:01,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-11-02 20:39:01,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2296, Unknown=8, NotChecked=824, Total=3306 [2022-11-02 20:39:01,707 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 51 states have internal predecessors, (134), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-02 20:39:03,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:39:03,450 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2022-11-02 20:39:03,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:39:03,451 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 51 states have internal predecessors, (134), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 70 [2022-11-02 20:39:03,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:39:03,452 INFO L225 Difference]: With dead ends: 125 [2022-11-02 20:39:03,452 INFO L226 Difference]: Without dead ends: 125 [2022-11-02 20:39:03,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 108 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=305, Invalid=3751, Unknown=8, NotChecked=1048, Total=5112 [2022-11-02 20:39:03,454 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 177 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1021 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:39:03,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 891 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 837 Invalid, 0 Unknown, 1021 Unchecked, 0.6s Time] [2022-11-02 20:39:03,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-02 20:39:03,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 79. [2022-11-02 20:39:03,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 75 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:39:03,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-11-02 20:39:03,458 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 70 [2022-11-02 20:39:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:39:03,458 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-11-02 20:39:03,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 51 states have internal predecessors, (134), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-02 20:39:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-11-02 20:39:03,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-02 20:39:03,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:39:03,460 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:39:03,502 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-02 20:39:03,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-02 20:39:03,677 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-11-02 20:39:03,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:39:03,677 INFO L85 PathProgramCache]: Analyzing trace with hash 853476134, now seen corresponding path program 1 times [2022-11-02 20:39:03,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:39:03,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559529356] [2022-11-02 20:39:03,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:39:03,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:39:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:06,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:39:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:06,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:39:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:39:06,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:39:06,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559529356] [2022-11-02 20:39:06,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559529356] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:39:06,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913698049] [2022-11-02 20:39:06,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:39:06,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:39:06,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:39:06,315 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:39:06,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d73e87f8-c76d-4e4e-b068-db5421003f66/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-02 20:39:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:39:06,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 126 conjunts are in the unsatisfiable core [2022-11-02 20:39:06,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:39:06,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:39:06,840 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:39:06,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:39:06,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:39:06,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:39:07,086 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:39:07,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 33 [2022-11-02 20:39:07,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 22 [2022-11-02 20:39:07,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:39:07,734 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:39:07,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 57 [2022-11-02 20:39:07,763 INFO L356 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-11-02 20:39:07,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-11-02 20:39:08,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:39:08,051 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:39:08,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-11-02 20:39:08,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-02 20:39:08,707 INFO L356 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2022-11-02 20:39:08,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 42 [2022-11-02 20:39:08,723 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:39:08,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:39:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-02 20:39:09,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:39:09,973 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_destroy_~head#1.base|) |c_ULTIMATE.start_sll_circular_destroy_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse1 (select |c_#memory_$Pointer$.base| .cse2))) (and (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= (select .cse0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_destroy_~head#1.offset|))) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_sll_circular_destroy_~head#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_destroy_~head#1.base| (select .cse1 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)))) (or (= .cse2 |c_ULTIMATE.start_sll_circular_destroy_~head#1.base|) (and (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= (select .cse0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_destroy_~head#1.offset|))) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_sll_circular_destroy_~head#1.base| (select .cse1 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0))))))))) is different from false [2022-11-02 20:39:11,705 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (forall ((v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3477) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_3476)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)))) (forall ((v_ArrVal_3476 Int)) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_3476)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3477) .cse2) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)))) (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|)))) (forall ((v_ArrVal_3476 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_3476)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select .cse3 .cse4) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)))) (= .cse4 |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse0 .cse1 v_ArrVal_3476)))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)))))) is different from false [2022-11-02 20:39:11,890 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_3476 Int)) (let ((.cse0 (select (store .cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int)) (or (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) (select (store .cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_3476 Int)) (let ((.cse3 (store .cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse3) .cse2) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (let ((.cse4 (store .cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse4) (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-02 20:39:12,276 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse3 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (forall ((v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse2 .cse3 v_ArrVal_3474)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_3474 Int) (v_ArrVal_3471 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse4 .cse3 v_ArrVal_3471)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse2 .cse3 v_ArrVal_3474)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_3474 Int) (v_ArrVal_3471 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_3476 Int)) (let ((.cse5 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse2 .cse3 v_ArrVal_3474)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse4 .cse3 v_ArrVal_3471)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) .cse5) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse5 |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_3476 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store .cse2 .cse3 v_ArrVal_3474)))) (let ((.cse7 (store (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store .cse6 |c_ULTIMATE.start_main_~s~0#1.base| .cse7) .cse8) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (= .cse8 |c_ULTIMATE.start_main_~s~0#1.base|)))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-02 20:39:12,551 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store .cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_3474 Int) (v_ArrVal_3471 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store .cse3 .cse4 v_ArrVal_3471)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store .cse2 .cse4 v_ArrVal_3474)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_3476 Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store .cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store .cse5 |c_ULTIMATE.start_main_~s~0#1.base| .cse6) .cse7) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (= .cse7 |c_ULTIMATE.start_main_~s~0#1.base|)))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_3474 Int) (v_ArrVal_3471 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_3476 Int)) (let ((.cse9 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (let ((.cse8 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store .cse2 .cse9 v_ArrVal_3474)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse8 |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store .cse3 .cse9 v_ArrVal_3471)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) .cse8) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43|)))))) is different from false [2022-11-02 20:39:12,770 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse2) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse3) (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))) (let ((.cse7 (store (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (select (store .cse6 |c_ULTIMATE.start_main_~s~0#1.base| .cse7) (select .cse7 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse3) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_3471 Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse3) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse9 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse4 (store .cse8 .cse9 v_ArrVal_3471)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse9 v_ArrVal_3474)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_3471 Int)) (let ((.cse11 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (let ((.cse10 (select (store (select (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse11 v_ArrVal_3474)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse3) (= .cse10 |c_ULTIMATE.start_main_~s~0#1.base|) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 (store .cse8 .cse11 v_ArrVal_3471)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) .cse10) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) is different from false [2022-11-02 20:39:13,067 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse5 (select |c_#memory_$Pointer$.base| .cse4)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse2) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse3) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_3471 Int)) (let ((.cse7 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (let ((.cse8 (select (store (select (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse7 v_ArrVal_3474)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 (store .cse6 .cse7 v_ArrVal_3471)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) .cse8) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= .cse8 |c_ULTIMATE.start_main_~s~0#1.base|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse3) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (= (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))) (let ((.cse10 (store (select .cse9 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (select (store .cse9 |c_ULTIMATE.start_main_~s~0#1.base| .cse10) (select .cse10 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse3) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_3471 Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse11 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse4 (store .cse6 .cse11 v_ArrVal_3471)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse11 v_ArrVal_3474)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse3) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-11-02 20:39:13,226 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse3)) (.cse4 (select |c_#memory_$Pointer$.base| .cse3))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse0) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse3 (store .cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (select (store .cse1 |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse2) (select .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse3 (store .cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse0) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store .cse5 |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse6) .cse7) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse7)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_3471 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse0) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select (let ((.cse9 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store .cse8 .cse9 v_ArrVal_3471)) |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store .cse4 .cse9 v_ArrVal_3474)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_3471 Int)) (let ((.cse10 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (let ((.cse11 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store .cse4 .cse10 v_ArrVal_3474)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse0) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store .cse8 .cse10 v_ArrVal_3471)) |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_3477) .cse11) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse11)))))))) is different from false [2022-11-02 20:39:13,402 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse3 (select |c_#memory_$Pointer$.base| .cse2))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (select (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse4) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))) (let ((.cse7 (store (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse5) (= (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse7) .cse5) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse4) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_3471 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse4) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (let ((.cse9 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store .cse8 .cse9 v_ArrVal_3471)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 .cse9 v_ArrVal_3474)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_3471 Int)) (let ((.cse11 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (let ((.cse10 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 .cse11 v_ArrVal_3474)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse10) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse4) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 (store .cse8 .cse11 v_ArrVal_3471)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_3477) .cse10) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))))))))) is different from false [2022-11-02 20:39:13,705 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse3 (select .cse1 .cse2)) (.cse6 (select .cse5 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_3471 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse0) (= (select (let ((.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store .cse1 .cse2 (store .cse3 .cse4 v_ArrVal_3471)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_3477) (select (store (select (store .cse5 .cse2 (store .cse6 .cse4 v_ArrVal_3474)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse0) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (let ((.cse7 (store .cse5 .cse2 (store .cse6 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))) (let ((.cse8 (store (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (select (store .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse8) (select .cse8 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse10 (store .cse5 .cse2 (store .cse6 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))) (let ((.cse11 (store (select .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse9 (select .cse11 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse0) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse9) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse11) .cse9) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_3471 Int)) (let ((.cse12 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (let ((.cse13 (select (store (select (store .cse5 .cse2 (store .cse6 .cse12 v_ArrVal_3474)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse0) (= (select (select (store (store .cse1 .cse2 (store .cse3 .cse12 v_ArrVal_3471)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_3477) .cse13) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse13))))))))) is different from false [2022-11-02 20:39:14,141 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse7 (select .cse6 .cse3)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse4 (select .cse2 .cse3))) (and (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (let ((.cse0 (store .cse2 .cse3 (store .cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (select (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse5))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_3471 Int)) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= (select (let ((.cse8 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store .cse6 .cse3 (store .cse7 .cse8 v_ArrVal_3471)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_3477) (select (store (select (store .cse2 .cse3 (store .cse4 .cse8 v_ArrVal_3474)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse5))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_3471 Int)) (let ((.cse10 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (let ((.cse9 (select (store (select (store .cse2 .cse3 (store .cse4 .cse10 v_ArrVal_3474)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse9) (= (select (select (store (store .cse6 .cse3 (store .cse7 .cse10 v_ArrVal_3471)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_3477) .cse9) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse5))))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse11 (store .cse2 .cse3 (store .cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))) (let ((.cse12 (store (select .cse11 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse12) .cse13) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse13) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| .cse5)))))))))) is different from false [2022-11-02 20:39:54,053 WARN L234 SmtUtils]: Spent 39.81s on a formula simplification. DAG size of input: 536 DAG size of output: 319 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-02 20:39:54,054 INFO L356 Elim1Store]: treesize reduction 1691, result has 37.3 percent of original size [2022-11-02 20:39:54,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 5 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 13 new quantified variables, introduced 40 case distinctions, treesize of input 55167 treesize of output 22802