./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 02:18:45,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 02:18:45,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 02:18:45,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 02:18:45,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 02:18:45,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 02:18:45,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 02:18:45,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 02:18:45,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 02:18:45,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 02:18:45,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 02:18:45,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 02:18:45,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 02:18:45,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 02:18:45,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 02:18:45,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 02:18:45,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 02:18:45,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 02:18:45,385 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 02:18:45,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 02:18:45,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 02:18:45,405 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 02:18:45,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 02:18:45,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 02:18:45,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 02:18:45,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 02:18:45,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 02:18:45,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 02:18:45,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 02:18:45,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 02:18:45,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 02:18:45,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 02:18:45,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 02:18:45,426 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 02:18:45,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 02:18:45,427 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 02:18:45,428 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 02:18:45,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 02:18:45,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 02:18:45,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 02:18:45,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 02:18:45,446 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-23 02:18:45,494 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 02:18:45,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 02:18:45,495 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 02:18:45,496 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 02:18:45,497 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 02:18:45,497 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 02:18:45,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 02:18:45,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 02:18:45,498 INFO L138 SettingsManager]: * Use SBE=true [2022-11-23 02:18:45,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 02:18:45,499 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 02:18:45,500 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 02:18:45,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 02:18:45,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 02:18:45,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 02:18:45,500 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 02:18:45,501 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 02:18:45,501 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 02:18:45,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 02:18:45,501 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 02:18:45,501 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 02:18:45,501 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 02:18:45,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 02:18:45,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 02:18:45,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 02:18:45,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:18:45,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 02:18:45,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 02:18:45,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-23 02:18:45,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 02:18:45,504 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-23 02:18:45,504 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-23 02:18:45,504 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 02:18:45,504 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/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_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0706d1a5964bb8391155a217bd6084c2519a4607ef121976461541c97aecebc [2022-11-23 02:18:45,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 02:18:45,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 02:18:45,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 02:18:45,828 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 02:18:45,828 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 02:18:45,830 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/../../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2022-11-23 02:18:49,194 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 02:18:49,511 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 02:18:49,511 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i [2022-11-23 02:18:49,526 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/data/f236c11af/7c39829601224f84a15b4948b59f0aeb/FLAG093ee2d91 [2022-11-23 02:18:49,551 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/data/f236c11af/7c39829601224f84a15b4948b59f0aeb [2022-11-23 02:18:49,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 02:18:49,556 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 02:18:49,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 02:18:49,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 02:18:49,563 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 02:18:49,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:49" (1/1) ... [2022-11-23 02:18:49,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e19950f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:49, skipping insertion in model container [2022-11-23 02:18:49,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:49" (1/1) ... [2022-11-23 02:18:49,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 02:18:49,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 02:18:50,057 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2022-11-23 02:18:50,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:18:50,071 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 02:18:50,117 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-2.i[24092,24105] [2022-11-23 02:18:50,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 02:18:50,167 INFO L208 MainTranslator]: Completed translation [2022-11-23 02:18:50,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:50 WrapperNode [2022-11-23 02:18:50,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 02:18:50,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 02:18:50,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 02:18:50,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 02:18:50,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:50" (1/1) ... [2022-11-23 02:18:50,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:50" (1/1) ... [2022-11-23 02:18:50,250 INFO L138 Inliner]: procedures = 122, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2022-11-23 02:18:50,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 02:18:50,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 02:18:50,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 02:18:50,252 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 02:18:50,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:50" (1/1) ... [2022-11-23 02:18:50,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:50" (1/1) ... [2022-11-23 02:18:50,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:50" (1/1) ... [2022-11-23 02:18:50,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:50" (1/1) ... [2022-11-23 02:18:50,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:50" (1/1) ... [2022-11-23 02:18:50,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:50" (1/1) ... [2022-11-23 02:18:50,300 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:50" (1/1) ... [2022-11-23 02:18:50,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:50" (1/1) ... [2022-11-23 02:18:50,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 02:18:50,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 02:18:50,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 02:18:50,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 02:18:50,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:50" (1/1) ... [2022-11-23 02:18:50,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 02:18:50,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:18:50,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 02:18:50,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 02:18:50,406 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-23 02:18:50,406 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-23 02:18:50,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 02:18:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 02:18:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-23 02:18:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 02:18:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-23 02:18:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-23 02:18:50,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 02:18:50,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 02:18:50,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 02:18:50,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 02:18:50,532 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 02:18:50,534 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 02:18:50,587 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-23 02:18:50,990 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 02:18:50,998 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 02:18:50,999 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-23 02:18:51,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:51 BoogieIcfgContainer [2022-11-23 02:18:51,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 02:18:51,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 02:18:51,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 02:18:51,008 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 02:18:51,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:18:49" (1/3) ... [2022-11-23 02:18:51,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c72a2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:51, skipping insertion in model container [2022-11-23 02:18:51,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:50" (2/3) ... [2022-11-23 02:18:51,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c72a2f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:51, skipping insertion in model container [2022-11-23 02:18:51,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:51" (3/3) ... [2022-11-23 02:18:51,012 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-2.i [2022-11-23 02:18:51,032 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 02:18:51,032 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-11-23 02:18:51,078 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 02:18:51,085 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@389f46e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 02:18:51,085 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-23 02:18:51,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 35 states have (on average 2.0) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:51,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-23 02:18:51,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:51,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-23 02:18:51,108 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:18:51,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:51,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2022-11-23 02:18:51,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:51,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844250175] [2022-11-23 02:18:51,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:51,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:51,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:51,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844250175] [2022-11-23 02:18:51,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844250175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:51,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:51,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:18:51,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805596890] [2022-11-23 02:18:51,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:51,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:18:51,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:51,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:18:51,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:51,433 INFO L87 Difference]: Start difference. First operand has 63 states, 35 states have (on average 2.0) internal successors, (70), 61 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:51,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:51,531 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-23 02:18:51,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:51,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-23 02:18:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:51,542 INFO L225 Difference]: With dead ends: 76 [2022-11-23 02:18:51,542 INFO L226 Difference]: Without dead ends: 70 [2022-11-23 02:18:51,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:51,548 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 50 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:51,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 55 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:18:51,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-23 02:18:51,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2022-11-23 02:18:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.78125) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-11-23 02:18:51,587 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 4 [2022-11-23 02:18:51,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:51,587 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-11-23 02:18:51,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:51,588 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-11-23 02:18:51,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-23 02:18:51,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:51,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-23 02:18:51,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 02:18:51,589 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:18:51,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:51,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2022-11-23 02:18:51,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:51,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578847691] [2022-11-23 02:18:51,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:51,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:51,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:51,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578847691] [2022-11-23 02:18:51,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578847691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:51,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:51,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:18:51,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002666733] [2022-11-23 02:18:51,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:51,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:18:51,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:51,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:18:51,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:51,695 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:51,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:51,743 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-11-23 02:18:51,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:51,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-23 02:18:51,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:51,745 INFO L225 Difference]: With dead ends: 51 [2022-11-23 02:18:51,745 INFO L226 Difference]: Without dead ends: 51 [2022-11-23 02:18:51,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:51,747 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:51,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 34 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:18:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-23 02:18:51,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-23 02:18:51,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.6875) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2022-11-23 02:18:51,754 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 4 [2022-11-23 02:18:51,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:51,754 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2022-11-23 02:18:51,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:51,754 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2022-11-23 02:18:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 02:18:51,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:51,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:51,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 02:18:51,756 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:18:51,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:51,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2022-11-23 02:18:51,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:51,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241082596] [2022-11-23 02:18:51,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:51,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:51,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:51,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241082596] [2022-11-23 02:18:51,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241082596] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:51,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:51,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:18:51,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763117909] [2022-11-23 02:18:51,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:51,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:18:51,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:51,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:18:51,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:51,849 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:51,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:51,926 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-11-23 02:18:51,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:51,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 02:18:51,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:51,927 INFO L225 Difference]: With dead ends: 82 [2022-11-23 02:18:51,928 INFO L226 Difference]: Without dead ends: 82 [2022-11-23 02:18:51,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:51,929 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 39 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 95 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-23 02:18:51,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 95 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:18:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-23 02:18:51,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 49. [2022-11-23 02:18:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.625) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-11-23 02:18:51,936 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 9 [2022-11-23 02:18:51,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:51,936 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-11-23 02:18:51,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-11-23 02:18:51,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 02:18:51,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:51,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:51,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 02:18:51,938 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:18:51,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:51,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2022-11-23 02:18:51,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:51,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375913255] [2022-11-23 02:18:51,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:51,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:52,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:52,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375913255] [2022-11-23 02:18:52,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375913255] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:52,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:52,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 02:18:52,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446122794] [2022-11-23 02:18:52,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:52,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:18:52,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:52,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:18:52,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:52,062 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:52,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:52,140 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-11-23 02:18:52,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:52,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-23 02:18:52,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:52,142 INFO L225 Difference]: With dead ends: 84 [2022-11-23 02:18:52,142 INFO L226 Difference]: Without dead ends: 84 [2022-11-23 02:18:52,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:52,144 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 42 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:52,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 104 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:18:52,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-23 02:18:52,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 47. [2022-11-23 02:18:52,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.5625) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-11-23 02:18:52,152 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 9 [2022-11-23 02:18:52,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:52,152 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-11-23 02:18:52,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:52,153 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-11-23 02:18:52,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 02:18:52,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:52,154 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:52,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 02:18:52,154 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:18:52,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:52,155 INFO L85 PathProgramCache]: Analyzing trace with hash 427661500, now seen corresponding path program 1 times [2022-11-23 02:18:52,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:52,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906462849] [2022-11-23 02:18:52,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:52,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:52,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906462849] [2022-11-23 02:18:52,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906462849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:52,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:52,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 02:18:52,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611106379] [2022-11-23 02:18:52,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:52,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 02:18:52,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:52,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 02:18:52,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:52,251 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:52,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:52,264 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-11-23 02:18:52,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 02:18:52,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-23 02:18:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:52,266 INFO L225 Difference]: With dead ends: 52 [2022-11-23 02:18:52,266 INFO L226 Difference]: Without dead ends: 52 [2022-11-23 02:18:52,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 02:18:52,268 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:52,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:18:52,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-23 02:18:52,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-11-23 02:18:52,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:52,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-11-23 02:18:52,274 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 11 [2022-11-23 02:18:52,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:52,275 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-11-23 02:18:52,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:52,275 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-11-23 02:18:52,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 02:18:52,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:52,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:52,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 02:18:52,277 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:18:52,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:52,278 INFO L85 PathProgramCache]: Analyzing trace with hash 200371689, now seen corresponding path program 1 times [2022-11-23 02:18:52,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:52,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001859071] [2022-11-23 02:18:52,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:52,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:52,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:52,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001859071] [2022-11-23 02:18:52,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001859071] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:18:52,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598937837] [2022-11-23 02:18:52,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:52,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:18:52,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:18:52,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:18:52,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 02:18:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:52,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 02:18:52,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:52,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:18:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 02:18:52,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598937837] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:18:52,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:18:52,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-23 02:18:52,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303269569] [2022-11-23 02:18:52,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:18:52,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 02:18:52,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:52,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 02:18:52,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:18:52,859 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:52,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:52,909 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-11-23 02:18:52,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:18:52,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 02:18:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:52,915 INFO L225 Difference]: With dead ends: 63 [2022-11-23 02:18:52,915 INFO L226 Difference]: Without dead ends: 63 [2022-11-23 02:18:52,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-23 02:18:52,925 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:52,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 138 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 02:18:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-23 02:18:52,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-23 02:18:52,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 48 states have (on average 1.375) internal successors, (66), 62 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-11-23 02:18:52,943 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 16 [2022-11-23 02:18:52,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:52,946 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-11-23 02:18:52,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-11-23 02:18:52,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 02:18:52,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:52,948 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:52,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 02:18:53,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-23 02:18:53,149 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:18:53,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:53,150 INFO L85 PathProgramCache]: Analyzing trace with hash 527522044, now seen corresponding path program 2 times [2022-11-23 02:18:53,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:53,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821056695] [2022-11-23 02:18:53,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:53,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-23 02:18:53,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:53,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821056695] [2022-11-23 02:18:53,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821056695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:53,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:53,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:18:53,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783981602] [2022-11-23 02:18:53,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:53,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:18:53,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:53,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:18:53,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:18:53,433 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:53,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:53,664 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-11-23 02:18:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 02:18:53,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-23 02:18:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:53,666 INFO L225 Difference]: With dead ends: 75 [2022-11-23 02:18:53,666 INFO L226 Difference]: Without dead ends: 75 [2022-11-23 02:18:53,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-23 02:18:53,667 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 124 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:53,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 66 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 02:18:53,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-23 02:18:53,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2022-11-23 02:18:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-11-23 02:18:53,680 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 31 [2022-11-23 02:18:53,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:53,681 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-11-23 02:18:53,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:53,682 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-11-23 02:18:53,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 02:18:53,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:53,684 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:53,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 02:18:53,684 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:18:53,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:53,685 INFO L85 PathProgramCache]: Analyzing trace with hash 527522045, now seen corresponding path program 1 times [2022-11-23 02:18:53,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:53,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422536296] [2022-11-23 02:18:53,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:53,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-23 02:18:54,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:54,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422536296] [2022-11-23 02:18:54,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422536296] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 02:18:54,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 02:18:54,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 02:18:54,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104306644] [2022-11-23 02:18:54,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:18:54,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 02:18:54,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:54,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 02:18:54,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 02:18:54,055 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:54,231 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-11-23 02:18:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 02:18:54,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-23 02:18:54,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:54,233 INFO L225 Difference]: With dead ends: 66 [2022-11-23 02:18:54,233 INFO L226 Difference]: Without dead ends: 66 [2022-11-23 02:18:54,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-23 02:18:54,234 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 131 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:54,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 47 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:18:54,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-23 02:18:54,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2022-11-23 02:18:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 62 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:54,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2022-11-23 02:18:54,241 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 31 [2022-11-23 02:18:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:54,242 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2022-11-23 02:18:54,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2022-11-23 02:18:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-23 02:18:54,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:54,246 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:54,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 02:18:54,247 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:18:54,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:54,248 INFO L85 PathProgramCache]: Analyzing trace with hash 142544431, now seen corresponding path program 1 times [2022-11-23 02:18:54,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:54,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664569529] [2022-11-23 02:18:54,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:54,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-23 02:18:55,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:55,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664569529] [2022-11-23 02:18:55,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664569529] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:18:55,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120448471] [2022-11-23 02:18:55,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:55,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:18:55,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:18:55,151 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:18:55,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 02:18:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:55,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-23 02:18:55,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:55,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:18:55,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:18:55,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 02:18:55,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:18:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-23 02:18:55,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:18:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-23 02:18:56,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120448471] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:18:56,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:18:56,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-11-23 02:18:56,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460149843] [2022-11-23 02:18:56,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:18:56,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 02:18:56,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:18:56,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 02:18:56,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2022-11-23 02:18:56,216 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:56,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:18:56,628 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-11-23 02:18:56,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 02:18:56,629 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-23 02:18:56,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:18:56,630 INFO L225 Difference]: With dead ends: 63 [2022-11-23 02:18:56,630 INFO L226 Difference]: Without dead ends: 63 [2022-11-23 02:18:56,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=726, Unknown=0, NotChecked=0, Total=930 [2022-11-23 02:18:56,631 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 190 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 02:18:56,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 325 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 02:18:56,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-23 02:18:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-23 02:18:56,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 62 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-11-23 02:18:56,635 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 33 [2022-11-23 02:18:56,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:18:56,636 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-11-23 02:18:56,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.56) internal successors, (64), 25 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:18:56,636 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-11-23 02:18:56,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-23 02:18:56,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:18:56,637 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:18:56,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 02:18:56,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:18:56,844 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:18:56,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:18:56,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941388, now seen corresponding path program 1 times [2022-11-23 02:18:56,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:18:56,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22120767] [2022-11-23 02:18:56,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:56,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:18:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:58,358 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 02:18:58,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:18:58,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22120767] [2022-11-23 02:18:58,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22120767] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:18:58,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841107689] [2022-11-23 02:18:58,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:18:58,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:18:58,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:18:58,363 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:18:58,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 02:18:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:18:58,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-23 02:18:58,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:18:58,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:18:58,696 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 02:18:58,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-23 02:18:58,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:18:58,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:18:58,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:18:58,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 02:18:58,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:18:58,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-23 02:18:59,030 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 02:18:59,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 02:18:59,050 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 02:18:59,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-11-23 02:18:59,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:18:59,490 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:18:59,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2022-11-23 02:18:59,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:18:59,504 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:18:59,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2022-11-23 02:18:59,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:18:59,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 32 [2022-11-23 02:18:59,573 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:18:59,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 31 [2022-11-23 02:18:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 02:18:59,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:19:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 02:19:00,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841107689] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:19:00,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:19:00,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 27 [2022-11-23 02:19:00,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904630380] [2022-11-23 02:19:00,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:19:00,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-23 02:19:00,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:19:00,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-23 02:19:00,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2022-11-23 02:19:00,318 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:02,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:19:02,915 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-11-23 02:19:02,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 02:19:02,916 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-23 02:19:02,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:19:02,918 INFO L225 Difference]: With dead ends: 122 [2022-11-23 02:19:02,918 INFO L226 Difference]: Without dead ends: 122 [2022-11-23 02:19:02,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=450, Invalid=1442, Unknown=0, NotChecked=0, Total=1892 [2022-11-23 02:19:02,920 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 878 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 02:19:02,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 261 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 02:19:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-23 02:19:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 72. [2022-11-23 02:19:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 71 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2022-11-23 02:19:02,928 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 37 [2022-11-23 02:19:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:19:02,928 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2022-11-23 02:19:02,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-11-23 02:19:02,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-23 02:19:02,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:19:02,930 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:02,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 02:19:03,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:19:03,138 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:19:03,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:03,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2041941389, now seen corresponding path program 1 times [2022-11-23 02:19:03,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:19:03,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372953572] [2022-11-23 02:19:03,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:03,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:19:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 02:19:04,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:19:04,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372953572] [2022-11-23 02:19:04,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372953572] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:19:04,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709713567] [2022-11-23 02:19:04,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:04,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:19:04,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:19:04,726 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:19:04,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 02:19:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:04,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-23 02:19:04,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:05,119 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 02:19:05,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-23 02:19:05,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:19:05,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:19:05,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:05,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 02:19:05,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:05,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-23 02:19:05,441 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 02:19:05,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-11-23 02:19:05,461 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 02:19:05,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 02:19:05,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:05,956 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:19:05,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2022-11-23 02:19:05,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:05,972 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:19:05,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2022-11-23 02:19:06,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:19:06,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 32 [2022-11-23 02:19:06,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:19:06,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 31 [2022-11-23 02:19:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 02:19:06,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:19:07,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-23 02:19:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 02:19:07,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709713567] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:19:07,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:19:07,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 36 [2022-11-23 02:19:07,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234708947] [2022-11-23 02:19:07,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:19:07,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-23 02:19:07,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:19:07,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-23 02:19:07,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 02:19:07,505 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 37 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 37 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:14,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:19:14,175 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2022-11-23 02:19:14,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-23 02:19:14,176 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 37 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-23 02:19:14,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:19:14,177 INFO L225 Difference]: With dead ends: 135 [2022-11-23 02:19:14,177 INFO L226 Difference]: Without dead ends: 135 [2022-11-23 02:19:14,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=976, Invalid=3056, Unknown=0, NotChecked=0, Total=4032 [2022-11-23 02:19:14,179 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1147 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 02:19:14,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 251 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 02:19:14,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-23 02:19:14,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 74. [2022-11-23 02:19:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.25) internal successors, (80), 73 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-11-23 02:19:14,183 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 37 [2022-11-23 02:19:14,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:19:14,184 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-11-23 02:19:14,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.3333333333333335) internal successors, (84), 37 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:14,184 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-11-23 02:19:14,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-23 02:19:14,185 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:19:14,185 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:14,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 02:19:14,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-23 02:19:14,385 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:19:14,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:14,386 INFO L85 PathProgramCache]: Analyzing trace with hash -494379329, now seen corresponding path program 1 times [2022-11-23 02:19:14,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:19:14,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865678505] [2022-11-23 02:19:14,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:19:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 02:19:16,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:19:16,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865678505] [2022-11-23 02:19:16,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865678505] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:19:16,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755922864] [2022-11-23 02:19:16,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:16,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:19:16,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:19:16,751 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:19:16,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 02:19:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:16,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-23 02:19:16,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:17,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:19:17,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:19:17,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:19:17,234 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 02:19:17,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 30 [2022-11-23 02:19:17,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-23 02:19:17,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:17,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2022-11-23 02:19:17,343 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 02:19:17,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 38 [2022-11-23 02:19:17,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:17,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 02:19:17,499 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 02:19:17,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-11-23 02:19:17,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-23 02:19:17,530 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 02:19:17,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 02:19:18,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:18,070 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:19:18,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2022-11-23 02:19:18,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:18,088 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:19:18,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2022-11-23 02:19:18,106 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 02:19:18,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 51 [2022-11-23 02:19:18,142 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 02:19:18,176 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:19:18,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 34 [2022-11-23 02:19:18,189 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:19:18,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 33 [2022-11-23 02:19:18,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:19:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 02:19:18,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:19:21,705 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse6 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse46 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse46 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse10 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse44 (select (store (let ((.cse45 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse44 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse44 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse2 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse13 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse42 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse42 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) (and (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse2) (or (and (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse4 (select (store (let ((.cse5 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_980 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse4 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))))) .cse6 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse8 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse7 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse7 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse9 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse9 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse10 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse11 (select (store (let ((.cse12 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse11 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse11 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse13) .cse2) .cse6 (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse14 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse14 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse2) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (let ((.cse16 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse36 (select (store (let ((.cse37 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse36 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse36 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse17 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse34 (select (store (let ((.cse35 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse35 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse34 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse34 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1)))))))) (.cse23 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse33 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse33 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (and (or (and .cse16 .cse17 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (let ((.cse18 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse19 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse19 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_980 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse21 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse21 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))) .cse23 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse25 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse25 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse24 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse24 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse2) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse26 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse26 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) .cse2) .cse16 (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse28 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|))) .cse2) .cse17 (or .cse2 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse29 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse29 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1)))))) .cse23 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_980 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse31 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse31 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1)))))))))) .cse10 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse38 (select (store (let ((.cse39 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select v_ArrVal_980 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse38 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse38 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1))))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse40 (select (store (let ((.cse41 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse40 .cse1) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse40 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse1)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse2) .cse13))) is different from false [2022-11-23 02:19:23,469 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (let ((.cse0 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse45 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse5 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse43 (select (store (let ((.cse44 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse44 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse43 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse43 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3)))))))))) (.cse9 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse41 (select (store (let ((.cse42 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse42 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse41 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse41 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (.cse1 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) (and .cse0 (or .cse1 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse2 (select (store (let ((.cse4 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse4 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse2 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse2 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))))) (or (and .cse0 .cse5 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse6 (select (store (let ((.cse7 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse6 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse6 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse8 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) .cse9 (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse10 (select (store (let ((.cse11 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse11 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse10 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse10 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3))))))) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse12 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse12 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse1) .cse5 (or .cse1 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse14 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (or (let ((.cse17 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse35 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse35 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3)))))))) (.cse21 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse33 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse33 4) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (.cse22 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse32 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (and (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse15 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse15 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse1) (or (and .cse17 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (= (select (select (store (let ((.cse18 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse19 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse19 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse21 .cse22 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse23 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse25 (select (store (let ((.cse26 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse26 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse25 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse25 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3)))))) .cse1) .cse17 .cse21 .cse22 (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse27 (select (store (let ((.cse28 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse28 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse27 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse27 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse30 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse29 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse29 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3))))) .cse1) (or .cse1 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= (select (select (store (let ((.cse31 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) .cse9 (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (let ((.cse37 (select (store (let ((.cse38 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse38 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse37 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= (select .cse37 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) .cse1) (forall ((|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse39 (select (store (let ((.cse40 (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_969))) (store .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (or (= (select .cse39 .cse3) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse39 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_980 .cse3)) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|))))))))))) is different from false [2022-11-23 02:19:24,314 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (let ((.cse0 (forall ((v_subst_3 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_3) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_3) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse44 (select (store (let ((.cse45 (store |c_#memory_int| v_subst_3 v_ArrVal_969))) (store .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse45 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_3 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse44 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse44 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (.cse11 (forall ((v_subst_8 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_8) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse42 (select (store (let ((.cse43 (store |c_#memory_int| v_subst_8 v_ArrVal_969))) (store .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse43 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_8 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse42 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse42 4))))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_8)))))) (.cse4 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse12 (forall ((v_subst_1 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_1) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse41 (store |c_#memory_int| v_subst_1 v_ArrVal_969))) (store .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse41 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_1 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_1))))))) (and .cse0 (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (v_subst_10 Int)) (let ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int| v_subst_10 v_ArrVal_969))) (store .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_10 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse1 .cse2)) (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_10) (= (select .cse1 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_10)))) .cse4) (or (and .cse0 (forall ((v_subst_5 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_5) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse5 (select (store (let ((.cse6 (store |c_#memory_int| v_subst_5 v_ArrVal_969))) (store .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_5 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 .cse2)) (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse5 4))))))) (forall ((v_subst_6 Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse8 (store |c_#memory_int| v_subst_6 v_ArrVal_969))) (store .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_6 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse7 4)) (= (select .cse7 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_6))) (forall ((v_subst_4 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_4) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int| v_subst_4 v_ArrVal_969))) (store .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_4 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse9 4) |c_ULTIMATE.start_main_~data_init~0#1|)))))) .cse11 .cse12 (forall ((v_subst_7 Int)) (or (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_7) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse13 (store |c_#memory_int| v_subst_7 v_ArrVal_969))) (store .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse13 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_7 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse4) (or .cse4 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (v_subst_11 Int)) (let ((.cse14 (select (store (let ((.cse15 (store |c_#memory_int| v_subst_11 v_ArrVal_969))) (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_11 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_11) (= (select .cse14 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse14 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_11))))) (or (let ((.cse16 (forall ((v_subst_13 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (= (select (select (store (let ((.cse37 (store |c_#memory_int| v_subst_13 v_ArrVal_969))) (store .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse37 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_13 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_13)))) (.cse17 (forall ((v_subst_15 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse35 (select (store (let ((.cse36 (store |c_#memory_int| v_subst_15 v_ArrVal_969))) (store .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse36 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_15 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse35 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse35 4))))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_15)))) (.cse25 (forall ((v_subst_16 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_16) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int| v_subst_16 v_ArrVal_969))) (store .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse34 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_16 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse33 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse33 .cse2))))))))) (and .cse16 .cse17 (or .cse4 (and .cse16 .cse17 (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (v_subst_20 Int)) (= (select (select (store (let ((.cse18 (store |c_#memory_int| v_subst_20 v_ArrVal_969))) (store .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse18 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_20 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) (forall ((v_ArrVal_973 Int) (v_subst_19 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse19 (select (store (let ((.cse20 (store |c_#memory_int| v_subst_19 v_ArrVal_969))) (store .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse20 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_19 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse19 .cse2)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse19 4))))) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int)) (v_subst_21 Int)) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int| v_subst_21 v_ArrVal_969))) (store .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_21 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse21 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse21 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_973 Int) (v_subst_18 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse23 (select (store (let ((.cse24 (store |c_#memory_int| v_subst_18 v_ArrVal_969))) (store .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_18 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse23 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse25)) (or (forall ((v_ArrVal_973 Int) (v_subst_12 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int| v_subst_12 v_ArrVal_969))) (store .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_12 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_12) (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse26 .cse2)) (= (select .cse26 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse4) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_subst_22 Int)) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_22) (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int| v_subst_22 v_ArrVal_969))) (store .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_22 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse28 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse28 4))))))) (or (forall ((v_ArrVal_973 Int) (v_subst_14 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int| v_subst_14 v_ArrVal_969))) (store .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse31 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_14 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select .cse30 4) |c_ULTIMATE.start_main_~data_init~0#1|) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_14) (= (select .cse30 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse4) (or (forall ((v_ArrVal_973 Int) (v_subst_17 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_17) (= (select (select (store (let ((.cse32 (store |c_#memory_int| v_subst_17 v_ArrVal_969))) (store .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse32 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_17 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse4) .cse25)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0)) (forall ((v_subst_2 Int)) (or (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_973 Int) (v_ArrVal_969 (Array Int Int)) (v_ArrVal_980 (Array Int Int))) (let ((.cse38 (select (store (let ((.cse39 (store |c_#memory_int| v_subst_2 v_ArrVal_969))) (store .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse39 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_2 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (or (= (select v_ArrVal_980 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse38 4)) (= (select .cse38 .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_ArrVal_980 4) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_2))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_2))) .cse11 (or .cse4 (forall ((v_ArrVal_973 Int) (v_subst_9 Int) (v_ArrVal_969 (Array Int Int)) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_980 (Array Int Int))) (or (= |ULTIMATE.start_sll_circular_create_~last~0#1.base| v_subst_9) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_subst_9) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (let ((.cse40 (store |c_#memory_int| v_subst_9 v_ArrVal_969))) (store .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse40 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_ArrVal_973))) v_subst_9 v_ArrVal_980) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse2))))) .cse12))) is different from false [2022-11-23 02:19:24,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:19:24,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 61 [2022-11-23 02:19:24,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:19:24,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:19:24,728 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:19:24,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 65 [2022-11-23 02:19:24,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:19:24,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 73 [2022-11-23 02:19:24,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:19:24,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 15 [2022-11-23 02:19:24,877 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-23 02:19:24,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-23 02:19:24,889 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-23 02:19:24,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-23 02:19:24,907 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:19:24,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 61 [2022-11-23 02:19:24,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:19:24,931 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-23 02:19:24,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1109 treesize of output 1062 [2022-11-23 02:19:24,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:19:24,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:19:24,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1107 treesize of output 1059 [2022-11-23 02:19:24,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:19:24,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 531 treesize of output 507 [2022-11-23 02:19:25,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:19:25,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1043 treesize of output 1015 [2022-11-23 02:19:25,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:19:25,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1023 treesize of output 921 [2022-11-23 02:19:25,231 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-23 02:19:25,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-23 02:19:25,241 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-23 02:19:25,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-23 02:19:25,255 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-23 02:19:25,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2022-11-23 02:19:25,266 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-23 02:19:25,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-23 02:19:25,277 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-23 02:19:25,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-23 02:19:25,288 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-23 02:19:25,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-23 02:19:25,299 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-23 02:19:25,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2022-11-23 02:19:25,312 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-23 02:19:25,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-23 02:19:25,325 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-23 02:19:25,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2022-11-23 02:19:25,335 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-23 02:19:25,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 1 [2022-11-23 02:19:25,349 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-23 02:19:25,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2022-11-23 02:19:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 13 not checked. [2022-11-23 02:19:25,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755922864] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:19:25,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:19:25,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 18] total 44 [2022-11-23 02:19:25,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451402567] [2022-11-23 02:19:25,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:19:25,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-23 02:19:25,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:19:25,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-23 02:19:25,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1482, Unknown=35, NotChecked=240, Total=1892 [2022-11-23 02:19:25,596 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 44 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 44 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:19:34,457 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-11-23 02:19:34,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 02:19:34,458 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 44 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-23 02:19:34,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:19:34,459 INFO L225 Difference]: With dead ends: 93 [2022-11-23 02:19:34,459 INFO L226 Difference]: Without dead ends: 93 [2022-11-23 02:19:34,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=594, Invalid=3414, Unknown=36, NotChecked=378, Total=4422 [2022-11-23 02:19:34,462 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 398 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 26 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-23 02:19:34,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 330 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 899 Invalid, 2 Unknown, 155 Unchecked, 1.5s Time] [2022-11-23 02:19:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-23 02:19:34,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2022-11-23 02:19:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.234375) internal successors, (79), 73 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-11-23 02:19:34,465 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 39 [2022-11-23 02:19:34,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:19:34,466 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-11-23 02:19:34,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.8636363636363635) internal successors, (82), 44 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-11-23 02:19:34,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-23 02:19:34,468 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:19:34,468 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:34,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 02:19:34,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:19:34,676 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:19:34,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:34,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1852999400, now seen corresponding path program 1 times [2022-11-23 02:19:34,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:19:34,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13899398] [2022-11-23 02:19:34,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:34,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:19:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 02:19:35,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:19:35,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13899398] [2022-11-23 02:19:35,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13899398] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:19:35,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775699172] [2022-11-23 02:19:35,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:35,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:19:35,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:19:35,635 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:19:35,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 02:19:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:35,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-23 02:19:35,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:35,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:19:35,977 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 02:19:35,978 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 02:19:36,024 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:19:36,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:19:36,095 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-23 02:19:36,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-23 02:19:36,218 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-23 02:19:36,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 02:19:36,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:19:36,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:36,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-11-23 02:19:36,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-23 02:19:36,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:36,622 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:19:36,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 34 [2022-11-23 02:19:36,660 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-11-23 02:19:36,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 21 [2022-11-23 02:19:36,667 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 02:19:36,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:19:37,279 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 02:19:37,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775699172] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:19:37,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:19:37,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 32 [2022-11-23 02:19:37,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226956627] [2022-11-23 02:19:37,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:19:37,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-23 02:19:37,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:19:37,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-23 02:19:37,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2022-11-23 02:19:37,285 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:38,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:19:38,235 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2022-11-23 02:19:38,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 02:19:38,236 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-23 02:19:38,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:19:38,237 INFO L225 Difference]: With dead ends: 83 [2022-11-23 02:19:38,237 INFO L226 Difference]: Without dead ends: 83 [2022-11-23 02:19:38,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=401, Invalid=1491, Unknown=0, NotChecked=0, Total=1892 [2022-11-23 02:19:38,239 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 333 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 02:19:38,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 332 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 02:19:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-23 02:19:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 68. [2022-11-23 02:19:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-11-23 02:19:38,244 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 40 [2022-11-23 02:19:38,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:19:38,244 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-11-23 02:19:38,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.71875) internal successors, (87), 32 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:19:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-11-23 02:19:38,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-23 02:19:38,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:19:38,246 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:19:38,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 02:19:38,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-23 02:19:38,447 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:19:38,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:19:38,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728484, now seen corresponding path program 2 times [2022-11-23 02:19:38,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:19:38,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258432431] [2022-11-23 02:19:38,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:19:38,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:19:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:19:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-23 02:19:40,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:19:40,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258432431] [2022-11-23 02:19:40,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258432431] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:19:40,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944808386] [2022-11-23 02:19:40,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:19:40,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:19:40,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:19:40,864 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:19:40,866 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 02:19:41,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:19:41,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:19:41,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 83 conjunts are in the unsatisfiable core [2022-11-23 02:19:41,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:19:41,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:19:41,187 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 02:19:41,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-23 02:19:41,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:19:41,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:41,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-23 02:19:41,438 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 02:19:41,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 34 [2022-11-23 02:19:41,577 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 02:19:41,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-11-23 02:19:41,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:19:41,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:41,701 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:19:41,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2022-11-23 02:19:41,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:41,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 02:19:41,891 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2022-11-23 02:19:41,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 50 [2022-11-23 02:19:41,912 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-23 02:19:41,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-23 02:19:42,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:42,541 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-23 02:19:42,541 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 85 [2022-11-23 02:19:42,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:42,559 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-11-23 02:19:42,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 72 [2022-11-23 02:19:42,682 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:19:42,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 82 [2022-11-23 02:19:43,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:19:43,419 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-23 02:19:43,419 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 59 treesize of output 54 [2022-11-23 02:19:43,450 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-23 02:19:43,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 41 [2022-11-23 02:19:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 23 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:19:43,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:20:11,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:20:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:20:19,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944808386] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:20:19,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:20:19,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 20] total 52 [2022-11-23 02:20:19,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427206457] [2022-11-23 02:20:19,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:20:19,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-23 02:20:19,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:20:19,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-23 02:20:19,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2583, Unknown=7, NotChecked=0, Total=2756 [2022-11-23 02:20:19,711 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 53 states, 52 states have (on average 2.1346153846153846) internal successors, (111), 53 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:20:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:20:31,981 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2022-11-23 02:20:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-23 02:20:31,982 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 2.1346153846153846) internal successors, (111), 53 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-23 02:20:31,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:20:31,983 INFO L225 Difference]: With dead ends: 109 [2022-11-23 02:20:31,983 INFO L226 Difference]: Without dead ends: 109 [2022-11-23 02:20:31,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=1041, Invalid=5758, Unknown=7, NotChecked=0, Total=6806 [2022-11-23 02:20:31,984 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 988 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:20:31,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 506 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-23 02:20:31,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-23 02:20:31,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 73. [2022-11-23 02:20:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 63 states have (on average 1.253968253968254) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:20:31,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2022-11-23 02:20:31,988 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 43 [2022-11-23 02:20:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:20:31,988 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2022-11-23 02:20:31,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 2.1346153846153846) internal successors, (111), 53 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:20:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2022-11-23 02:20:31,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-23 02:20:31,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:20:31,991 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:20:32,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-23 02:20:32,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 02:20:32,195 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:20:32,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:20:32,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1769728483, now seen corresponding path program 2 times [2022-11-23 02:20:32,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:20:32,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2975531] [2022-11-23 02:20:32,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:20:32,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:20:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:20:35,080 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:20:35,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:20:35,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2975531] [2022-11-23 02:20:35,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2975531] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:20:35,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113549163] [2022-11-23 02:20:35,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:20:35,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:20:35,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:20:35,082 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:20:35,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 02:20:35,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:20:35,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:20:35,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 102 conjunts are in the unsatisfiable core [2022-11-23 02:20:35,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:20:35,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:20:35,586 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 02:20:35,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-23 02:20:35,605 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 02:20:35,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-23 02:20:35,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:20:35,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:20:35,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:20:35,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 02:20:35,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:20:35,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-23 02:20:35,943 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-23 02:20:35,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-11-23 02:20:36,121 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 02:20:36,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 32 [2022-11-23 02:20:36,142 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-23 02:20:36,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-23 02:20:36,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:20:36,346 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:20:36,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 66 [2022-11-23 02:20:36,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:20:36,357 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 02:20:36,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 02:20:36,706 INFO L321 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2022-11-23 02:20:36,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 80 [2022-11-23 02:20:36,744 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-23 02:20:36,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2022-11-23 02:20:37,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:20:37,993 INFO L321 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2022-11-23 02:20:37,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 151 [2022-11-23 02:20:38,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:20:38,008 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-11-23 02:20:38,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 115 [2022-11-23 02:20:39,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:20:39,172 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-23 02:20:39,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 100 treesize of output 76 [2022-11-23 02:20:39,215 INFO L321 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2022-11-23 02:20:39,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 100 [2022-11-23 02:20:39,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:20:39,417 INFO L321 Elim1Store]: treesize reduction 29, result has 40.8 percent of original size [2022-11-23 02:20:39,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 133 treesize of output 94 [2022-11-23 02:20:39,468 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2022-11-23 02:20:39,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 66 [2022-11-23 02:20:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:20:40,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:20:55,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:20:55,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:21:03,411 WARN L233 SmtUtils]: Spent 7.46s on a formula simplification. DAG size of input: 49 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:21:06,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 281 treesize of output 273 [2022-11-23 02:21:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:21:06,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113549163] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 02:21:06,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 02:21:06,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 59 [2022-11-23 02:21:06,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821994874] [2022-11-23 02:21:06,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 02:21:06,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-23 02:21:06,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:21:06,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-23 02:21:06,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=3302, Unknown=1, NotChecked=0, Total=3540 [2022-11-23 02:21:06,871 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 60 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 60 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:21:43,946 WARN L233 SmtUtils]: Spent 28.23s on a formula simplification. DAG size of input: 289 DAG size of output: 168 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:22:25,132 WARN L233 SmtUtils]: Spent 32.56s on a formula simplification. DAG size of input: 331 DAG size of output: 195 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:22:27,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:23:33,525 WARN L233 SmtUtils]: Spent 55.00s on a formula simplification. DAG size of input: 375 DAG size of output: 226 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:23:35,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:24:51,752 WARN L233 SmtUtils]: Spent 1.07m on a formula simplification. DAG size of input: 392 DAG size of output: 228 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:24:52,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:24:55,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:24:57,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:25:01,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:25:18,965 WARN L233 SmtUtils]: Spent 14.87s on a formula simplification. DAG size of input: 300 DAG size of output: 186 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:25:33,865 WARN L233 SmtUtils]: Spent 14.41s on a formula simplification. DAG size of input: 306 DAG size of output: 192 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:25:42,596 WARN L233 SmtUtils]: Spent 8.25s on a formula simplification. DAG size of input: 285 DAG size of output: 186 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:25:51,521 WARN L233 SmtUtils]: Spent 8.37s on a formula simplification. DAG size of input: 274 DAG size of output: 188 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:26:00,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:26:02,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:26:05,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:26:07,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:26:15,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:26:17,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-11-23 02:26:29,261 WARN L233 SmtUtils]: Spent 7.68s on a formula simplification. DAG size of input: 264 DAG size of output: 176 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:26:58,693 WARN L233 SmtUtils]: Spent 20.58s on a formula simplification. DAG size of input: 231 DAG size of output: 153 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:27:29,386 WARN L233 SmtUtils]: Spent 20.23s on a formula simplification. DAG size of input: 249 DAG size of output: 166 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:27:39,064 WARN L233 SmtUtils]: Spent 7.23s on a formula simplification. DAG size of input: 234 DAG size of output: 144 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:27:51,969 WARN L233 SmtUtils]: Spent 7.47s on a formula simplification. DAG size of input: 249 DAG size of output: 154 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:28:11,978 WARN L233 SmtUtils]: Spent 13.45s on a formula simplification. DAG size of input: 260 DAG size of output: 170 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:28:22,827 WARN L233 SmtUtils]: Spent 6.93s on a formula simplification. DAG size of input: 206 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:28:33,286 WARN L233 SmtUtils]: Spent 7.32s on a formula simplification. DAG size of input: 234 DAG size of output: 154 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:28:41,858 WARN L233 SmtUtils]: Spent 7.07s on a formula simplification. DAG size of input: 213 DAG size of output: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:28:49,769 WARN L233 SmtUtils]: Spent 7.20s on a formula simplification. DAG size of input: 230 DAG size of output: 152 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:29:04,102 WARN L233 SmtUtils]: Spent 8.66s on a formula simplification. DAG size of input: 257 DAG size of output: 139 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:29:12,759 WARN L233 SmtUtils]: Spent 7.38s on a formula simplification. DAG size of input: 238 DAG size of output: 156 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:29:20,611 WARN L233 SmtUtils]: Spent 7.38s on a formula simplification. DAG size of input: 245 DAG size of output: 162 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:29:31,519 WARN L233 SmtUtils]: Spent 8.76s on a formula simplification. DAG size of input: 264 DAG size of output: 146 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:29:41,247 WARN L233 SmtUtils]: Spent 9.06s on a formula simplification. DAG size of input: 281 DAG size of output: 163 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:29:49,169 WARN L233 SmtUtils]: Spent 7.35s on a formula simplification. DAG size of input: 239 DAG size of output: 155 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:29:59,284 WARN L233 SmtUtils]: Spent 9.07s on a formula simplification. DAG size of input: 287 DAG size of output: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:30:09,059 WARN L233 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 232 DAG size of output: 152 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:30:21,123 WARN L233 SmtUtils]: Spent 8.74s on a formula simplification. DAG size of input: 262 DAG size of output: 144 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:30:56,545 WARN L233 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 86 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 02:31:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:31:01,162 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2022-11-23 02:31:01,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-11-23 02:31:01,163 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 60 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-11-23 02:31:01,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:31:01,164 INFO L225 Difference]: With dead ends: 164 [2022-11-23 02:31:01,164 INFO L226 Difference]: Without dead ends: 164 [2022-11-23 02:31:01,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3836 ImplicationChecksByTransitivity, 584.2s TimeCoverageRelationStatistics Valid=2311, Invalid=11937, Unknown=32, NotChecked=0, Total=14280 [2022-11-23 02:31:01,168 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1996 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 169 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1996 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.6s IncrementalHoareTripleChecker+Time [2022-11-23 02:31:01,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1996 Valid, 484 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1538 Invalid, 11 Unknown, 0 Unchecked, 37.6s Time] [2022-11-23 02:31:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-23 02:31:01,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 80. [2022-11-23 02:31:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 79 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:31:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-11-23 02:31:01,171 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 43 [2022-11-23 02:31:01,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:31:01,172 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-11-23 02:31:01,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.9830508474576272) internal successors, (117), 60 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:31:01,172 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-11-23 02:31:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-23 02:31:01,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:31:01,173 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:31:01,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-23 02:31:01,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-23 02:31:01,379 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:31:01,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:31:01,380 INFO L85 PathProgramCache]: Analyzing trace with hash 972990722, now seen corresponding path program 1 times [2022-11-23 02:31:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:31:01,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442397691] [2022-11-23 02:31:01,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:31:01,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:31:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:31:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-23 02:31:01,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:31:01,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442397691] [2022-11-23 02:31:01,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442397691] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:31:01,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445138761] [2022-11-23 02:31:01,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:31:01,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:31:01,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:31:01,754 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:31:01,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 02:31:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:31:01,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-23 02:31:01,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:31:01,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:31:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-23 02:31:02,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:31:02,518 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-23 02:31:02,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445138761] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 02:31:02,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 02:31:02,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 19 [2022-11-23 02:31:02,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613572231] [2022-11-23 02:31:02,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 02:31:02,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 02:31:02,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-23 02:31:02,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 02:31:02,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-11-23 02:31:02,521 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:31:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 02:31:02,882 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-11-23 02:31:02,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 02:31:02,883 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-11-23 02:31:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 02:31:02,884 INFO L225 Difference]: With dead ends: 82 [2022-11-23 02:31:02,884 INFO L226 Difference]: Without dead ends: 82 [2022-11-23 02:31:02,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2022-11-23 02:31:02,885 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 174 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 02:31:02,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 37 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 02:31:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-23 02:31:02,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-11-23 02:31:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:31:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2022-11-23 02:31:02,889 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 44 [2022-11-23 02:31:02,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 02:31:02,889 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2022-11-23 02:31:02,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 02:31:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2022-11-23 02:31:02,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-23 02:31:02,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 02:31:02,890 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 02:31:02,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 02:31:03,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-23 02:31:03,097 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-23 02:31:03,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 02:31:03,097 INFO L85 PathProgramCache]: Analyzing trace with hash 97977167, now seen corresponding path program 2 times [2022-11-23 02:31:03,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-23 02:31:03,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346774361] [2022-11-23 02:31:03,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 02:31:03,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 02:31:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 02:31:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:31:07,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-23 02:31:07,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346774361] [2022-11-23 02:31:07,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346774361] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 02:31:07,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040068518] [2022-11-23 02:31:07,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 02:31:07,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 02:31:07,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 [2022-11-23 02:31:07,223 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 02:31:07,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9aaf3c3-b840-413e-883e-6da2d5b2db49/bin/uautomizer-QkZJyEgLgS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 02:31:07,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-23 02:31:07,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 02:31:07,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 123 conjunts are in the unsatisfiable core [2022-11-23 02:31:07,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 02:31:07,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-23 02:31:07,581 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 02:31:07,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 02:31:07,658 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-23 02:31:07,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-23 02:31:07,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-23 02:31:08,014 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-23 02:31:08,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 02:31:08,131 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-23 02:31:08,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 02:31:08,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-23 02:31:08,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:31:08,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-23 02:31:08,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:31:08,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2022-11-23 02:31:08,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-23 02:31:08,592 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-23 02:31:08,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 34 [2022-11-23 02:31:08,615 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-23 02:31:08,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-23 02:31:08,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:31:08,677 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2022-11-23 02:31:08,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-11-23 02:31:08,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:31:08,876 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-23 02:31:08,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 86 [2022-11-23 02:31:08,921 INFO L321 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2022-11-23 02:31:08,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 140 [2022-11-23 02:31:09,059 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 02:31:09,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:31:09,126 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-23 02:31:09,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-23 02:31:09,659 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-23 02:31:09,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 88 [2022-11-23 02:31:09,694 INFO L321 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2022-11-23 02:31:09,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 80 [2022-11-23 02:31:09,727 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-23 02:31:09,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2022-11-23 02:31:11,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:31:11,215 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2022-11-23 02:31:11,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 228 treesize of output 181 [2022-11-23 02:31:11,305 INFO L321 Elim1Store]: treesize reduction 54, result has 64.9 percent of original size [2022-11-23 02:31:11,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 221 treesize of output 301 [2022-11-23 02:31:11,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:31:11,331 INFO L321 Elim1Store]: treesize reduction 140, result has 0.7 percent of original size [2022-11-23 02:31:11,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 217 treesize of output 223 [2022-11-23 02:31:14,101 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 02:31:17,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:31:17,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:31:17,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:31:17,484 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-11-23 02:31:17,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-23 02:31:21,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 02:31:21,006 INFO L321 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2022-11-23 02:31:21,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 144 treesize of output 107 [2022-11-23 02:31:21,032 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-23 02:31:21,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 96 [2022-11-23 02:31:21,073 INFO L321 Elim1Store]: treesize reduction 116, result has 15.9 percent of original size [2022-11-23 02:31:21,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 115 treesize of output 115 [2022-11-23 02:31:21,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 02:31:21,360 INFO L321 Elim1Store]: treesize reduction 37, result has 54.3 percent of original size [2022-11-23 02:31:21,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 162 treesize of output 131 [2022-11-23 02:31:21,432 INFO L321 Elim1Store]: treesize reduction 29, result has 60.3 percent of original size [2022-11-23 02:31:21,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 100 [2022-11-23 02:31:22,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-23 02:31:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 02:31:22,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 02:32:11,990 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1954 (Array Int Int)) (v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1943 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1953 Int) (v_ArrVal_1944 Int) (v_ArrVal_1957 (Array Int Int))) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_1943)))) (store .cse8 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (.cse2 (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_1944)))) (store .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse3 (select .cse2 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse6 (select .cse5 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse6 0)) (.cse4 (select .cse3 0))) (let ((.cse0 (select (select (store .cse5 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 4 v_ArrVal_1953)) .cse1) .cse4))) (or (= |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1940) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1948) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1954) .cse1 v_ArrVal_1957) .cse0) (+ (select (select (store .cse2 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 4 v_ArrVal_1951)) .cse1) .cse4) 4))))))))) (forall ((v_ArrVal_1954 (Array Int Int)) (v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1943 Int) (|ULTIMATE.start_sll_circular_create_~new_head~0#1.base| Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1953 Int) (v_ArrVal_1944 Int) (v_ArrVal_1957 (Array Int Int))) (let ((.cse11 (let ((.cse17 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 4 v_ArrVal_1943)))) (store .cse17 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse17 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (.cse14 (let ((.cse16 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4 v_ArrVal_1944)))) (store .cse16 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse15 (select .cse14 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse12 (select .cse11 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse10 (select .cse12 0)) (.cse13 (select .cse15 0))) (let ((.cse9 (select (select (store .cse14 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse15 4 v_ArrVal_1951)) .cse10) .cse13))) (or (= .cse9 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store (store |c_#memory_int| |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1940) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1948) |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1954) .cse10 v_ArrVal_1957) (select (select (store .cse11 |ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse12 4 v_ArrVal_1953)) .cse10) .cse13)) (+ .cse9 4)))))))))) is different from false [2022-11-23 02:32:14,051 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1954 (Array Int Int)) (v_subst_24 Int) (v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1953 Int) (v_ArrVal_1944 Int) (v_ArrVal_1957 (Array Int Int))) (let ((.cse5 (let ((.cse8 (store |c_#memory_$Pointer$.base| v_subst_24 (store (store (select |c_#memory_$Pointer$.base| v_subst_24) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1943)))) (store .cse8 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_subst_24)))) (.cse2 (let ((.cse7 (store |c_#memory_$Pointer$.offset| v_subst_24 (store (store (select |c_#memory_$Pointer$.offset| v_subst_24) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1944)))) (store .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse3 (select .cse2 v_subst_24)) (.cse6 (select .cse5 v_subst_24))) (let ((.cse1 (select .cse6 0)) (.cse4 (select .cse3 0))) (let ((.cse0 (select (select (store .cse5 v_subst_24 (store .cse6 4 v_ArrVal_1953)) .cse1) .cse4))) (or (= .cse0 v_subst_24) (= (select (select (store (store (store (store |c_#memory_int| v_subst_24 v_ArrVal_1940) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1948) v_subst_24 v_ArrVal_1954) .cse1 v_ArrVal_1957) .cse0) (+ 4 (select (select (store .cse2 v_subst_24 (store .cse3 4 v_ArrVal_1951)) .cse1) .cse4))) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (forall ((v_ArrVal_1954 (Array Int Int)) (v_subst_23 Int) (v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1953 Int) (v_ArrVal_1944 Int) (v_ArrVal_1957 (Array Int Int))) (let ((.cse10 (let ((.cse17 (store |c_#memory_$Pointer$.base| v_subst_23 (store (store (select |c_#memory_$Pointer$.base| v_subst_23) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1943)))) (store .cse17 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse17 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_subst_23)))) (.cse14 (let ((.cse16 (store |c_#memory_$Pointer$.offset| v_subst_23 (store (store (select |c_#memory_$Pointer$.offset| v_subst_23) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1944)))) (store .cse16 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse15 (select .cse14 v_subst_23)) (.cse11 (select .cse10 v_subst_23))) (let ((.cse9 (select .cse11 0)) (.cse12 (select .cse15 0))) (let ((.cse13 (select (select (store .cse14 v_subst_23 (store .cse15 4 v_ArrVal_1951)) .cse9) .cse12))) (or (= (select (select (store (store (store (store |c_#memory_int| v_subst_23 v_ArrVal_1940) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1948) v_subst_23 v_ArrVal_1954) .cse9 v_ArrVal_1957) (select (select (store .cse10 v_subst_23 (store .cse11 4 v_ArrVal_1953)) .cse9) .cse12)) (+ .cse13 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse13 0)))))))) is different from false [2022-11-23 02:32:18,880 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse10 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1954 (Array Int Int)) (v_subst_23 Int) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1932 Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1953 Int) (v_ArrVal_1934 Int) (v_ArrVal_1944 Int) (v_ArrVal_1957 (Array Int Int))) (let ((.cse2 (let ((.cse11 (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse13 .cse10 v_ArrVal_1932)))) (store .cse12 v_subst_23 (store (store (select .cse12 v_subst_23) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1943))))) (store .cse11 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_subst_23)))) (.cse5 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1934)))) (store .cse8 v_subst_23 (store (store (select .cse8 v_subst_23) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1944))))) (store .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse6 (select .cse5 v_subst_23)) (.cse3 (select .cse2 v_subst_23))) (let ((.cse1 (select .cse3 0)) (.cse4 (select .cse6 0))) (let ((.cse0 (select (select (store .cse5 v_subst_23 (store .cse6 4 v_ArrVal_1951)) .cse1) .cse4))) (or (= .cse0 0) (= (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1930) v_subst_23 v_ArrVal_1940) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1948) v_subst_23 v_ArrVal_1954) .cse1 v_ArrVal_1957) (select (select (store .cse2 v_subst_23 (store .cse3 4 v_ArrVal_1953)) .cse1) .cse4)) (+ .cse0 4)) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (forall ((v_ArrVal_1954 (Array Int Int)) (v_subst_24 Int) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1951 Int) (v_ArrVal_1932 Int) (v_ArrVal_1943 Int) (v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1953 Int) (v_ArrVal_1934 Int) (v_ArrVal_1944 Int) (v_ArrVal_1957 (Array Int Int))) (let ((.cse19 (let ((.cse23 (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse13 .cse10 v_ArrVal_1932)))) (store .cse24 v_subst_24 (store (store (select .cse24 v_subst_24) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 v_ArrVal_1943))))) (store .cse23 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse23 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| v_subst_24)))) (.cse16 (let ((.cse21 (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse9 .cse10 v_ArrVal_1934)))) (store .cse22 v_subst_24 (store (store (select .cse22 v_subst_24) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4 v_ArrVal_1944))))) (store .cse21 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse21 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))))) (let ((.cse17 (select .cse16 v_subst_24)) (.cse20 (select .cse19 v_subst_24))) (let ((.cse14 (select .cse20 0)) (.cse18 (select .cse17 0))) (let ((.cse15 (select (select (store .cse19 v_subst_24 (store .cse20 4 v_ArrVal_1953)) .cse14) .cse18))) (or (= (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1930) v_subst_24 v_ArrVal_1940) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1948) v_subst_24 v_ArrVal_1954) .cse14 v_ArrVal_1957) .cse15) (+ (select (select (store .cse16 v_subst_24 (store .cse17 4 v_ArrVal_1951)) .cse14) .cse18) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_subst_24 .cse15))))))))) is different from false [2022-11-23 02:32:18,970 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 02:32:18,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 488571 treesize of output 485699 [2022-11-23 02:32:23,175 INFO L321 Elim1Store]: treesize reduction 297, result has 32.0 percent of original size [2022-11-23 02:32:23,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 9708667 treesize of output 9601286