./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/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_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- 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:28:43,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:28:43,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:28:43,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:28:43,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:28:43,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:28:43,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:28:43,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:28:43,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:28:43,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:28:43,859 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:28:43,860 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:28:43,860 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:28:43,862 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:28:43,863 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:28:43,864 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:28:43,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:28:43,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:28:43,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:28:43,871 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:28:43,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:28:43,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:28:43,877 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:28:43,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:28:43,882 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:28:43,883 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:28:43,883 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:28:43,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:28:43,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:28:43,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:28:43,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:28:43,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:28:43,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:28:43,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:28:43,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:28:43,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:28:43,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:28:43,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:28:43,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:28:43,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:28:43,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:28:43,896 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:28:43,921 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:28:43,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:28:43,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:28:43,922 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:28:43,923 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:28:43,923 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:28:43,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:28:43,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:28:43,924 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:28:43,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:28:43,925 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:28:43,925 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:28:43,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:28:43,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:28:43,926 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:28:43,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:28:43,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:28:43,926 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:28:43,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:28:43,927 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:28:43,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:28:43,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:28:43,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:28:43,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:28:43,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:28:43,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:28:43,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:28:43,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:28:43,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:28:43,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:28:43,929 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:28:43,929 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:28:43,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:28:43,929 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_02088c24-129c-4a2b-bc71-ceb1fd014633/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_02088c24-129c-4a2b-bc71-ceb1fd014633/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 ! call(reach_error())) ) 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2022-11-02 20:28:44,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:28:44,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:28:44,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:28:44,336 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:28:44,337 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:28:44,339 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2022-11-02 20:28:44,421 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/data/0274cb18f/9f93ddc94b4e43a7b912b3250058f6cb/FLAG0c8de4347 [2022-11-02 20:28:45,169 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:28:45,170 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2022-11-02 20:28:45,195 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/data/0274cb18f/9f93ddc94b4e43a7b912b3250058f6cb/FLAG0c8de4347 [2022-11-02 20:28:45,428 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/data/0274cb18f/9f93ddc94b4e43a7b912b3250058f6cb [2022-11-02 20:28:45,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:28:45,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:28:45,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:28:45,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:28:45,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:28:45,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:28:45" (1/1) ... [2022-11-02 20:28:45,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b0fdb94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:45, skipping insertion in model container [2022-11-02 20:28:45,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:28:45" (1/1) ... [2022-11-02 20:28:45,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:28:45,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:28:45,924 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_02088c24-129c-4a2b-bc71-ceb1fd014633/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2022-11-02 20:28:45,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:28:45,948 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:28:46,049 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_02088c24-129c-4a2b-bc71-ceb1fd014633/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i[25148,25161] [2022-11-02 20:28:46,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:28:46,098 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:28:46,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:46 WrapperNode [2022-11-02 20:28:46,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:28:46,100 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:28:46,100 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:28:46,100 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:28:46,110 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:28:46" (1/1) ... [2022-11-02 20:28:46,156 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:28:46" (1/1) ... [2022-11-02 20:28:46,200 INFO L138 Inliner]: procedures = 127, calls = 58, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 185 [2022-11-02 20:28:46,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:28:46,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:28:46,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:28:46,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:28:46,213 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:46" (1/1) ... [2022-11-02 20:28:46,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:46" (1/1) ... [2022-11-02 20:28:46,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:46" (1/1) ... [2022-11-02 20:28:46,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:46" (1/1) ... [2022-11-02 20:28:46,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:46" (1/1) ... [2022-11-02 20:28:46,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:46" (1/1) ... [2022-11-02 20:28:46,260 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:46" (1/1) ... [2022-11-02 20:28:46,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:46" (1/1) ... [2022-11-02 20:28:46,266 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:28:46,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:28:46,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:28:46,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:28:46,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:46" (1/1) ... [2022-11-02 20:28:46,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:28:46,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:28:46,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:28:46,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:28:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:28:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:28:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 20:28:46,366 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 20:28:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:28:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:28:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:28:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:28:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:28:46,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:28:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:28:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:28:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:28:46,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:28:46,583 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:28:46,586 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:28:47,099 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:28:47,107 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:28:47,108 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-02 20:28:47,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:28:47 BoogieIcfgContainer [2022-11-02 20:28:47,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:28:47,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:28:47,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:28:47,126 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:28:47,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:28:45" (1/3) ... [2022-11-02 20:28:47,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63805f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:28:47, skipping insertion in model container [2022-11-02 20:28:47,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:28:46" (2/3) ... [2022-11-02 20:28:47,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63805f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:28:47, skipping insertion in model container [2022-11-02 20:28:47,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:28:47" (3/3) ... [2022-11-02 20:28:47,131 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2022-11-02 20:28:47,154 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:28:47,154 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-02 20:28:47,251 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:28:47,262 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@385dbd75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:28:47,263 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-02 20:28:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 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:28:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:28:47,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:47,284 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:47,285 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:47,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:47,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1243287101, now seen corresponding path program 1 times [2022-11-02 20:28:47,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:47,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844397929] [2022-11-02 20:28:47,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:47,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:47,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:28:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:47,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:28:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:28:47,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:47,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844397929] [2022-11-02 20:28:47,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844397929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:47,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:47,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:28:47,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285211906] [2022-11-02 20:28:47,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:47,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:28:47,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:47,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:28:47,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:28:47,809 INFO L87 Difference]: Start difference. First operand has 44 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 39 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:28:47,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:47,998 INFO L93 Difference]: Finished difference Result 79 states and 114 transitions. [2022-11-02 20:28:48,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:28:48,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-11-02 20:28:48,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:48,017 INFO L225 Difference]: With dead ends: 79 [2022-11-02 20:28:48,017 INFO L226 Difference]: Without dead ends: 36 [2022-11-02 20:28:48,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:28:48,025 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:48,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:28:48,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-02 20:28:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-02 20:28:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:28:48,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-11-02 20:28:48,081 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 25 [2022-11-02 20:28:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:48,085 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-11-02 20:28:48,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:28:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-11-02 20:28:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:28:48,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:48,091 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:28:48,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:28:48,092 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:48,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:48,093 INFO L85 PathProgramCache]: Analyzing trace with hash -709703190, now seen corresponding path program 1 times [2022-11-02 20:28:48,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:48,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738295912] [2022-11-02 20:28:48,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:48,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:48,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:28:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:48,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:28:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:28:48,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:48,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738295912] [2022-11-02 20:28:48,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738295912] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:48,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:48,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:28:48,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054457870] [2022-11-02 20:28:48,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:48,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:28:48,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:48,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:28:48,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:28:48,608 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:28:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:48,755 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2022-11-02 20:28:48,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:28:48,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-11-02 20:28:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:48,758 INFO L225 Difference]: With dead ends: 68 [2022-11-02 20:28:48,758 INFO L226 Difference]: Without dead ends: 41 [2022-11-02 20:28:48,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:28:48,760 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:48,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 104 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:28:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-02 20:28:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-11-02 20:28:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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:28:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-11-02 20:28:48,771 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 25 [2022-11-02 20:28:48,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:48,772 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-11-02 20:28:48,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:28:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-11-02 20:28:48,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:28:48,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:48,774 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:28:48,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:28:48,774 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:48,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:48,775 INFO L85 PathProgramCache]: Analyzing trace with hash -37646058, now seen corresponding path program 1 times [2022-11-02 20:28:48,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:48,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353291842] [2022-11-02 20:28:48,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:48,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:49,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:28:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:49,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:28:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:49,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:28:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:28:49,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:49,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353291842] [2022-11-02 20:28:49,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353291842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:28:49,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:28:49,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:28:49,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509082020] [2022-11-02 20:28:49,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:28:49,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:28:49,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:28:49,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:28:49,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:28:49,231 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:28:49,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:28:49,396 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2022-11-02 20:28:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:28:49,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-11-02 20:28:49,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:28:49,399 INFO L225 Difference]: With dead ends: 67 [2022-11-02 20:28:49,399 INFO L226 Difference]: Without dead ends: 53 [2022-11-02 20:28:49,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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:28:49,401 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:28:49,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 130 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:28:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-02 20:28:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2022-11-02 20:28:49,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 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:28:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2022-11-02 20:28:49,418 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 35 [2022-11-02 20:28:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:28:49,419 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2022-11-02 20:28:49,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:28:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2022-11-02 20:28:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:28:49,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:28:49,423 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:28:49,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:28:49,424 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:28:49,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:28:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash 368663721, now seen corresponding path program 1 times [2022-11-02 20:28:49,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:28:49,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618695537] [2022-11-02 20:28:49,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:49,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:28:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:55,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:28:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:55,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:28:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:55,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:28:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:28:56,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:28:56,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618695537] [2022-11-02 20:28:56,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618695537] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:28:56,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622055428] [2022-11-02 20:28:56,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:28:56,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:28:56,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:28:56,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:28:56,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:28:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:28:57,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 192 conjunts are in the unsatisfiable core [2022-11-02 20:28:57,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:28:57,675 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:28:58,066 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:28:58,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:28:58,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:28:58,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-02 20:28:58,294 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 13 treesize of output 9 [2022-11-02 20:28:58,510 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:28:58,510 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:28:58,737 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:28:58,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:28:58,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:28:58,980 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:28:58,981 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 64 treesize of output 57 [2022-11-02 20:28:58,996 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 25 treesize of output 25 [2022-11-02 20:28:59,029 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:28:59,467 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:28:59,468 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 73 [2022-11-02 20:28:59,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:28:59,480 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 26 treesize of output 23 [2022-11-02 20:28:59,486 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 18 [2022-11-02 20:28:59,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:28:59,497 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 28 [2022-11-02 20:28:59,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 21 [2022-11-02 20:28:59,900 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-02 20:28:59,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 53 [2022-11-02 20:28:59,912 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 7 treesize of output 3 [2022-11-02 20:28:59,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:28:59,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:28:59,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-02 20:29:00,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:00,470 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-02 20:29:00,471 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 119 treesize of output 101 [2022-11-02 20:29:00,520 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-02 20:29:00,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-02 20:29:00,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:29:00,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:00,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:00,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-11-02 20:29:01,588 INFO L356 Elim1Store]: treesize reduction 72, result has 20.0 percent of original size [2022-11-02 20:29:01,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 291 treesize of output 172 [2022-11-02 20:29:01,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:01,694 INFO L356 Elim1Store]: treesize reduction 74, result has 17.8 percent of original size [2022-11-02 20:29:01,695 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 298 treesize of output 233 [2022-11-02 20:29:01,714 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 9 treesize of output 7 [2022-11-02 20:29:01,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 73 [2022-11-02 20:29:01,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:01,836 INFO L356 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2022-11-02 20:29:01,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 205 treesize of output 160 [2022-11-02 20:29:01,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:01,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:01,897 INFO L356 Elim1Store]: treesize reduction 54, result has 27.0 percent of original size [2022-11-02 20:29:01,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 162 [2022-11-02 20:29:01,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:01,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-11-02 20:29:01,952 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 10 treesize of output 9 [2022-11-02 20:29:02,117 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:29:02,118 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 46 [2022-11-02 20:29:02,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:02,147 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:29:02,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2022-11-02 20:29:02,234 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 15 treesize of output 7 [2022-11-02 20:29:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:29:02,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:29:02,505 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_751 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_751)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_735))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4) v_ArrVal_752))) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_745) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_744) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-02 20:29:02,584 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_751 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| Int) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| v_ArrVal_751)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_735))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| 4) v_ArrVal_752))) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_745) .cse1 v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_744) .cse1 v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (not (<= |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| (select .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))))) is different from false [2022-11-02 20:29:02,620 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_751 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| Int) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_730 (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (<= |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| (select .cse0 .cse1))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse3 (select .cse5 .cse1))) (select (select (let ((.cse2 (store (store |c_#memory_int| .cse4 (store (select |c_#memory_int| .cse4) .cse1 v_ArrVal_751)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_735))) (store .cse2 .cse3 (store (select .cse2 .cse3) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| 4) v_ArrVal_752))) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_745) .cse3 v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse4 (store .cse0 .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_744) .cse3 v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2022-11-02 20:29:02,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int)) (v_ArrVal_731 (Array Int Int)) (v_ArrVal_763 (Array Int Int)) (v_ArrVal_730 (Array Int Int)) (v_ArrVal_744 (Array Int Int)) (v_ArrVal_752 Int) (v_ArrVal_751 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_745 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| Int) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8| Int)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8| v_ArrVal_763))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8| v_ArrVal_761)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse8 (select .cse7 .cse3)) (.cse4 (select (select .cse7 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8|) 0)) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select .cse5 .cse3))) (let ((.cse1 (select .cse6 .cse4))) (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8| v_ArrVal_762))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_751))) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8| v_ArrVal_735))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| 4) v_ArrVal_752))) (select (select (store (store (store .cse5 .cse3 (store .cse6 .cse4 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8| v_ArrVal_745) .cse1 v_ArrVal_731) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store .cse7 .cse3 (store .cse8 .cse4 0)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_8| v_ArrVal_744) .cse1 v_ArrVal_730) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (<= |v_ULTIMATE.start_dll_circular_insert_~last~1#1.offset_7| (select .cse8 .cse4)))))))) is different from false [2022-11-02 20:29:02,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622055428] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:29:02,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:29:02,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 44 [2022-11-02 20:29:02,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187506586] [2022-11-02 20:29:02,841 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:29:02,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-02 20:29:02,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:02,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-02 20:29:02,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1846, Unknown=6, NotChecked=356, Total=2352 [2022-11-02 20:29:02,844 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 44 states, 40 states have (on average 1.35) internal successors, (54), 35 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:29:07,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:07,230 INFO L93 Difference]: Finished difference Result 78 states and 107 transitions. [2022-11-02 20:29:07,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:29:07,231 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 40 states have (on average 1.35) internal successors, (54), 35 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2022-11-02 20:29:07,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:07,234 INFO L225 Difference]: With dead ends: 78 [2022-11-02 20:29:07,234 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 20:29:07,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=222, Invalid=2650, Unknown=6, NotChecked=428, Total=3306 [2022-11-02 20:29:07,237 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 91 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:07,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 432 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1059 Invalid, 0 Unknown, 57 Unchecked, 2.5s Time] [2022-11-02 20:29:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 20:29:07,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2022-11-02 20:29:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:29:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2022-11-02 20:29:07,253 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 36 [2022-11-02 20:29:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:07,254 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2022-11-02 20:29:07,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 40 states have (on average 1.35) internal successors, (54), 35 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:29:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-11-02 20:29:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:29:07,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:07,256 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:29:07,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:29:07,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:29:07,479 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:07,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:07,480 INFO L85 PathProgramCache]: Analyzing trace with hash -220702884, now seen corresponding path program 1 times [2022-11-02 20:29:07,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:07,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909242928] [2022-11-02 20:29:07,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:07,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:07,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:29:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:07,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:29:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:07,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:29:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:29:07,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:07,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909242928] [2022-11-02 20:29:07,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909242928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:07,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:07,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:29:07,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975076767] [2022-11-02 20:29:07,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:07,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:29:07,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:07,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:29:07,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:29:07,905 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:29:08,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:08,009 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2022-11-02 20:29:08,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:29:08,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2022-11-02 20:29:08,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:08,011 INFO L225 Difference]: With dead ends: 70 [2022-11-02 20:29:08,011 INFO L226 Difference]: Without dead ends: 53 [2022-11-02 20:29:08,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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:29:08,012 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 28 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:08,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:29:08,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-02 20:29:08,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-02 20:29:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:29:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 70 transitions. [2022-11-02 20:29:08,025 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 70 transitions. Word has length 37 [2022-11-02 20:29:08,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:08,026 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 70 transitions. [2022-11-02 20:29:08,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:29:08,026 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-11-02 20:29:08,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:29:08,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:08,028 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:29:08,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:29:08,028 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:08,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:08,029 INFO L85 PathProgramCache]: Analyzing trace with hash 79364982, now seen corresponding path program 2 times [2022-11-02 20:29:08,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:08,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503386019] [2022-11-02 20:29:08,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:08,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:08,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:29:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:08,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:29:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:08,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:29:08,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:29:08,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:08,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503386019] [2022-11-02 20:29:08,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503386019] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:29:08,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:29:08,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:29:08,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736590460] [2022-11-02 20:29:08,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:29:08,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:29:08,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:08,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:29:08,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:29:08,300 INFO L87 Difference]: Start difference. First operand 53 states and 70 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:29:08,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:08,412 INFO L93 Difference]: Finished difference Result 71 states and 95 transitions. [2022-11-02 20:29:08,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:29:08,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2022-11-02 20:29:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:08,414 INFO L225 Difference]: With dead ends: 71 [2022-11-02 20:29:08,414 INFO L226 Difference]: Without dead ends: 53 [2022-11-02 20:29:08,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:29:08,415 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 75 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:08,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 86 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:29:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-02 20:29:08,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-02 20:29:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:29:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-11-02 20:29:08,444 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 37 [2022-11-02 20:29:08,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:08,446 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-11-02 20:29:08,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:29:08,446 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-11-02 20:29:08,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:29:08,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:08,448 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:29:08,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:29:08,449 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:08,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:08,449 INFO L85 PathProgramCache]: Analyzing trace with hash -599029201, now seen corresponding path program 1 times [2022-11-02 20:29:08,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:08,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79755705] [2022-11-02 20:29:08,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:08,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:29:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:08,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:29:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:08,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:29:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:08,940 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:29:08,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:08,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79755705] [2022-11-02 20:29:08,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79755705] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:29:08,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383306493] [2022-11-02 20:29:08,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:08,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:29:08,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:29:08,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:29:08,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:29:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:09,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 20:29:09,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:29:09,491 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 15 treesize of output 7 [2022-11-02 20:29:09,494 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 15 treesize of output 7 [2022-11-02 20:29:09,540 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:29:09,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:29:09,651 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:29:09,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383306493] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:29:09,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:29:09,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-11-02 20:29:09,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016650443] [2022-11-02 20:29:09,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:29:09,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:29:09,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:09,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:29:09,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:29:09,657 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:29:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:09,895 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-11-02 20:29:09,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:29:09,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-11-02 20:29:09,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:09,897 INFO L225 Difference]: With dead ends: 82 [2022-11-02 20:29:09,898 INFO L226 Difference]: Without dead ends: 67 [2022-11-02 20:29:09,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:29:09,899 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 19 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:09,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 181 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:29:09,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-02 20:29:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2022-11-02 20:29:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:29:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-11-02 20:29:09,913 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 38 [2022-11-02 20:29:09,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:09,914 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-11-02 20:29:09,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:29:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-11-02 20:29:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:29:09,916 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:09,916 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:29:09,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:29:10,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:29:10,131 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:10,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:10,132 INFO L85 PathProgramCache]: Analyzing trace with hash -541770899, now seen corresponding path program 1 times [2022-11-02 20:29:10,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:10,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200590257] [2022-11-02 20:29:10,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:10,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:10,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:29:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:10,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:29:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:10,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:29:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:29:10,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:10,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200590257] [2022-11-02 20:29:10,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200590257] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:29:10,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346639572] [2022-11-02 20:29:10,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:10,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:29:10,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:29:10,739 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:29:10,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:29:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:11,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-02 20:29:11,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:29:11,608 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:29:11,685 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((v_ArrVal_2639 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2639) |c_#memory_$Pointer$.base|)))) is different from true [2022-11-02 20:29:11,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:11,728 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 24 treesize of output 24 [2022-11-02 20:29:11,794 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:29:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-02 20:29:11,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:29:12,004 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_19| Int) (v_ArrVal_2642 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_2642) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (not (< |v_node_create_~temp~0#1.base_19| |c_#StackHeapBarrier|)) (<= 1 .cse0)))) is different from false [2022-11-02 20:29:12,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346639572] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:29:12,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:29:12,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2022-11-02 20:29:12,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613248694] [2022-11-02 20:29:12,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:29:12,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 20:29:12,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:29:12,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:29:12,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=622, Unknown=2, NotChecked=102, Total=812 [2022-11-02 20:29:12,011 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:29:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:29:12,772 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2022-11-02 20:29:12,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:29:12,772 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-11-02 20:29:12,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:29:12,773 INFO L225 Difference]: With dead ends: 67 [2022-11-02 20:29:12,773 INFO L226 Difference]: Without dead ends: 51 [2022-11-02 20:29:12,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=155, Invalid=1041, Unknown=2, NotChecked=134, Total=1332 [2022-11-02 20:29:12,775 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 40 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:29:12,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 346 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 255 Invalid, 0 Unknown, 44 Unchecked, 0.3s Time] [2022-11-02 20:29:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-02 20:29:12,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-02 20:29:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-02 20:29:12,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-11-02 20:29:12,795 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 38 [2022-11-02 20:29:12,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:29:12,795 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-11-02 20:29:12,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.0) internal successors, (50), 21 states have internal predecessors, (50), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:29:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-11-02 20:29:12,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:29:12,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:29:12,800 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:29:12,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:29:13,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:29:13,020 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:29:13,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:29:13,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1955198847, now seen corresponding path program 1 times [2022-11-02 20:29:13,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:29:13,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030375382] [2022-11-02 20:29:13,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:13,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:29:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:17,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:29:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:17,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:29:17,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:17,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-02 20:29:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:18,144 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:29:18,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:29:18,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030375382] [2022-11-02 20:29:18,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030375382] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:29:18,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293074515] [2022-11-02 20:29:18,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:29:18,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:29:18,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:29:18,147 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:29:18,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02088c24-129c-4a2b-bc71-ceb1fd014633/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:29:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:29:19,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 170 conjunts are in the unsatisfiable core [2022-11-02 20:29:19,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:29:19,497 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:29:19,511 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:29:19,712 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-11-02 20:29:19,716 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2022-11-02 20:29:19,751 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-11-02 20:29:19,754 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2022-11-02 20:29:19,817 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2022-11-02 20:29:19,820 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))))) (= |c_#valid| |c_old(#valid)|)) is different from true [2022-11-02 20:29:19,856 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2022-11-02 20:29:19,859 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2022-11-02 20:29:19,953 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))))))) is different from false [2022-11-02 20:29:19,956 WARN L855 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0))))))) is different from true [2022-11-02 20:29:20,085 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from false [2022-11-02 20:29:20,089 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) is different from true [2022-11-02 20:29:20,156 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 11 treesize of output 7 [2022-11-02 20:29:20,187 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-02 20:29:20,193 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-02 20:29:20,260 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:29:20,261 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 36 treesize of output 35 [2022-11-02 20:29:20,319 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse0 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-02 20:29:20,323 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse0 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-02 20:29:20,424 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse0 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-02 20:29:20,428 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse0 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-02 20:29:20,555 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:29:20,555 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 35 [2022-11-02 20:29:20,591 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| .cse2) 0)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))))) is different from false [2022-11-02 20:29:20,595 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| .cse2) 0)) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) 0))))) is different from true [2022-11-02 20:29:20,696 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) 0)) (.cse0 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) 0) .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse3 1)) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse3) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2022-11-02 20:29:20,702 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse3) 0)) (.cse0 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) 0) .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse3 1)) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse3) 0))) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_dll_circular_insert_~data#1|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2022-11-02 20:29:20,755 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-02 20:29:20,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 25 [2022-11-02 20:29:20,767 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 7 treesize of output 3 [2022-11-02 20:29:20,814 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|))) is different from false [2022-11-02 20:29:20,823 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|))) is different from true [2022-11-02 20:29:20,915 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0))) is different from false [2022-11-02 20:29:20,919 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0))) is different from true [2022-11-02 20:29:21,076 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 13 treesize of output 9 [2022-11-02 20:29:21,103 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (exists ((v_ArrVal_2940 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2940))) (exists ((v_ArrVal_2943 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2943) |c_#memory_$Pointer$.base|)) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 8)) |c_node_create_#in~data#1|))) is different from false [2022-11-02 20:29:21,108 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_node_create_#res#1.offset| 0) (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_17) 1) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_18) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_17) 0))) (exists ((v_ArrVal_2940 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2940))) (exists ((v_ArrVal_2943 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2943) |c_#memory_$Pointer$.base|)) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 8)) |c_node_create_#in~data#1|))) is different from true [2022-11-02 20:29:21,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:21,234 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:29:21,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:21,304 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-02 20:29:21,304 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 69 [2022-11-02 20:29:21,462 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (.cse2 (+ 2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))))) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 8))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select (store |v_#valid_BEFORE_CALL_8| .cse1 1) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 0))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_18) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_17) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_17) 1)))))) is different from false [2022-11-02 20:29:21,469 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) 0)) (.cse2 (+ 2 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 0) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))))) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 8))) (= |c_ULTIMATE.start_dll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse4 (select |v_#valid_BEFORE_CALL_8| .cse4))) |v_#valid_BEFORE_CALL_8|) (= (select (store |v_#valid_BEFORE_CALL_8| .cse1 1) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 0))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_18) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_17) 0) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_17) 1)))))) is different from true [2022-11-02 20:29:21,670 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (= .cse0 0) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) .cse2) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_18) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_17) 0) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_17) 1))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse2) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_8| .cse2 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 0)))))) is different from false [2022-11-02 20:29:21,676 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) 0))) (and (= .cse0 0) (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) .cse2) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_18) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_17) 0) (<= .cse3 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_17) 1))) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| .cse2) (= |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| .cse0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_8| .cse2 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 0)))))) is different from true [2022-11-02 20:29:21,938 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse2 (select .cse0 0))) (and (= (select .cse0 .cse1) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= .cse1 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) 0) .cse3) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_18) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_17) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_17) 1))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse1) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6)))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_8| .cse3 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse3) 0))))))) is different from false [2022-11-02 20:29:21,943 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse3))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| 2)) (.cse2 (select .cse0 0))) (and (= (select .cse0 .cse1) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (= .cse1 0) (= (select (select |c_#memory_$Pointer$.base| .cse2) 0) .cse3) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 8))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 0) (<= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_18) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_17) 0) (<= .cse4 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_17) 1))) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| .cse1) (= |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| .cse3) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse6 (select |v_#valid_BEFORE_CALL_7| .cse6)))))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select (store |v_#valid_BEFORE_CALL_8| .cse3 1) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) 0) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse3) 0))))))) is different from true [2022-11-02 20:29:22,269 INFO L356 Elim1Store]: treesize reduction 72, result has 20.0 percent of original size [2022-11-02 20:29:22,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 192 treesize of output 121 [2022-11-02 20:29:22,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:22,422 INFO L356 Elim1Store]: treesize reduction 74, result has 17.8 percent of original size [2022-11-02 20:29:22,423 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 219 treesize of output 156 [2022-11-02 20:29:22,490 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 9 treesize of output 7 [2022-11-02 20:29:22,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:22,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:22,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:22,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:22,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 39 [2022-11-02 20:29:22,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 49 [2022-11-02 20:29:22,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:22,535 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2022-11-02 20:29:22,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:22,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:22,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:22,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:22,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:22,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:22,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2022-11-02 20:29:22,647 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) 0))) (let ((.cse1 (+ 2 .cse0))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_int| .cse0) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))))) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 0) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_18) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_17) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_17) 1))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_22) 0) (= (select (store |v_#valid_BEFORE_CALL_8| .cse3 1) .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_22) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse3) 0))))))) is different from false [2022-11-02 20:29:22,653 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse3) 0))) (let ((.cse1 (+ 2 .cse0))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_int| .cse0) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))))) (= (select (select |c_#memory_$Pointer$.offset| .cse3) 0) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_18) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse1 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_17) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_17) 1))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_22) 0) (= (select (store |v_#valid_BEFORE_CALL_8| .cse3 1) .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_22) 1) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse3) 0))))))) is different from true [2022-11-02 20:29:22,813 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 ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse4) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 2 .cse1))) (and (= .cse0 0) (= (select (select |c_#memory_int| .cse1) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse0) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_18) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_17) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_17) 1))) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_22) 0) (= (select (store |v_#valid_BEFORE_CALL_8| .cse4 1) .cse1) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_22) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse4) 0))))))) is different from false [2022-11-02 20:29:22,817 WARN L855 $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 ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse4) 0))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ 2 .cse1))) (and (= .cse0 0) (= (select (select |c_#memory_int| .cse1) 8) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| .cse0) (= (select (select |c_#memory_$Pointer$.offset| .cse4) 0) 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_18) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (<= .cse2 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_17) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_17) 1))) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~ptr~0#1.base| .cse4) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimIndex_22 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_22) 0) (= (select (store |v_#valid_BEFORE_CALL_8| .cse4 1) .cse1) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_22) 1) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse4) 0))))))) is different from true [2022-11-02 20:29:22,994 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-02 20:29:22,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 63 [2022-11-02 20:29:23,162 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimIndex_26 Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_26))) (and (= (select (store |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_26 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_22) 0) (= (select .cse2 0) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_22) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_26) 0) (= (select .cse2 .cse1) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_18) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_17) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_17) 1))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)))) is different from false [2022-11-02 20:29:23,168 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimIndex_26 Int) (v_arrayElimIndex_22 Int)) (let ((.cse2 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_26))) (and (= (select (store |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_26 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_22) 0) (= (select .cse2 0) 0) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_22) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_26) 0) (= (select .cse2 .cse1) |c_ULTIMATE.start_main_~ptr~0#1.offset|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1)))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_18) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_17) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_17) 1))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)))) is different from true [2022-11-02 20:29:23,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:29:23,247 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:29:23,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-02 20:29:23,362 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_18) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_17) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_17) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_26 Int) (v_arrayElimIndex_22 Int)) (and (= (select (store |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_26 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_22) 0) (= (select |v_#valid_BEFORE_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_22) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_26) 0) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)))) is different from false [2022-11-02 20:29:23,368 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.base| 2))) (and (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_7|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_dll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))))) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimIndex_18 Int) (v_arrayElimIndex_17 Int) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_18) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (<= .cse0 |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) (= (select |v_#valid_BEFORE_CALL_12| |v_ULTIMATE.start_dll_circular_insert_~head#1.base_BEFORE_CALL_3|) 1) (= (select |v_#valid_BEFORE_CALL_12| v_arrayElimIndex_17) 0) (= (select |v_#valid_BEFORE_CALL_13| v_arrayElimIndex_17) 1))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_arrayElimIndex_26 Int) (v_arrayElimIndex_22 Int)) (and (= (select (store |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_26 1) |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimIndex_22) 0) (= (select |v_#valid_BEFORE_CALL_9| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_22) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimIndex_26) 0) (<= .cse0 |ULTIMATE.start_main_~#s~0#1.base|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~ptr~0#1.base|) 8)))) is different from true [2022-11-02 20:29:23,523 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 15 treesize of output 7 [2022-11-02 20:29:23,541 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2022-11-02 20:29:23,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:29:23,697 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2953 (Array Int Int)) (v_ArrVal_2951 (Array Int Int)) (v_ArrVal_2962 (Array Int Int)) (v_ArrVal_2960 Int) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2945 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse4 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2948) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2951)) (.cse1 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2953) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2962))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2949))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) v_ArrVal_2960) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_2945))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2944) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 8)))))) is different from false [2022-11-02 20:29:23,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2953 (Array Int Int)) (v_ArrVal_2951 (Array Int Int)) (v_ArrVal_2962 (Array Int Int)) (v_ArrVal_2960 Int) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2945 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2948) .cse1 v_ArrVal_2951)) (.cse2 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_2953) .cse1 v_ArrVal_2962))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_2949))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) v_ArrVal_2960) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_2945))) .cse1 v_ArrVal_2944) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 8)))))))) is different from false [2022-11-02 20:29:23,752 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2953 (Array Int Int)) (v_ArrVal_2951 (Array Int Int)) (v_ArrVal_2962 (Array Int Int)) (v_ArrVal_2960 Int) (v_ArrVal_2949 (Array Int Int)) (v_ArrVal_2948 (Array Int Int)) (v_ArrVal_2945 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse1)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select .cse7 .cse8))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2948) .cse2 v_ArrVal_2951)) (.cse3 (store (store (store |c_#memory_$Pointer$.base| .cse1 (store .cse7 .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_2953) .cse2 v_ArrVal_2962))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_2949))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4) v_ArrVal_2960) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_2945))) .cse2 v_ArrVal_2944) (select (select .cse3 .cse4) .cse5)) (+ 8 (select (select .cse6 .cse4) .cse5)))))))))) is different from false [2022-11-02 20:29:23,920 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:29:23,920 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 476 treesize of output 469 [2022-11-02 20:29:23,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:29:23,949 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 20412 treesize of output 19808 [2022-11-02 20:29:23,995 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 19596 treesize of output 16364 [2022-11-02 20:29:24,046 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 28712 treesize of output 26288 [2022-11-02 20:29:28,657 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 4017 treesize of output 3815