./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 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_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a --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 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 --- 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-b5237d8 [2022-11-21 13:56:48,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:56:48,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:56:48,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:56:48,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:56:48,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:56:48,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:56:48,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:56:48,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:56:48,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:56:48,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:56:48,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:56:48,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:56:48,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:56:48,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:56:48,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:56:48,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:56:48,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:56:48,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:56:48,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:56:48,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:56:48,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:56:48,503 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:56:48,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:56:48,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:56:48,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:56:48,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:56:48,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:56:48,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:56:48,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:56:48,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:56:48,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:56:48,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:56:48,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:56:48,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:56:48,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:56:48,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:56:48,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:56:48,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:56:48,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:56:48,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:56:48,529 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 13:56:48,566 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:56:48,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:56:48,566 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:56:48,566 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:56:48,567 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:56:48,567 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:56:48,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:56:48,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:56:48,568 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:56:48,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:56:48,569 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 13:56:48,569 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 13:56:48,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:56:48,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 13:56:48,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:56:48,569 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 13:56:48,570 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 13:56:48,570 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 13:56:48,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:56:48,570 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 13:56:48,570 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 13:56:48,570 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:56:48,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:56:48,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:56:48,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:56:48,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:56:48,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:56:48,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:56:48,578 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:56:48,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:56:48,578 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/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_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a 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 -> 5247496942546516118f3c28fa350944e097bdf15ee64734ca287a29ad51a034 [2022-11-21 13:56:48,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:56:48,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:56:48,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:56:48,861 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:56:48,861 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:56:48,862 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-11-21 13:56:51,858 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:56:52,144 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:56:52,144 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i [2022-11-21 13:56:52,156 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/data/8be0a90a2/b1d1028c8521486dae1d9112633dc48f/FLAG3b0bab635 [2022-11-21 13:56:52,171 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/data/8be0a90a2/b1d1028c8521486dae1d9112633dc48f [2022-11-21 13:56:52,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:56:52,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:56:52,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:56:52,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:56:52,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:56:52,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:56:52" (1/1) ... [2022-11-21 13:56:52,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d76ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:56:52, skipping insertion in model container [2022-11-21 13:56:52,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:56:52" (1/1) ... [2022-11-21 13:56:52,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:56:52,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:56:52,607 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_4932ff93-875f-41ca-9f5d-841d0297565e/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-11-21 13:56:52,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:56:52,619 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:56:52,658 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_4932ff93-875f-41ca-9f5d-841d0297565e/sv-benchmarks/c/list-simple/dll2c_update_all_reverse.i[24556,24569] [2022-11-21 13:56:52,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:56:52,681 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:56:52,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:56:52 WrapperNode [2022-11-21 13:56:52,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:56:52,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:56:52,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:56:52,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:56:52,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:56:52" (1/1) ... [2022-11-21 13:56:52,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:56:52" (1/1) ... [2022-11-21 13:56:52,729 INFO L138 Inliner]: procedures = 126, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 137 [2022-11-21 13:56:52,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:56:52,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:56:52,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:56:52,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:56:52,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:56:52" (1/1) ... [2022-11-21 13:56:52,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:56:52" (1/1) ... [2022-11-21 13:56:52,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:56:52" (1/1) ... [2022-11-21 13:56:52,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:56:52" (1/1) ... [2022-11-21 13:56:52,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:56:52" (1/1) ... [2022-11-21 13:56:52,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:56:52" (1/1) ... [2022-11-21 13:56:52,759 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:56:52" (1/1) ... [2022-11-21 13:56:52,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:56:52" (1/1) ... [2022-11-21 13:56:52,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:56:52,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:56:52,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:56:52,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:56:52,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:56:52" (1/1) ... [2022-11-21 13:56:52,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:56:52,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:52,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:56:52,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:56:52,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 13:56:52,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 13:56:52,877 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-21 13:56:52,878 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-21 13:56:52,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 13:56:52,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:56:52,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 13:56:52,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 13:56:52,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:56:52,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:56:52,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:56:52,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:56:53,080 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:56:53,082 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:56:53,361 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:56:53,368 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:56:53,368 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-21 13:56:53,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:56:53 BoogieIcfgContainer [2022-11-21 13:56:53,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:56:53,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:56:53,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:56:53,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:56:53,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:56:52" (1/3) ... [2022-11-21 13:56:53,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0bbd56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:56:53, skipping insertion in model container [2022-11-21 13:56:53,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:56:52" (2/3) ... [2022-11-21 13:56:53,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0bbd56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:56:53, skipping insertion in model container [2022-11-21 13:56:53,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:56:53" (3/3) ... [2022-11-21 13:56:53,410 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2022-11-21 13:56:53,429 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:56:53,429 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-11-21 13:56:53,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:56:53,513 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@39c44605, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:56:53,514 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-11-21 13:56:53,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:56:53,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 13:56:53,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:56:53,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 13:56:53,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:56:53,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:53,537 INFO L85 PathProgramCache]: Analyzing trace with hash 894964530, now seen corresponding path program 1 times [2022-11-21 13:56:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:53,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513759128] [2022-11-21 13:56:53,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:53,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:53,843 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-21 13:56:53,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:53,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513759128] [2022-11-21 13:56:53,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513759128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:56:53,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:56:53,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:56:53,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799667685] [2022-11-21 13:56:53,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:56:53,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:56:53,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:56:53,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:56:53,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:56:53,900 INFO L87 Difference]: Start difference. First operand has 93 states, 55 states have (on average 1.9090909090909092) internal successors, (105), 89 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:56:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:56:54,053 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2022-11-21 13:56:54,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:56:54,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-21 13:56:54,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:56:54,068 INFO L225 Difference]: With dead ends: 90 [2022-11-21 13:56:54,095 INFO L226 Difference]: Without dead ends: 87 [2022-11-21 13:56:54,097 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-21 13:56:54,100 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:56:54,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 147 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:56:54,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-21 13:56:54,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-11-21 13:56:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.7169811320754718) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:56:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-11-21 13:56:54,149 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 6 [2022-11-21 13:56:54,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:56:54,149 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-11-21 13:56:54,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:56:54,150 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-11-21 13:56:54,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-21 13:56:54,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:56:54,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-21 13:56:54,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:56:54,151 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:56:54,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:54,152 INFO L85 PathProgramCache]: Analyzing trace with hash 894964531, now seen corresponding path program 1 times [2022-11-21 13:56:54,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:54,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577867593] [2022-11-21 13:56:54,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:54,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:54,302 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-21 13:56:54,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:54,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577867593] [2022-11-21 13:56:54,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577867593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:56:54,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:56:54,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 13:56:54,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310048697] [2022-11-21 13:56:54,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:56:54,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:56:54,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:56:54,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:56:54,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 13:56:54,307 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:56:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:56:54,379 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-11-21 13:56:54,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:56:54,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-21 13:56:54,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:56:54,382 INFO L225 Difference]: With dead ends: 84 [2022-11-21 13:56:54,385 INFO L226 Difference]: Without dead ends: 84 [2022-11-21 13:56:54,385 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-21 13:56:54,387 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 5 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:56:54,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 149 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:56:54,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-21 13:56:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-21 13:56:54,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.6603773584905661) internal successors, (88), 80 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:56:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2022-11-21 13:56:54,398 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 6 [2022-11-21 13:56:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:56:54,398 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2022-11-21 13:56:54,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 13:56:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-11-21 13:56:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 13:56:54,399 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:56:54,399 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:54,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:56:54,400 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:56:54,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:54,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1046244471, now seen corresponding path program 1 times [2022-11-21 13:56:54,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:54,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719731476] [2022-11-21 13:56:54,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:54,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:54,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:56:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:54,584 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-21 13:56:54,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:54,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719731476] [2022-11-21 13:56:54,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719731476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:56:54,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:56:54,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 13:56:54,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707808224] [2022-11-21 13:56:54,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:56:54,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:56:54,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:56:54,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:56:54,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:56:54,587 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 13:56:54,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:56:54,677 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2022-11-21 13:56:54,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:56:54,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-21 13:56:54,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:56:54,679 INFO L225 Difference]: With dead ends: 95 [2022-11-21 13:56:54,679 INFO L226 Difference]: Without dead ends: 95 [2022-11-21 13:56:54,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 13:56:54,681 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:56:54,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 223 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:56:54,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-21 13:56:54,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2022-11-21 13:56:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 81 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:56:54,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2022-11-21 13:56:54,692 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 14 [2022-11-21 13:56:54,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:56:54,693 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2022-11-21 13:56:54,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-21 13:56:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2022-11-21 13:56:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 13:56:54,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:56:54,694 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:54,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 13:56:54,694 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:56:54,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:54,695 INFO L85 PathProgramCache]: Analyzing trace with hash 543084160, now seen corresponding path program 1 times [2022-11-21 13:56:54,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:54,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236228379] [2022-11-21 13:56:54,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:54,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:54,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:56:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:54,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:56:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:56:55,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:55,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236228379] [2022-11-21 13:56:55,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236228379] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:56:55,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:56:55,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:56:55,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188888571] [2022-11-21 13:56:55,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:56:55,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:56:55,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:56:55,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:56:55,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:56:55,031 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:56:55,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:56:55,227 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-11-21 13:56:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:56:55,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-21 13:56:55,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:56:55,231 INFO L225 Difference]: With dead ends: 105 [2022-11-21 13:56:55,231 INFO L226 Difference]: Without dead ends: 105 [2022-11-21 13:56:55,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:56:55,233 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 77 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:56:55,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 286 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:56:55,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-21 13:56:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2022-11-21 13:56:55,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 80 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:56:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2022-11-21 13:56:55,243 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 24 [2022-11-21 13:56:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:56:55,244 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2022-11-21 13:56:55,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:56:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-11-21 13:56:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-21 13:56:55,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:56:55,246 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:55,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 13:56:55,246 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:56:55,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:55,247 INFO L85 PathProgramCache]: Analyzing trace with hash 543084161, now seen corresponding path program 1 times [2022-11-21 13:56:55,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:55,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474280179] [2022-11-21 13:56:55,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:55,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:55,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:56:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:55,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:56:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:56:55,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:55,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474280179] [2022-11-21 13:56:55,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474280179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:56:55,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:56:55,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:56:55,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140066595] [2022-11-21 13:56:55,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:56:55,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:56:55,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:56:55,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:56:55,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:56:55,746 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:56:55,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:56:55,974 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2022-11-21 13:56:55,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:56:55,979 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-21 13:56:55,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:56:55,981 INFO L225 Difference]: With dead ends: 84 [2022-11-21 13:56:55,981 INFO L226 Difference]: Without dead ends: 84 [2022-11-21 13:56:55,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:56:55,990 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 77 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:56:55,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 295 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:56:55,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-21 13:56:55,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-11-21 13:56:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 79 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:56:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-11-21 13:56:55,996 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 24 [2022-11-21 13:56:55,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:56:55,997 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-11-21 13:56:55,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:56:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-11-21 13:56:55,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 13:56:55,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:56:55,998 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:55,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 13:56:55,998 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:56:55,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:55,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132639, now seen corresponding path program 1 times [2022-11-21 13:56:55,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:56,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325667282] [2022-11-21 13:56:56,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:56,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:56,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:56:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:56,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:56:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:56,390 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:56:56,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:56,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325667282] [2022-11-21 13:56:56,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325667282] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:56:56,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332593620] [2022-11-21 13:56:56,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:56,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:56,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:56,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:56,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 13:56:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:56,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-21 13:56:56,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:56,604 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-21 13:56:56,674 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_338 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_338))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-21 13:56:56,808 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 13:56:56,809 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-21 13:56:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-21 13:56:56,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:56:56,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332593620] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:56:56,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:56:56,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-21 13:56:56,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531610964] [2022-11-21 13:56:56,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:56:56,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:56:56,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:56:56,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:56:56,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2022-11-21 13:56:56,917 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:56:57,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:56:57,211 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2022-11-21 13:56:57,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:56:57,211 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-11-21 13:56:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:56:57,212 INFO L225 Difference]: With dead ends: 110 [2022-11-21 13:56:57,212 INFO L226 Difference]: Without dead ends: 110 [2022-11-21 13:56:57,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2022-11-21 13:56:57,214 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 69 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:56:57,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 372 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 284 Invalid, 0 Unknown, 84 Unchecked, 0.2s Time] [2022-11-21 13:56:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-21 13:56:57,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 88. [2022-11-21 13:56:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.603448275862069) internal successors, (93), 83 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:56:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2022-11-21 13:56:57,220 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 26 [2022-11-21 13:56:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:56:57,221 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2022-11-21 13:56:57,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:56:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2022-11-21 13:56:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-21 13:56:57,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:56:57,222 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:56:57,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 13:56:57,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:57,429 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:56:57,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:56:57,429 INFO L85 PathProgramCache]: Analyzing trace with hash -2082132638, now seen corresponding path program 1 times [2022-11-21 13:56:57,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:56:57,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955799658] [2022-11-21 13:56:57,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:57,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:56:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:57,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:56:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:57,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:56:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:56:58,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:56:58,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955799658] [2022-11-21 13:56:58,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955799658] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:56:58,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386844685] [2022-11-21 13:56:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:56:58,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:56:58,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:56:58,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:56:58,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 13:56:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:56:58,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-21 13:56:58,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:56:58,193 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-21 13:56:58,440 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_475 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_475) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-21 13:56:58,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:56:58,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-21 13:56:58,520 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:56:58,520 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-21 13:56:58,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-21 13:56:58,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:57:02,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386844685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:57:02,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:57:02,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-11-21 13:57:02,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139080941] [2022-11-21 13:57:02,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:57:02,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-21 13:57:02,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:02,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-21 13:57:02,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2022-11-21 13:57:02,765 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 13:57:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:03,318 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2022-11-21 13:57:03,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:57:03,319 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-11-21 13:57:03,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:03,320 INFO L225 Difference]: With dead ends: 90 [2022-11-21 13:57:03,320 INFO L226 Difference]: Without dead ends: 90 [2022-11-21 13:57:03,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=86, Invalid=423, Unknown=1, NotChecked=42, Total=552 [2022-11-21 13:57:03,321 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 25 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:03,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 690 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 465 Invalid, 0 Unknown, 90 Unchecked, 0.4s Time] [2022-11-21 13:57:03,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-21 13:57:03,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-11-21 13:57:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 83 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:57:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2022-11-21 13:57:03,328 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 26 [2022-11-21 13:57:03,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:03,328 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2022-11-21 13:57:03,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 16 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 13:57:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2022-11-21 13:57:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 13:57:03,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:03,330 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:03,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 13:57:03,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:57:03,544 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:03,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:03,544 INFO L85 PathProgramCache]: Analyzing trace with hash 525447991, now seen corresponding path program 1 times [2022-11-21 13:57:03,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:03,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559504487] [2022-11-21 13:57:03,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:03,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:03,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:03,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:57:03,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:03,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559504487] [2022-11-21 13:57:03,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559504487] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:57:03,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800496144] [2022-11-21 13:57:03,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:03,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:57:03,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:57:03,718 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:57:03,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 13:57:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:03,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 13:57:03,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:57:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:57:03,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:57:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:57:04,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800496144] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:57:04,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:57:04,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-21 13:57:04,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609005553] [2022-11-21 13:57:04,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:57:04,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:57:04,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:04,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:57:04,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:57:04,031 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:57:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:04,161 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-11-21 13:57:04,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:57:04,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-21 13:57:04,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:04,162 INFO L225 Difference]: With dead ends: 89 [2022-11-21 13:57:04,162 INFO L226 Difference]: Without dead ends: 89 [2022-11-21 13:57:04,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:57:04,163 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:04,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 433 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:57:04,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-21 13:57:04,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-11-21 13:57:04,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 83 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:57:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2022-11-21 13:57:04,168 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 28 [2022-11-21 13:57:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:04,169 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2022-11-21 13:57:04,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:57:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-11-21 13:57:04,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 13:57:04,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:04,170 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:04,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 13:57:04,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-21 13:57:04,376 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:04,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:04,377 INFO L85 PathProgramCache]: Analyzing trace with hash -895762126, now seen corresponding path program 1 times [2022-11-21 13:57:04,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:04,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155307939] [2022-11-21 13:57:04,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:04,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:04,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:04,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 13:57:04,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:04,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155307939] [2022-11-21 13:57:04,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155307939] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:57:04,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535976293] [2022-11-21 13:57:04,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:04,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:57:04,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:57:04,512 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:57:04,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 13:57:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:04,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-21 13:57:04,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:57:04,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 13:57:04,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:57:04,715 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-21 13:57:04,716 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 12 treesize of output 11 [2022-11-21 13:57:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 13:57:04,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535976293] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:57:04,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:57:04,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-11-21 13:57:04,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623948258] [2022-11-21 13:57:04,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:57:04,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:57:04,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:04,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:57:04,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:57:04,742 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:57:04,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:04,895 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2022-11-21 13:57:04,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:57:04,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-11-21 13:57:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:04,896 INFO L225 Difference]: With dead ends: 113 [2022-11-21 13:57:04,897 INFO L226 Difference]: Without dead ends: 113 [2022-11-21 13:57:04,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:57:04,897 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 125 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:04,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 209 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:57:04,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-21 13:57:04,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 91. [2022-11-21 13:57:04,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5737704918032787) internal successors, (96), 86 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:57:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2022-11-21 13:57:04,903 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 29 [2022-11-21 13:57:04,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:04,904 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2022-11-21 13:57:04,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:57:04,904 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2022-11-21 13:57:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-21 13:57:04,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:04,905 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:04,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 13:57:05,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:57:05,112 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:05,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:05,112 INFO L85 PathProgramCache]: Analyzing trace with hash -895762125, now seen corresponding path program 1 times [2022-11-21 13:57:05,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:05,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48383115] [2022-11-21 13:57:05,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:05,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:05,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:05,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:57:05,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:05,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48383115] [2022-11-21 13:57:05,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48383115] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:57:05,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996186277] [2022-11-21 13:57:05,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:05,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:57:05,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:57:05,447 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:57:05,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 13:57:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:05,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 13:57:05,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:57:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:57:05,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:57:05,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:57:05,811 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 20 treesize of output 24 [2022-11-21 13:57:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:57:06,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996186277] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:57:06,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:57:06,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-11-21 13:57:06,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733545522] [2022-11-21 13:57:06,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:57:06,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-21 13:57:06,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:06,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 13:57:06,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:57:06,016 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-21 13:57:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:06,390 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2022-11-21 13:57:06,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:57:06,391 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-11-21 13:57:06,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:06,392 INFO L225 Difference]: With dead ends: 150 [2022-11-21 13:57:06,392 INFO L226 Difference]: Without dead ends: 150 [2022-11-21 13:57:06,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-21 13:57:06,393 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 200 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:06,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 748 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:57:06,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-21 13:57:06,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2022-11-21 13:57:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:57:06,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-11-21 13:57:06,398 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 29 [2022-11-21 13:57:06,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:06,398 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-11-21 13:57:06,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-21 13:57:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-11-21 13:57:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 13:57:06,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:06,400 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:06,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 13:57:06,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-21 13:57:06,607 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:06,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822125, now seen corresponding path program 1 times [2022-11-21 13:57:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:06,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882642414] [2022-11-21 13:57:06,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:06,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:06,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:06,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:57:06,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:06,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882642414] [2022-11-21 13:57:06,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882642414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:57:06,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:57:06,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:57:06,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030169439] [2022-11-21 13:57:06,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:57:06,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:57:06,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:06,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:57:06,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:57:06,773 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:07,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:07,004 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2022-11-21 13:57:07,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:57:07,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-21 13:57:07,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:07,006 INFO L225 Difference]: With dead ends: 111 [2022-11-21 13:57:07,006 INFO L226 Difference]: Without dead ends: 111 [2022-11-21 13:57:07,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:57:07,007 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 136 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:07,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 294 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:57:07,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-21 13:57:07,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 90. [2022-11-21 13:57:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.540983606557377) internal successors, (94), 85 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:57:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2022-11-21 13:57:07,011 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 30 [2022-11-21 13:57:07,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:07,012 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2022-11-21 13:57:07,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2022-11-21 13:57:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 13:57:07,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:07,013 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:07,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 13:57:07,013 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:07,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:07,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1998822124, now seen corresponding path program 1 times [2022-11-21 13:57:07,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:07,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001409630] [2022-11-21 13:57:07,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:07,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:07,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:07,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:07,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:57:07,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:07,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001409630] [2022-11-21 13:57:07,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001409630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:57:07,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:57:07,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:57:07,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850549626] [2022-11-21 13:57:07,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:57:07,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:57:07,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:07,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:57:07,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:57:07,394 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:07,602 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2022-11-21 13:57:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:57:07,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-21 13:57:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:07,603 INFO L225 Difference]: With dead ends: 89 [2022-11-21 13:57:07,603 INFO L226 Difference]: Without dead ends: 89 [2022-11-21 13:57:07,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:57:07,604 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 136 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:07,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 290 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:57:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-21 13:57:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-21 13:57:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 84 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:57:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2022-11-21 13:57:07,607 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 30 [2022-11-21 13:57:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:07,607 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2022-11-21 13:57:07,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:07,608 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2022-11-21 13:57:07,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-21 13:57:07,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:07,608 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:07,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 13:57:07,609 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:07,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:07,609 INFO L85 PathProgramCache]: Analyzing trace with hash 452746567, now seen corresponding path program 1 times [2022-11-21 13:57:07,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:07,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384387285] [2022-11-21 13:57:07,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:07,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:07,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:07,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 13:57:07,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:07,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384387285] [2022-11-21 13:57:07,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384387285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:57:07,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:57:07,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:57:07,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700731105] [2022-11-21 13:57:07,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:57:07,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:57:07,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:07,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:57:07,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:57:07,750 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:07,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:07,875 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2022-11-21 13:57:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:57:07,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-21 13:57:07,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:07,876 INFO L225 Difference]: With dead ends: 116 [2022-11-21 13:57:07,877 INFO L226 Difference]: Without dead ends: 116 [2022-11-21 13:57:07,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:57:07,878 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 127 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:07,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 281 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:57:07,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-21 13:57:07,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 92. [2022-11-21 13:57:07,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.5) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:57:07,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2022-11-21 13:57:07,881 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 35 [2022-11-21 13:57:07,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:07,881 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2022-11-21 13:57:07,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:07,882 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2022-11-21 13:57:07,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-21 13:57:07,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:07,882 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:07,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 13:57:07,883 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:07,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:07,884 INFO L85 PathProgramCache]: Analyzing trace with hash 452746622, now seen corresponding path program 1 times [2022-11-21 13:57:07,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:07,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076075972] [2022-11-21 13:57:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:07,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:08,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:08,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:08,115 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:57:08,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:08,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076075972] [2022-11-21 13:57:08,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076075972] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:57:08,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:57:08,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 13:57:08,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449834506] [2022-11-21 13:57:08,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:57:08,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:57:08,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:08,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:57:08,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:57:08,118 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:08,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:08,454 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2022-11-21 13:57:08,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:57:08,454 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-21 13:57:08,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:08,455 INFO L225 Difference]: With dead ends: 118 [2022-11-21 13:57:08,455 INFO L226 Difference]: Without dead ends: 118 [2022-11-21 13:57:08,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:57:08,456 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 308 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:08,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 349 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:57:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-21 13:57:08,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 95. [2022-11-21 13:57:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 90 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:57:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-11-21 13:57:08,459 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 35 [2022-11-21 13:57:08,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:08,459 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-11-21 13:57:08,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-11-21 13:57:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-21 13:57:08,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:08,460 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:08,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 13:57:08,461 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:08,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash 452746623, now seen corresponding path program 1 times [2022-11-21 13:57:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:08,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850669397] [2022-11-21 13:57:08,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:08,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:08,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:08,838 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:57:08,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:08,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850669397] [2022-11-21 13:57:08,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850669397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:57:08,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:57:08,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 13:57:08,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134157365] [2022-11-21 13:57:08,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:57:08,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:57:08,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:08,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:57:08,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:57:08,840 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:09,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:09,255 INFO L93 Difference]: Finished difference Result 142 states and 157 transitions. [2022-11-21 13:57:09,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:57:09,256 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2022-11-21 13:57:09,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:09,257 INFO L225 Difference]: With dead ends: 142 [2022-11-21 13:57:09,257 INFO L226 Difference]: Without dead ends: 142 [2022-11-21 13:57:09,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:57:09,258 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 315 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:09,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 530 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:57:09,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-21 13:57:09,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 95. [2022-11-21 13:57:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.492537313432836) internal successors, (100), 90 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:57:09,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2022-11-21 13:57:09,261 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 35 [2022-11-21 13:57:09,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:09,261 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2022-11-21 13:57:09,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:09,261 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2022-11-21 13:57:09,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-21 13:57:09,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:09,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:09,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 13:57:09,262 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:09,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:09,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1577337163, now seen corresponding path program 1 times [2022-11-21 13:57:09,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:09,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963968346] [2022-11-21 13:57:09,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:09,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:09,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:09,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:10,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:57:10,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:10,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963968346] [2022-11-21 13:57:10,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963968346] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:57:10,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341806257] [2022-11-21 13:57:10,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:10,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:57:10,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:57:10,104 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:57:10,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 13:57:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:10,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-21 13:57:10,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:57:10,341 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-21 13:57:10,497 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:57:10,497 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-21 13:57:10,573 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-21 13:57:10,638 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:57:10,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-21 13:57:10,709 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:57:10,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-21 13:57:10,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-21 13:57:10,910 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 25 treesize of output 13 [2022-11-21 13:57:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:57:10,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:57:10,969 INFO L321 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-11-21 13:57:10,970 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 19 treesize of output 18 [2022-11-21 13:57:10,975 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1579 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2022-11-21 13:57:15,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:57:15,689 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 21 treesize of output 22 [2022-11-21 13:57:15,694 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 60 treesize of output 52 [2022-11-21 13:57:15,701 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 24 treesize of output 22 [2022-11-21 13:57:15,704 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 46 treesize of output 42 [2022-11-21 13:57:15,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341806257] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:57:15,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:57:15,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 31 [2022-11-21 13:57:15,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969637422] [2022-11-21 13:57:15,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:57:15,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-21 13:57:15,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:15,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-21 13:57:15,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1078, Unknown=25, NotChecked=66, Total=1260 [2022-11-21 13:57:15,903 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:57:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:17,341 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2022-11-21 13:57:17,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 13:57:17,341 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2022-11-21 13:57:17,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:17,343 INFO L225 Difference]: With dead ends: 136 [2022-11-21 13:57:17,343 INFO L226 Difference]: Without dead ends: 136 [2022-11-21 13:57:17,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=221, Invalid=1738, Unknown=25, NotChecked=86, Total=2070 [2022-11-21 13:57:17,345 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 221 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:17,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1051 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 13:57:17,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-21 13:57:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2022-11-21 13:57:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 100 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:57:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-11-21 13:57:17,350 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 38 [2022-11-21 13:57:17,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:17,351 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-11-21 13:57:17,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 27 states have internal predecessors, (56), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:57:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-11-21 13:57:17,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-21 13:57:17,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:17,352 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:17,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 13:57:17,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-21 13:57:17,578 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:17,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:17,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1577337164, now seen corresponding path program 1 times [2022-11-21 13:57:17,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:17,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165890846] [2022-11-21 13:57:17,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:17,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:18,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:18,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:19,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:57:19,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:19,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165890846] [2022-11-21 13:57:19,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165890846] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:57:19,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429030639] [2022-11-21 13:57:19,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:19,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:57:19,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:57:19,120 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:57:19,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 13:57:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:19,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-21 13:57:19,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:57:19,374 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-21 13:57:19,380 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-21 13:57:19,863 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:57:19,864 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-21 13:57:19,892 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:57:19,892 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-21 13:57:20,043 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-21 13:57:20,054 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-21 13:57:20,180 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:57:20,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2022-11-21 13:57:20,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 13:57:20,415 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:57:20,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-21 13:57:20,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 13:57:20,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:57:20,516 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-21 13:57:20,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:57:20,532 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-21 13:57:20,817 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 25 treesize of output 13 [2022-11-21 13:57:20,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:57:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 13:57:20,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:57:21,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:57:21,894 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 43 treesize of output 44 [2022-11-21 13:57:21,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:57:21,904 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 35 treesize of output 36 [2022-11-21 13:57:21,914 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 116 treesize of output 108 [2022-11-21 13:57:21,921 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 334 treesize of output 314 [2022-11-21 13:57:21,934 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 158 treesize of output 150 [2022-11-21 13:57:21,945 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 302 treesize of output 286 [2022-11-21 13:57:21,951 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 286 treesize of output 270 [2022-11-21 13:57:21,963 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 270 treesize of output 262 [2022-11-21 13:57:22,227 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:57:22,227 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-21 13:57:22,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:57:22,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:57:22,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-21 13:57:32,678 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification. DAG size of input: 35 DAG size of output: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:57:32,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429030639] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:57:32,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:57:32,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2022-11-21 13:57:32,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451987688] [2022-11-21 13:57:32,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:57:32,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-21 13:57:32,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:32,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-21 13:57:32,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2508, Unknown=2, NotChecked=0, Total=2652 [2022-11-21 13:57:32,683 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 13:57:36,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:36,083 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2022-11-21 13:57:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 13:57:36,084 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-11-21 13:57:36,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:36,086 INFO L225 Difference]: With dead ends: 216 [2022-11-21 13:57:36,086 INFO L226 Difference]: Without dead ends: 216 [2022-11-21 13:57:36,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=351, Invalid=3937, Unknown=2, NotChecked=0, Total=4290 [2022-11-21 13:57:36,088 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 1258 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1258 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:36,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1258 Valid, 2241 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-21 13:57:36,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-21 13:57:36,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 113. [2022-11-21 13:57:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 108 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:57:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2022-11-21 13:57:36,092 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 38 [2022-11-21 13:57:36,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:36,093 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2022-11-21 13:57:36,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 34 states have internal predecessors, (66), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 13:57:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2022-11-21 13:57:36,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-21 13:57:36,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:36,094 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:36,108 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 13:57:36,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:57:36,307 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:36,308 INFO L85 PathProgramCache]: Analyzing trace with hash -511950436, now seen corresponding path program 1 times [2022-11-21 13:57:36,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:36,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560597078] [2022-11-21 13:57:36,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:36,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:36,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:36,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:36,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-21 13:57:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 13:57:36,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:36,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560597078] [2022-11-21 13:57:36,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560597078] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:57:36,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163226438] [2022-11-21 13:57:36,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:36,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:57:36,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:57:36,473 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:57:36,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 13:57:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:36,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-21 13:57:36,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:57:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 13:57:36,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:57:36,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163226438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:57:36,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:57:36,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-21 13:57:36,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058420914] [2022-11-21 13:57:36,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:57:36,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 13:57:36,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:36,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 13:57:36,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:57:36,777 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:57:36,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:36,788 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2022-11-21 13:57:36,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 13:57:36,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-11-21 13:57:36,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:36,790 INFO L225 Difference]: With dead ends: 96 [2022-11-21 13:57:36,790 INFO L226 Difference]: Without dead ends: 96 [2022-11-21 13:57:36,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:57:36,791 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 63 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:36,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 105 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 13:57:36,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-21 13:57:36,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-11-21 13:57:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 92 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:57:36,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2022-11-21 13:57:36,795 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 41 [2022-11-21 13:57:36,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:36,795 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2022-11-21 13:57:36,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 13:57:36,795 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2022-11-21 13:57:36,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-21 13:57:36,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:36,796 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:36,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 13:57:37,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 13:57:37,003 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:37,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:37,003 INFO L85 PathProgramCache]: Analyzing trace with hash -784093497, now seen corresponding path program 2 times [2022-11-21 13:57:37,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:37,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597408118] [2022-11-21 13:57:37,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:37,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:37,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:37,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 13:57:37,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:37,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597408118] [2022-11-21 13:57:37,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597408118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:57:37,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:57:37,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:57:37,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10228886] [2022-11-21 13:57:37,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:57:37,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:57:37,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:37,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:57:37,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:57:37,172 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:37,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:37,305 INFO L93 Difference]: Finished difference Result 113 states and 126 transitions. [2022-11-21 13:57:37,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:57:37,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2022-11-21 13:57:37,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:37,307 INFO L225 Difference]: With dead ends: 113 [2022-11-21 13:57:37,307 INFO L226 Difference]: Without dead ends: 113 [2022-11-21 13:57:37,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:57:37,308 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 247 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:37,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 221 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:57:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-21 13:57:37,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 96. [2022-11-21 13:57:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 92 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:57:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2022-11-21 13:57:37,311 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 41 [2022-11-21 13:57:37,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:37,312 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2022-11-21 13:57:37,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2022-11-21 13:57:37,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 13:57:37,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:37,312 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:37,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 13:57:37,313 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:37,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:37,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2032584715, now seen corresponding path program 1 times [2022-11-21 13:57:37,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:37,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672809508] [2022-11-21 13:57:37,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:37,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:37,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:37,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 13:57:37,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:37,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672809508] [2022-11-21 13:57:37,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672809508] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:57:37,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719260902] [2022-11-21 13:57:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:37,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:57:37,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:57:37,445 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:57:37,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 13:57:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:37,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 13:57:37,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:57:37,786 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 13:57:37,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:57:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 13:57:37,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719260902] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:57:37,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:57:37,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2022-11-21 13:57:37,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569266412] [2022-11-21 13:57:37,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:57:37,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:57:37,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:37,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:57:37,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:57:37,854 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 13:57:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:37,960 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-11-21 13:57:37,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:57:37,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2022-11-21 13:57:37,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:37,961 INFO L225 Difference]: With dead ends: 115 [2022-11-21 13:57:37,961 INFO L226 Difference]: Without dead ends: 115 [2022-11-21 13:57:37,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:57:37,962 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 218 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:37,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 273 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:57:37,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-21 13:57:37,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2022-11-21 13:57:37,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.430232558139535) internal successors, (123), 105 states have internal predecessors, (123), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:57:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2022-11-21 13:57:37,965 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 45 [2022-11-21 13:57:37,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:37,965 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2022-11-21 13:57:37,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 13:57:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2022-11-21 13:57:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-21 13:57:37,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:37,966 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:37,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 13:57:38,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:57:38,167 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:38,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1454244195, now seen corresponding path program 1 times [2022-11-21 13:57:38,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:38,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127017279] [2022-11-21 13:57:38,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:38,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 13:57:38,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:38,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127017279] [2022-11-21 13:57:38,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127017279] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:57:38,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029963043] [2022-11-21 13:57:38,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:38,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:57:38,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:57:38,345 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:57:38,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 13:57:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:38,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 13:57:38,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:57:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 13:57:38,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:57:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 13:57:38,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029963043] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:57:38,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:57:38,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-11-21 13:57:38,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670772529] [2022-11-21 13:57:38,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:57:38,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 13:57:38,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:38,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 13:57:38,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:57:38,775 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 13:57:38,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:38,914 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2022-11-21 13:57:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:57:38,915 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-11-21 13:57:38,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:38,915 INFO L225 Difference]: With dead ends: 96 [2022-11-21 13:57:38,916 INFO L226 Difference]: Without dead ends: 96 [2022-11-21 13:57:38,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-21 13:57:38,916 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 328 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:38,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 275 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:57:38,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-21 13:57:38,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-11-21 13:57:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 86 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:57:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2022-11-21 13:57:38,920 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 46 [2022-11-21 13:57:38,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:38,920 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2022-11-21 13:57:38,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 13:57:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2022-11-21 13:57:38,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-21 13:57:38,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:38,921 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:38,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 13:57:39,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-21 13:57:39,127 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:39,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:39,128 INFO L85 PathProgramCache]: Analyzing trace with hash -748626799, now seen corresponding path program 2 times [2022-11-21 13:57:39,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:39,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144945618] [2022-11-21 13:57:39,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:39,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:39,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:39,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 13:57:39,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:39,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144945618] [2022-11-21 13:57:39,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144945618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:57:39,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:57:39,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 13:57:39,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574347028] [2022-11-21 13:57:39,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:57:39,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:57:39,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:39,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:57:39,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:57:39,395 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:39,729 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2022-11-21 13:57:39,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:57:39,730 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-11-21 13:57:39,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:39,730 INFO L225 Difference]: With dead ends: 118 [2022-11-21 13:57:39,730 INFO L226 Difference]: Without dead ends: 118 [2022-11-21 13:57:39,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:57:39,731 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 271 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:39,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 307 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 13:57:39,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-21 13:57:39,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2022-11-21 13:57:39,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 92 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:57:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 113 transitions. [2022-11-21 13:57:39,735 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 113 transitions. Word has length 50 [2022-11-21 13:57:39,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:39,736 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 113 transitions. [2022-11-21 13:57:39,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:39,736 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 113 transitions. [2022-11-21 13:57:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-21 13:57:39,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:39,737 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:39,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 13:57:39,737 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:39,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:39,738 INFO L85 PathProgramCache]: Analyzing trace with hash -748626798, now seen corresponding path program 1 times [2022-11-21 13:57:39,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:39,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835294502] [2022-11-21 13:57:39,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:39,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:39,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:39,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:39,879 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 13:57:39,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:39,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835294502] [2022-11-21 13:57:39,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835294502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:57:39,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:57:39,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:57:39,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468777230] [2022-11-21 13:57:39,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:57:39,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:57:39,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:39,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:57:39,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:57:39,881 INFO L87 Difference]: Start difference. First operand 96 states and 113 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:39,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:39,994 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-11-21 13:57:39,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:57:39,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-11-21 13:57:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:39,995 INFO L225 Difference]: With dead ends: 101 [2022-11-21 13:57:39,995 INFO L226 Difference]: Without dead ends: 101 [2022-11-21 13:57:39,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:57:39,996 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 92 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:39,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 239 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:57:39,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-21 13:57:39,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2022-11-21 13:57:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.394736842105263) internal successors, (106), 91 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:57:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2022-11-21 13:57:40,000 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 50 [2022-11-21 13:57:40,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:40,001 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2022-11-21 13:57:40,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:40,001 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2022-11-21 13:57:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-21 13:57:40,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:40,002 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:40,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-21 13:57:40,002 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:40,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:40,003 INFO L85 PathProgramCache]: Analyzing trace with hash -748626743, now seen corresponding path program 1 times [2022-11-21 13:57:40,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:40,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190367805] [2022-11-21 13:57:40,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:40,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:40,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:40,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 13:57:40,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:40,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190367805] [2022-11-21 13:57:40,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190367805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:57:40,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:57:40,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 13:57:40,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630692586] [2022-11-21 13:57:40,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:57:40,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:57:40,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:40,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:57:40,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:57:40,449 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:40,805 INFO L93 Difference]: Finished difference Result 130 states and 144 transitions. [2022-11-21 13:57:40,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:57:40,806 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-11-21 13:57:40,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:40,806 INFO L225 Difference]: With dead ends: 130 [2022-11-21 13:57:40,807 INFO L226 Difference]: Without dead ends: 130 [2022-11-21 13:57:40,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:57:40,807 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 378 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:40,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 337 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:57:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-21 13:57:40,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 95. [2022-11-21 13:57:40,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.355263157894737) internal successors, (103), 91 states have internal predecessors, (103), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:57:40,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2022-11-21 13:57:40,811 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 50 [2022-11-21 13:57:40,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:40,811 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2022-11-21 13:57:40,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:57:40,811 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-11-21 13:57:40,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-21 13:57:40,811 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:40,812 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:40,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-21 13:57:40,812 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:40,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:40,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1425902980, now seen corresponding path program 1 times [2022-11-21 13:57:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:40,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161767309] [2022-11-21 13:57:40,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:40,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:42,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:42,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:42,288 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:57:42,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:42,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161767309] [2022-11-21 13:57:42,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161767309] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:57:42,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250798199] [2022-11-21 13:57:42,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:42,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:57:42,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:57:42,291 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:57:42,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 13:57:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:42,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-21 13:57:42,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:57:42,634 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-21 13:57:42,775 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:57:42,775 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-21 13:57:42,814 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-21 13:57:42,887 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:57:42,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-21 13:57:42,936 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:57:42,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-21 13:57:42,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:57:42,951 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-21 13:57:43,206 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:57:43,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-21 13:57:43,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:57:43,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-21 13:57:43,430 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 25 treesize of output 13 [2022-11-21 13:57:43,438 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 13:57:43,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:57:44,389 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2995 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_2995) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2022-11-21 13:57:44,400 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2995 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2995) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2022-11-21 13:57:44,408 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2995 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_2995) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) 1)) is different from false [2022-11-21 13:57:44,418 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2995 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2995) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1)) is different from false [2022-11-21 13:57:44,427 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2995 (Array Int Int)) (v_ArrVal_2994 Int)) (= (select |c_#valid| (select (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2994)) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2995)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1)) is different from false [2022-11-21 13:57:44,440 INFO L321 Elim1Store]: treesize reduction 5, result has 86.8 percent of original size [2022-11-21 13:57:44,440 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 42 treesize of output 41 [2022-11-21 13:57:44,450 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2995 (Array Int Int)) (v_ArrVal_2992 (Array Int Int)) (v_ArrVal_2994 Int)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2992))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2994)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_2995))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2022-11-21 13:57:44,582 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2995 (Array Int Int)) (v_ArrVal_2992 (Array Int Int)) (v_ArrVal_2994 Int) (v_ArrVal_2991 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2991) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2992))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) v_ArrVal_2994)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_2995))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2022-11-21 13:57:44,596 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:57:44,597 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 66 treesize of output 51 [2022-11-21 13:57:44,602 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 282 treesize of output 254 [2022-11-21 13:57:44,610 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 250 treesize of output 226 [2022-11-21 13:57:44,615 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 226 treesize of output 210 [2022-11-21 13:57:44,620 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 210 treesize of output 198 [2022-11-21 13:57:44,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250798199] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:57:44,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:57:44,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 33 [2022-11-21 13:57:44,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364290771] [2022-11-21 13:57:44,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:57:44,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-21 13:57:44,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:57:44,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-21 13:57:44,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1468, Unknown=50, NotChecked=588, Total=2256 [2022-11-21 13:57:44,888 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 30 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:57:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:57:46,363 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2022-11-21 13:57:46,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 13:57:46,364 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 30 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-11-21 13:57:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:57:46,365 INFO L225 Difference]: With dead ends: 158 [2022-11-21 13:57:46,365 INFO L226 Difference]: Without dead ends: 158 [2022-11-21 13:57:46,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=315, Invalid=2522, Unknown=53, NotChecked=770, Total=3660 [2022-11-21 13:57:46,367 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 278 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 13:57:46,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1098 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 13:57:46,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-21 13:57:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 103. [2022-11-21 13:57:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 99 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:57:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2022-11-21 13:57:46,371 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 53 [2022-11-21 13:57:46,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:57:46,372 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2022-11-21 13:57:46,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.242424242424242) internal successors, (74), 30 states have internal predecessors, (74), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:57:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2022-11-21 13:57:46,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-21 13:57:46,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:57:46,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:57:46,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 13:57:46,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-21 13:57:46,583 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:57:46,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:57:46,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1425902981, now seen corresponding path program 1 times [2022-11-21 13:57:46,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:57:46,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545897903] [2022-11-21 13:57:46,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:46,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:57:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:48,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:57:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:48,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:57:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:57:48,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:57:48,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545897903] [2022-11-21 13:57:48,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545897903] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:57:48,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415841258] [2022-11-21 13:57:48,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:57:48,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:57:48,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:57:48,855 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:57:48,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 13:57:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:57:49,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 113 conjunts are in the unsatisfiable core [2022-11-21 13:57:49,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:57:49,219 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-21 13:57:49,227 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-21 13:57:49,748 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:57:49,748 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-21 13:57:49,754 WARN L837 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_6| |c_#length|))) (and (= |c_#length| (store |v_#length_BEFORE_CALL_6| .cse0 (select |c_#length| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (<= 12 (select |v_#length_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) is different from false [2022-11-21 13:57:49,757 WARN L859 $PredicateComparison]: unable to prove that (and (<= 0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_6| |c_#length|))) (and (= |c_#length| (store |v_#length_BEFORE_CALL_6| .cse0 (select |c_#length| .cse0))) (= .cse0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (<= 12 (select |v_#length_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) is different from true [2022-11-21 13:57:49,857 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-21 13:57:49,870 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-21 13:57:50,001 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:57:50,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2022-11-21 13:57:50,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 13:57:50,218 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:57:50,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-21 13:57:50,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 13:57:50,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:57:50,263 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-21 13:57:50,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:57:50,271 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-21 13:57:50,600 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:57:50,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-21 13:57:50,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 13:57:50,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:57:50,760 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-21 13:57:50,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:57:50,768 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-21 13:57:50,911 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 25 treesize of output 13 [2022-11-21 13:57:50,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-21 13:57:50,929 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 13:57:50,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:57:51,648 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3205 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3205) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3206) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_3205 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3205) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) is different from false [2022-11-21 13:57:51,669 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3205 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3205) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3206) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_3205 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3205) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)))) is different from false [2022-11-21 13:57:51,682 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_3205 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3205) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (forall ((v_ArrVal_3205 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3205) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3206) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-11-21 13:57:51,715 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (forall ((v_ArrVal_3205 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3205) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8))) (forall ((v_ArrVal_3205 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3205) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3206) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-11-21 13:57:51,932 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_3205 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3205) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3206) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_3205 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3205) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 8))))) is different from false [2022-11-21 13:57:51,947 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_3203 Int) (v_ArrVal_3205 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 .cse1 v_ArrVal_3203)) .cse2 v_ArrVal_3205) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_3203 Int) (v_ArrVal_3204 Int) (v_ArrVal_3205 (Array Int Int)) (v_ArrVal_3206 (Array Int Int))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 .cse1 v_ArrVal_3203)) .cse2 v_ArrVal_3205) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_ArrVal_3204)) .cse2 v_ArrVal_3206) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) is different from false [2022-11-21 13:57:54,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:57:54,753 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 68 treesize of output 61 [2022-11-21 13:57:54,760 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 562 treesize of output 550 [2022-11-21 13:57:54,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:57:54,772 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 546 treesize of output 426 [2022-11-21 13:57:54,779 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 1066 treesize of output 998 [2022-11-21 13:57:54,798 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 994 treesize of output 962 [2022-11-21 13:57:54,810 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 962 treesize of output 898 [2022-11-21 13:57:54,824 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 449 treesize of output 445 [2022-11-21 13:57:54,835 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 894 treesize of output 878 [2022-11-21 13:57:54,846 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 878 treesize of output 870 [2022-11-21 13:57:55,087 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:57:55,088 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 126 [2022-11-21 13:57:55,091 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:57:55,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:57:55,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 192 [2022-11-21 13:57:55,103 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:57:55,103 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 132 [2022-11-21 13:57:55,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:57:55,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:57:55,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 70 [2022-11-21 13:57:55,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-11-21 13:57:55,119 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 32 treesize of output 28 [2022-11-21 13:58:05,580 WARN L233 SmtUtils]: Spent 10.06s on a formula simplification. DAG size of input: 35 DAG size of output: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 13:58:05,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415841258] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:58:05,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:58:05,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 40 [2022-11-21 13:58:05,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168402958] [2022-11-21 13:58:05,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:05,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-21 13:58:05,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:05,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-21 13:58:05,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2454, Unknown=31, NotChecked=742, Total=3422 [2022-11-21 13:58:05,584 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 41 states, 40 states have (on average 2.05) internal successors, (82), 36 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 13:58:05,964 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (<= 0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) .cse0 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_6| |c_#length|))) (and (= |c_#length| (store |v_#length_BEFORE_CALL_6| .cse1 (select |c_#length| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (<= 12 (select |v_#length_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) .cse0) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2022-11-21 13:58:05,967 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (<= 12 (select |c_#length| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) (<= 0 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|)) .cse0 (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (<= |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_6| |c_#length|))) (and (= |c_#length| (store |v_#length_BEFORE_CALL_6| .cse1 (select |c_#length| .cse1))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) (<= 12 (select |v_#length_BEFORE_CALL_6| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) .cse0) (<= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from true [2022-11-21 13:58:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:08,145 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2022-11-21 13:58:08,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 13:58:08,146 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.05) internal successors, (82), 36 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 53 [2022-11-21 13:58:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:08,147 INFO L225 Difference]: With dead ends: 176 [2022-11-21 13:58:08,147 INFO L226 Difference]: Without dead ends: 176 [2022-11-21 13:58:08,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=409, Invalid=3880, Unknown=33, NotChecked=1080, Total=5402 [2022-11-21 13:58:08,149 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 696 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:08,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1173 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 993 Invalid, 0 Unknown, 108 Unchecked, 1.0s Time] [2022-11-21 13:58:08,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-21 13:58:08,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 102. [2022-11-21 13:58:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 98 states have internal predecessors, (112), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:58:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2022-11-21 13:58:08,153 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 53 [2022-11-21 13:58:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:08,153 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2022-11-21 13:58:08,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.05) internal successors, (82), 36 states have internal predecessors, (82), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 13:58:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2022-11-21 13:58:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-21 13:58:08,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:08,154 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:08,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-21 13:58:08,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-21 13:58:08,355 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:58:08,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:08,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1850823601, now seen corresponding path program 2 times [2022-11-21 13:58:08,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:08,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660813950] [2022-11-21 13:58:08,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:08,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:08,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:58:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:08,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:58:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-21 13:58:08,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:08,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660813950] [2022-11-21 13:58:08,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660813950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:08,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:08,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:58:08,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804621587] [2022-11-21 13:58:08,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:08,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:58:08,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:08,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:58:08,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:58:08,540 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:58:08,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:08,664 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-11-21 13:58:08,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:58:08,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2022-11-21 13:58:08,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:08,666 INFO L225 Difference]: With dead ends: 88 [2022-11-21 13:58:08,666 INFO L226 Difference]: Without dead ends: 88 [2022-11-21 13:58:08,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:58:08,667 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 163 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:08,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 150 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-21 13:58:08,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-21 13:58:08,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 84 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:58:08,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-11-21 13:58:08,669 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 56 [2022-11-21 13:58:08,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:08,670 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-11-21 13:58:08,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:58:08,670 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-11-21 13:58:08,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-21 13:58:08,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:08,670 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:08,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-21 13:58:08,671 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:58:08,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:08,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1490386454, now seen corresponding path program 1 times [2022-11-21 13:58:08,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:08,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077579051] [2022-11-21 13:58:08,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:08,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:11,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:58:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:11,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:58:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 13:58:11,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:11,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077579051] [2022-11-21 13:58:11,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077579051] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:58:11,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018764844] [2022-11-21 13:58:11,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:11,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:11,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:11,566 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:11,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 13:58:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:11,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-21 13:58:11,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:11,930 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-21 13:58:12,265 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:58:12,265 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-21 13:58:12,421 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-21 13:58:12,558 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:58:12,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-21 13:58:12,773 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:58:12,773 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 22 treesize of output 22 [2022-11-21 13:58:12,805 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 26 treesize of output 21 [2022-11-21 13:58:12,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:58:13,642 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:58:13,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2022-11-21 13:58:13,650 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 29 treesize of output 21 [2022-11-21 13:58:13,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:58:13,657 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 32 treesize of output 34 [2022-11-21 13:58:14,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:58:14,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:58:14,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-11-21 13:58:14,055 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 30 treesize of output 32 [2022-11-21 13:58:14,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:58:14,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-11-21 13:58:14,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2022-11-21 13:58:14,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-21 13:58:14,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-21 13:58:14,876 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:58:14,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:58:15,315 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse0 (* |c_ULTIMATE.start_main_~len~0#1| 2))) (and (forall ((v_ArrVal_3537 Int) (v_ArrVal_3535 Int) (v_ArrVal_3538 (Array Int Int))) (<= .cse0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3538) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse1 .cse2 v_ArrVal_3537)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse3 .cse2 v_ArrVal_3535)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)) 1))) (forall ((v_ArrVal_3537 Int) (v_ArrVal_3535 Int) (v_ArrVal_3538 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3538) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse1 .cse2 v_ArrVal_3537)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse3 .cse2 v_ArrVal_3535)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 8)) 1) .cse0)))) is different from false [2022-11-21 13:58:15,776 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:58:15,777 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 50 treesize of output 51 [2022-11-21 13:58:15,793 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:58:15,793 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 104 treesize of output 103 [2022-11-21 13:58:15,803 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 39 treesize of output 23 [2022-11-21 13:58:15,877 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:58:15,878 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 50 treesize of output 51 [2022-11-21 13:58:15,900 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:58:15,901 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 104 treesize of output 103 [2022-11-21 13:58:15,909 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 39 treesize of output 23 [2022-11-21 13:58:15,993 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3533) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3535 Int) (v_ArrVal_3532 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3532) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3535) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_3533) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)))))) is different from false [2022-11-21 13:58:16,096 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3535 Int) (v_ArrVal_3532 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3532) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3535) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (<= .cse0 .cse1) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3533) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|)))) (<= .cse1 .cse0) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_3533) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))))) is different from false [2022-11-21 13:58:16,145 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|)) (.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_update_at_~data#1| 1))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (forall ((v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3533) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3533) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3535 Int) (v_ArrVal_3532 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3532) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3535) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (<= .cse1 .cse2) (<= .cse2 .cse1))) is different from false [2022-11-21 13:58:16,233 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3533) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (= .cse1 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3533) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_3535 Int) (v_ArrVal_3532 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3532) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3535) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2022-11-21 13:58:16,836 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3533)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) is different from false [2022-11-21 13:58:16,850 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int)) (v_ArrVal_3526 (Array Int Int))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3526))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_3533))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) is different from false [2022-11-21 13:58:17,056 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_3537 Int) (v_ArrVal_3533 (Array Int Int)) (v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3526 (Array Int Int))) (or (not (= (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_3526))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_3533))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| 8) v_ArrVal_3537) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2022-11-21 13:58:17,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:58:17,078 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 72 treesize of output 57 [2022-11-21 13:58:17,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 419 treesize of output 405 [2022-11-21 13:58:17,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:58:17,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 350 treesize of output 346 [2022-11-21 13:58:17,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:58:17,105 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 306 treesize of output 290 [2022-11-21 13:58:17,110 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:58:17,112 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 194 treesize of output 186 [2022-11-21 13:58:17,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 13:58:17,119 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 145 treesize of output 139 [2022-11-21 13:58:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-21 13:58:17,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018764844] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:58:17,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:58:17,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30, 31] total 83 [2022-11-21 13:58:17,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254844257] [2022-11-21 13:58:17,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:17,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-21 13:58:17,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:17,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-21 13:58:17,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=5244, Unknown=62, NotChecked=1224, Total=6806 [2022-11-21 13:58:17,978 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 83 states, 82 states have (on average 1.7195121951219512) internal successors, (141), 74 states have internal predecessors, (141), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 13:58:26,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:26,232 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-11-21 13:58:26,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-21 13:58:26,232 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 1.7195121951219512) internal successors, (141), 74 states have internal predecessors, (141), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2022-11-21 13:58:26,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:26,233 INFO L225 Difference]: With dead ends: 88 [2022-11-21 13:58:26,233 INFO L226 Difference]: Without dead ends: 88 [2022-11-21 13:58:26,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 106 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 2712 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=711, Invalid=9158, Unknown=63, NotChecked=1624, Total=11556 [2022-11-21 13:58:26,236 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 510 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 2418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 622 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:26,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1829 Invalid, 2418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1767 Invalid, 1 Unknown, 622 Unchecked, 2.2s Time] [2022-11-21 13:58:26,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-21 13:58:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-21 13:58:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 84 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:58:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-11-21 13:58:26,239 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 57 [2022-11-21 13:58:26,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:26,240 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-11-21 13:58:26,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 1.7195121951219512) internal successors, (141), 74 states have internal predecessors, (141), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-21 13:58:26,240 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-11-21 13:58:26,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-21 13:58:26,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:26,241 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:26,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-21 13:58:26,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-21 13:58:26,448 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:58:26,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:26,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1792642665, now seen corresponding path program 1 times [2022-11-21 13:58:26,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:26,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469420996] [2022-11-21 13:58:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:27,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:58:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:27,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:58:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 13:58:27,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:27,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469420996] [2022-11-21 13:58:27,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469420996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:58:27,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813174688] [2022-11-21 13:58:27,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:27,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:27,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:27,636 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:27,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-21 13:58:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:27,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-21 13:58:27,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:28,212 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 17 treesize of output 13 [2022-11-21 13:58:28,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-21 13:58:28,585 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-21 13:58:28,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:58:28,857 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 38 treesize of output 32 [2022-11-21 13:58:28,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:58:28,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:58:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-21 13:58:29,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813174688] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:58:29,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:58:29,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 12] total 38 [2022-11-21 13:58:29,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677494150] [2022-11-21 13:58:29,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:29,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-21 13:58:29,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:29,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-21 13:58:29,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1277, Unknown=0, NotChecked=0, Total=1406 [2022-11-21 13:58:29,061 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 36 states have internal predecessors, (143), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 13:58:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:30,545 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-11-21 13:58:30,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 13:58:30,546 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 36 states have internal predecessors, (143), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 64 [2022-11-21 13:58:30,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:30,547 INFO L225 Difference]: With dead ends: 122 [2022-11-21 13:58:30,547 INFO L226 Difference]: Without dead ends: 122 [2022-11-21 13:58:30,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=395, Invalid=2257, Unknown=0, NotChecked=0, Total=2652 [2022-11-21 13:58:30,548 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 991 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:30,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 829 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 13:58:30,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-21 13:58:30,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 92. [2022-11-21 13:58:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 88 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:58:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-11-21 13:58:30,552 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 64 [2022-11-21 13:58:30,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:30,552 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-11-21 13:58:30,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.763157894736842) internal successors, (143), 36 states have internal predecessors, (143), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 13:58:30,552 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-11-21 13:58:30,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-21 13:58:30,553 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:30,553 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:30,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-21 13:58:30,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-21 13:58:30,754 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:58:30,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:30,754 INFO L85 PathProgramCache]: Analyzing trace with hash 3674256, now seen corresponding path program 2 times [2022-11-21 13:58:30,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:30,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627527706] [2022-11-21 13:58:30,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:30,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:30,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:58:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:30,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:58:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 13:58:30,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:30,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627527706] [2022-11-21 13:58:30,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627527706] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:58:30,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80466567] [2022-11-21 13:58:30,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 13:58:30,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:30,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:30,937 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:30,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-21 13:58:31,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 13:58:31,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 13:58:31,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 13:58:31,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:31,475 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 13:58:31,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:58:31,600 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-21 13:58:31,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80466567] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:58:31,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:58:31,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-11-21 13:58:31,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557709318] [2022-11-21 13:58:31,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:31,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 13:58:31,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:31,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:58:31,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:58:31,602 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 13:58:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:31,740 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-11-21 13:58:31,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:58:31,740 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 67 [2022-11-21 13:58:31,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:31,741 INFO L225 Difference]: With dead ends: 83 [2022-11-21 13:58:31,741 INFO L226 Difference]: Without dead ends: 83 [2022-11-21 13:58:31,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 130 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-21 13:58:31,741 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 125 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:31,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 248 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:31,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-21 13:58:31,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-21 13:58:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 79 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:58:31,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2022-11-21 13:58:31,745 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 67 [2022-11-21 13:58:31,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:31,745 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2022-11-21 13:58:31,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-21 13:58:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2022-11-21 13:58:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-21 13:58:31,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:31,747 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:31,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-21 13:58:31,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:31,955 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:58:31,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:31,955 INFO L85 PathProgramCache]: Analyzing trace with hash 775968223, now seen corresponding path program 1 times [2022-11-21 13:58:31,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:31,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757678445] [2022-11-21 13:58:31,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:31,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:32,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:58:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:32,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:58:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:32,120 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-21 13:58:32,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:32,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757678445] [2022-11-21 13:58:32,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757678445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:32,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:32,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 13:58:32,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272344251] [2022-11-21 13:58:32,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:32,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:58:32,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:32,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:58:32,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:58:32,125 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:58:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:32,275 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-11-21 13:58:32,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:58:32,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2022-11-21 13:58:32,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:32,276 INFO L225 Difference]: With dead ends: 101 [2022-11-21 13:58:32,276 INFO L226 Difference]: Without dead ends: 101 [2022-11-21 13:58:32,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:58:32,283 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 101 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:32,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 220 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:58:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-21 13:58:32,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 86. [2022-11-21 13:58:32,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 82 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:58:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-11-21 13:58:32,287 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 68 [2022-11-21 13:58:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:32,287 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-11-21 13:58:32,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:58:32,288 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-11-21 13:58:32,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-21 13:58:32,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:32,289 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:32,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-21 13:58:32,289 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:58:32,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:32,289 INFO L85 PathProgramCache]: Analyzing trace with hash 775968224, now seen corresponding path program 1 times [2022-11-21 13:58:32,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:32,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418777387] [2022-11-21 13:58:32,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:32,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:32,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:58:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:32,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:58:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 13:58:32,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:32,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418777387] [2022-11-21 13:58:32,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418777387] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:32,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:32,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 13:58:32,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288126412] [2022-11-21 13:58:32,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:32,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:58:32,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:32,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:58:32,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:58:32,762 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:58:33,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:33,089 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2022-11-21 13:58:33,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:58:33,089 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2022-11-21 13:58:33,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:33,090 INFO L225 Difference]: With dead ends: 84 [2022-11-21 13:58:33,090 INFO L226 Difference]: Without dead ends: 84 [2022-11-21 13:58:33,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:58:33,091 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 192 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:33,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 209 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:58:33,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-21 13:58:33,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-21 13:58:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.178082191780822) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:58:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-11-21 13:58:33,094 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 68 [2022-11-21 13:58:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:33,095 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-11-21 13:58:33,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:58:33,095 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-11-21 13:58:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-21 13:58:33,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:33,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:33,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-21 13:58:33,096 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:58:33,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:33,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1714754975, now seen corresponding path program 1 times [2022-11-21 13:58:33,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:33,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117731098] [2022-11-21 13:58:33,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:33,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:33,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:58:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:58:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 13:58:33,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:33,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117731098] [2022-11-21 13:58:33,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117731098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:33,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:33,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 13:58:33,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324264862] [2022-11-21 13:58:33,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:33,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:58:33,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:33,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:58:33,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:58:33,402 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:58:33,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:33,682 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-11-21 13:58:33,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:58:33,683 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 69 [2022-11-21 13:58:33,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:33,684 INFO L225 Difference]: With dead ends: 84 [2022-11-21 13:58:33,684 INFO L226 Difference]: Without dead ends: 84 [2022-11-21 13:58:33,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:58:33,685 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 188 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:33,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 265 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:58:33,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-21 13:58:33,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-21 13:58:33,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.1643835616438356) internal successors, (85), 80 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:58:33,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-11-21 13:58:33,687 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 69 [2022-11-21 13:58:33,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:33,688 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-11-21 13:58:33,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:58:33,688 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-11-21 13:58:33,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-21 13:58:33,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:33,689 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:33,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-21 13:58:33,689 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:58:33,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:33,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1355436959, now seen corresponding path program 1 times [2022-11-21 13:58:33,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:33,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263232731] [2022-11-21 13:58:33,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:33,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:33,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:58:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:34,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:58:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-21 13:58:34,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:34,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263232731] [2022-11-21 13:58:34,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263232731] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:58:34,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314739206] [2022-11-21 13:58:34,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:34,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:34,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:34,011 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:34,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-21 13:58:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:34,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-21 13:58:34,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:34,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 13:58:34,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-21 13:58:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 13:58:34,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:58:34,994 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-11-21 13:58:34,994 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 16 treesize of output 15 [2022-11-21 13:58:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-21 13:58:35,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314739206] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:58:35,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:58:35,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 8] total 27 [2022-11-21 13:58:35,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576498032] [2022-11-21 13:58:35,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:35,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-21 13:58:35,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:35,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-21 13:58:35,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2022-11-21 13:58:35,154 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 28 states, 27 states have (on average 4.296296296296297) internal successors, (116), 26 states have internal predecessors, (116), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 13:58:36,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:36,044 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-11-21 13:58:36,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 13:58:36,045 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.296296296296297) internal successors, (116), 26 states have internal predecessors, (116), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 71 [2022-11-21 13:58:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:36,046 INFO L225 Difference]: With dead ends: 92 [2022-11-21 13:58:36,046 INFO L226 Difference]: Without dead ends: 92 [2022-11-21 13:58:36,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=274, Invalid=1448, Unknown=0, NotChecked=0, Total=1722 [2022-11-21 13:58:36,047 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 369 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:36,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 622 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 13:58:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-21 13:58:36,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 84. [2022-11-21 13:58:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 74 states have (on average 1.162162162162162) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:58:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-11-21 13:58:36,050 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 71 [2022-11-21 13:58:36,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:36,050 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-11-21 13:58:36,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.296296296296297) internal successors, (116), 26 states have internal predecessors, (116), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-21 13:58:36,050 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-11-21 13:58:36,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-21 13:58:36,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:36,051 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:36,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-21 13:58:36,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-11-21 13:58:36,252 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:58:36,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:36,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1355436960, now seen corresponding path program 1 times [2022-11-21 13:58:36,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:36,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808228129] [2022-11-21 13:58:36,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:36,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:38,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:58:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:38,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:58:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-21 13:58:38,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:38,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808228129] [2022-11-21 13:58:38,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808228129] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:58:38,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729737735] [2022-11-21 13:58:38,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:38,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:38,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:38,402 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:38,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-21 13:58:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:38,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-21 13:58:38,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:38,844 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-21 13:58:39,201 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:58:39,201 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-21 13:58:39,340 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-21 13:58:39,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-21 13:58:39,463 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:58:39,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 13:58:39,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 13:58:39,659 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-21 13:58:39,659 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 14 treesize of output 20 [2022-11-21 13:58:39,666 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-21 13:58:39,681 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:58:39,682 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 22 treesize of output 22 [2022-11-21 13:58:39,761 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-21 13:58:39,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-21 13:58:40,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2022-11-21 13:58:40,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-21 13:58:40,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:58:40,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:58:40,591 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:58:40,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-11-21 13:58:41,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-21 13:58:41,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:58:41,289 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 35 treesize of output 17 [2022-11-21 13:58:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 13:58:41,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:58:41,892 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:58:41,893 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 32 treesize of output 36 [2022-11-21 13:58:42,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:58:42,134 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 28 treesize of output 32 [2022-11-21 13:58:43,996 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:58:43,996 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 66 treesize of output 59 [2022-11-21 13:58:44,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 530 treesize of output 518 [2022-11-21 13:58:44,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:58:44,014 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 514 treesize of output 394 [2022-11-21 13:58:44,027 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 1034 treesize of output 966 [2022-11-21 13:58:44,041 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 962 treesize of output 930 [2022-11-21 13:58:44,052 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 930 treesize of output 866 [2022-11-21 13:58:44,062 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 866 treesize of output 858 [2022-11-21 13:58:44,071 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 858 treesize of output 842 [2022-11-21 13:58:44,080 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 842 treesize of output 838 [2022-11-21 13:58:44,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729737735] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:58:44,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:58:44,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 54 [2022-11-21 13:58:44,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577223942] [2022-11-21 13:58:44,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:44,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-21 13:58:44,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:44,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-21 13:58:44,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=5553, Unknown=15, NotChecked=0, Total=5852 [2022-11-21 13:58:44,714 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 55 states, 54 states have (on average 2.185185185185185) internal successors, (118), 50 states have internal predecessors, (118), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:58:49,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:49,331 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2022-11-21 13:58:49,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-21 13:58:49,331 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.185185185185185) internal successors, (118), 50 states have internal predecessors, (118), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 71 [2022-11-21 13:58:49,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:49,332 INFO L225 Difference]: With dead ends: 93 [2022-11-21 13:58:49,332 INFO L226 Difference]: Without dead ends: 93 [2022-11-21 13:58:49,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2015 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=729, Invalid=9156, Unknown=15, NotChecked=0, Total=9900 [2022-11-21 13:58:49,334 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 560 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:49,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1177 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-21 13:58:49,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-21 13:58:49,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2022-11-21 13:58:49,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.144736842105263) internal successors, (87), 82 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:58:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-11-21 13:58:49,337 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 71 [2022-11-21 13:58:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:49,337 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-11-21 13:58:49,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.185185185185185) internal successors, (118), 50 states have internal predecessors, (118), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:58:49,338 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-11-21 13:58:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-21 13:58:49,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:49,338 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:49,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-21 13:58:49,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-21 13:58:49,539 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:58:49,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash -931128602, now seen corresponding path program 1 times [2022-11-21 13:58:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:49,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338735184] [2022-11-21 13:58:49,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:49,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:49,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:58:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:49,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:58:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-21 13:58:49,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:49,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338735184] [2022-11-21 13:58:49,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338735184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:58:49,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:58:49,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 13:58:49,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109269455] [2022-11-21 13:58:49,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:58:49,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:58:49,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:49,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:58:49,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:58:49,844 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:58:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:50,142 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-11-21 13:58:50,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 13:58:50,143 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2022-11-21 13:58:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:50,143 INFO L225 Difference]: With dead ends: 85 [2022-11-21 13:58:50,143 INFO L226 Difference]: Without dead ends: 85 [2022-11-21 13:58:50,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:58:50,144 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 173 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:50,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 230 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 13:58:50,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-21 13:58:50,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-11-21 13:58:50,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 76 states have (on average 1.118421052631579) internal successors, (85), 81 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:58:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2022-11-21 13:58:50,147 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 72 [2022-11-21 13:58:50,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:50,147 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2022-11-21 13:58:50,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.6) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-21 13:58:50,148 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-11-21 13:58:50,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-21 13:58:50,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:50,148 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:50,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-21 13:58:50,149 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:58:50,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:50,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1459966101, now seen corresponding path program 1 times [2022-11-21 13:58:50,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:50,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077246540] [2022-11-21 13:58:50,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:50,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:51,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:58:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:51,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:58:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 13:58:51,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:51,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077246540] [2022-11-21 13:58:51,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077246540] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:58:51,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501913886] [2022-11-21 13:58:51,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:51,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:51,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:51,787 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:51,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-21 13:58:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:52,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-21 13:58:52,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:52,207 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-21 13:58:52,327 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-21 13:58:52,452 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:58:52,452 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-21 13:58:52,582 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-21 13:58:52,699 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:58:52,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2022-11-21 13:58:52,871 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:58:52,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-21 13:58:52,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:58:52,904 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-21 13:58:53,198 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:58:53,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-21 13:58:53,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:58:53,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-21 13:58:53,566 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 25 treesize of output 13 [2022-11-21 13:58:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 13:58:53,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:58:54,017 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4990 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_4990) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-21 13:58:54,026 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4990 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_4990) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-21 13:58:54,147 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4990 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_4990) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-21 13:58:54,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:58:54,805 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 68 treesize of output 53 [2022-11-21 13:58:54,816 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 314 treesize of output 286 [2022-11-21 13:58:54,823 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 282 treesize of output 266 [2022-11-21 13:58:54,841 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 266 treesize of output 242 [2022-11-21 13:58:54,849 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 127 treesize of output 115 [2022-11-21 13:58:55,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501913886] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:58:55,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:58:55,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 39 [2022-11-21 13:58:55,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899381807] [2022-11-21 13:58:55,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:58:55,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-21 13:58:55,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:58:55,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-21 13:58:55,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2435, Unknown=43, NotChecked=306, Total=2970 [2022-11-21 13:58:55,192 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:58:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:58:57,245 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-11-21 13:58:57,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 13:58:57,246 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 74 [2022-11-21 13:58:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:58:57,249 INFO L225 Difference]: With dead ends: 90 [2022-11-21 13:58:57,250 INFO L226 Difference]: Without dead ends: 90 [2022-11-21 13:58:57,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 93 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=393, Invalid=3735, Unknown=44, NotChecked=384, Total=4556 [2022-11-21 13:58:57,250 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 198 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:58:57,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 638 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 13:58:57,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-21 13:58:57,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2022-11-21 13:58:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:58:57,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-11-21 13:58:57,253 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 74 [2022-11-21 13:58:57,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:58:57,254 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-11-21 13:58:57,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 35 states have internal predecessors, (106), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 13:58:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-11-21 13:58:57,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-21 13:58:57,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:58:57,255 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:58:57,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-21 13:58:57,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-21 13:58:57,455 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:58:57,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:58:57,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1941762549, now seen corresponding path program 1 times [2022-11-21 13:58:57,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:58:57,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801312275] [2022-11-21 13:58:57,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:57,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:58:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:58,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:58:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:58,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:58:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 13:58:58,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:58:58,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801312275] [2022-11-21 13:58:58,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801312275] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:58:58,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196644324] [2022-11-21 13:58:58,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:58:58,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:58:58,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:58:58,731 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:58:58,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-21 13:58:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:58:59,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-21 13:58:59,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:58:59,142 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-21 13:58:59,309 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:58:59,309 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-21 13:58:59,418 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-21 13:58:59,507 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:58:59,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-21 13:58:59,637 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:58:59,637 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 22 treesize of output 22 [2022-11-21 13:58:59,654 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 26 treesize of output 21 [2022-11-21 13:59:00,131 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:59:00,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2022-11-21 13:59:00,276 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:59:00,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2022-11-21 13:59:00,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:59:00,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 29 [2022-11-21 13:59:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 13:59:01,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:02,044 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5195 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int) (v_ArrVal_5194 (Array Int Int))) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| v_ArrVal_5194) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5195) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-21 13:59:02,072 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5195 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int) (v_ArrVal_5194 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| v_ArrVal_5194) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5195) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-21 13:59:02,086 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5195 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int) (v_ArrVal_5194 (Array Int Int))) (or (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|) v_ArrVal_5194) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 8) v_ArrVal_5195) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-21 13:59:04,275 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5195 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int) (v_ArrVal_5194 (Array Int Int))) (or (not (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_5194) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) v_ArrVal_5195) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-21 13:59:04,438 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5195 Int) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int) (v_ArrVal_5194 (Array Int Int))) (or (not (= (select (store (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5194)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5195) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-21 13:59:04,454 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5195 Int) (v_ArrVal_5191 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int) (v_ArrVal_5194 (Array Int Int))) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5191))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5194))) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_5195) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-21 13:59:04,480 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5195 Int) (v_ArrVal_5191 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int) (v_ArrVal_5194 (Array Int Int))) (or (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5191))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5194))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_5195) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|))) (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-21 13:59:04,512 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5195 Int) (v_ArrVal_5190 (Array Int Int)) (v_ArrVal_5191 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~head#1.offset| Int) (v_ArrVal_5194 (Array Int Int))) (or (not (<= |ULTIMATE.start_dll_circular_destroy_~head#1.offset| 0)) (not (= (select (store (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5190) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_5191))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) v_ArrVal_5194))) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) v_ArrVal_5195) |ULTIMATE.start_dll_circular_destroy_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~head#1.offset|)))) is different from false [2022-11-21 13:59:04,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:59:04,536 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 72 treesize of output 57 [2022-11-21 13:59:04,544 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 209 treesize of output 201 [2022-11-21 13:59:04,551 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 246 treesize of output 238 [2022-11-21 13:59:04,564 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:59:04,565 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 363 treesize of output 361 [2022-11-21 13:59:04,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:59:04,606 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 466 treesize of output 467 [2022-11-21 13:59:04,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:59:04,633 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 546 treesize of output 543 [2022-11-21 13:59:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 5 not checked. [2022-11-21 13:59:06,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196644324] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:59:06,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 13:59:06,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 28] total 70 [2022-11-21 13:59:06,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538917618] [2022-11-21 13:59:06,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 13:59:06,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-21 13:59:06,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:59:06,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-21 13:59:06,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=3539, Unknown=27, NotChecked=1016, Total=4830 [2022-11-21 13:59:06,073 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 70 states, 70 states have (on average 2.4285714285714284) internal successors, (170), 62 states have internal predecessors, (170), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-21 13:59:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:59:11,872 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-11-21 13:59:11,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 13:59:11,872 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 2.4285714285714284) internal successors, (170), 62 states have internal predecessors, (170), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 75 [2022-11-21 13:59:11,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:59:11,873 INFO L225 Difference]: With dead ends: 84 [2022-11-21 13:59:11,873 INFO L226 Difference]: Without dead ends: 84 [2022-11-21 13:59:11,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 109 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=497, Invalid=5514, Unknown=27, NotChecked=1272, Total=7310 [2022-11-21 13:59:11,874 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 248 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 538 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:59:11,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1062 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1335 Invalid, 0 Unknown, 538 Unchecked, 1.6s Time] [2022-11-21 13:59:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-21 13:59:11,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2022-11-21 13:59:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 79 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 13:59:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2022-11-21 13:59:11,877 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 75 [2022-11-21 13:59:11,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:59:11,878 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2022-11-21 13:59:11,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 2.4285714285714284) internal successors, (170), 62 states have internal predecessors, (170), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-21 13:59:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2022-11-21 13:59:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-21 13:59:11,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:59:11,879 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:59:11,887 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-21 13:59:12,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-21 13:59:12,086 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-21 13:59:12,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:59:12,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1283862180, now seen corresponding path program 1 times [2022-11-21 13:59:12,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:59:12,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981782626] [2022-11-21 13:59:12,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:12,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:59:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:14,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:59:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:14,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:59:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 13:59:14,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:59:14,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981782626] [2022-11-21 13:59:14,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981782626] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:59:14,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815061549] [2022-11-21 13:59:14,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:59:14,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:59:14,573 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:59:14,574 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:59:14,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4932ff93-875f-41ca-9f5d-841d0297565e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-21 13:59:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:59:14,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 133 conjunts are in the unsatisfiable core [2022-11-21 13:59:14,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:59:14,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-21 13:59:15,195 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 13:59:15,196 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-21 13:59:15,234 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-21 13:59:15,240 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-21 13:59:15,347 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 13:59:15,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-21 13:59:15,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-21 13:59:15,538 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-21 13:59:15,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2022-11-21 13:59:15,542 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 27 treesize of output 22 [2022-11-21 13:59:15,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:59:15,635 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:59:15,635 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 44 treesize of output 41 [2022-11-21 13:59:15,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:59:15,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-11-21 13:59:16,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:59:16,287 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:59:16,288 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 57 [2022-11-21 13:59:16,309 INFO L321 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-11-21 13:59:16,310 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-11-21 13:59:16,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 13:59:16,584 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 13:59:16,584 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 44 treesize of output 41 [2022-11-21 13:59:16,591 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 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-21 13:59:17,189 INFO L321 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2022-11-21 13:59:17,190 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 42 [2022-11-21 13:59:17,207 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 13:59:17,207 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 15 treesize of output 15 [2022-11-21 13:59:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 13:59:17,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:59:25,028 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int)) (let ((.cse1 (store .cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int)) (let ((.cse3 (select (store .cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((v_ArrVal_5411 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5411) .cse3) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (= .cse3 |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (let ((.cse4 (store .cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse4) (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5411) (select (store .cse2 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-21 13:59:25,560 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_circular_update_at_~head#1.offset|))) (and (forall ((v_ArrVal_5407 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse2 .cse3 v_ArrVal_5407)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int)) (let ((.cse5 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse2 .cse3 v_ArrVal_5407)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((v_ArrVal_5411 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse4 .cse3 v_ArrVal_5409)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5411) .cse5) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (= |c_ULTIMATE.start_main_~s~0#1.base| .cse5)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse4 .cse3 v_ArrVal_5409)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5411) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse2 .cse3 v_ArrVal_5407)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_5407 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_~head#1.base| (store .cse2 .cse3 v_ArrVal_5407)))) (let ((.cse7 (store (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= (select (select (store .cse6 |c_ULTIMATE.start_main_~s~0#1.base| .cse7) .cse8) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)))) (= |c_ULTIMATE.start_main_~s~0#1.base| .cse8)))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-21 13:59:26,015 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_5407 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store .cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5407)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (forall ((|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store .cse1 |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse0) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43|)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store .cse4 .cse5 v_ArrVal_5409)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5411) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store .cse3 .cse5 v_ArrVal_5407)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43|)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_5407 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store .cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5407)))) (let ((.cse7 (store (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (select (store .cse6 |c_ULTIMATE.start_main_~s~0#1.base| .cse7) (select .cse7 |c_ULTIMATE.start_main_~s~0#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43|)))) (forall ((|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int)) (or (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_5412 Int)) (let ((.cse9 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (let ((.cse8 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store .cse3 .cse9 v_ArrVal_5407)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_main_~s~0#1.base| .cse8) (forall ((v_ArrVal_5411 (Array Int Int)) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.base| (store .cse4 .cse9 v_ArrVal_5409)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_5411) .cse8) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)))))))) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= |c_ULTIMATE.start_dll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43|)))))) is different from false [2022-11-21 14:00:21,001 WARN L233 SmtUtils]: Spent 6.77s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:01:22,782 WARN L233 SmtUtils]: Spent 12.28s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:01:23,160 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)) (.cse2 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse4 (select |c_#memory_$Pointer$.base| .cse1))) (and (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0) (= (select (let ((.cse3 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store .cse2 .cse3 v_ArrVal_5409)) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_5411) (select (store (select (store |c_#memory_$Pointer$.base| .cse1 (store .cse4 .cse3 v_ArrVal_5407)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (forall ((v_ArrVal_5407 Int) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse1 (store .cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5407)))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (select (store .cse5 |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse6) (select .cse6 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0))) (forall ((v_ArrVal_5407 Int) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 (store .cse4 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5407)))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse7) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse9) .cse7) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0)))))) (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (let ((.cse10 (select (store (select (store |c_#memory_$Pointer$.base| .cse1 (store .cse4 .cse11 v_ArrVal_5407)) |c_ULTIMATE.start_dll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_#res#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_#res#1.base| .cse10) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store .cse2 .cse11 v_ArrVal_5409)) |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_5411) .cse10) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_#res#1.offset|)))))))) is different from false [2022-11-21 14:01:25,307 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse4)) (.cse5 (select |c_#memory_$Pointer$.base| .cse4))) (and (forall ((v_ArrVal_5407 Int) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5407)))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1) (= (select (select (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse3) .cse1) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (let ((.cse7 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (select (store (store |c_#memory_$Pointer$.offset| .cse4 (store .cse6 .cse7 v_ArrVal_5409)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5411) (select (store (select (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse7 v_ArrVal_5407)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (forall ((v_ArrVal_5407 Int) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8) v_ArrVal_5407)))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412))) (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse9) (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_5409 Int) (v_ArrVal_5407 Int) (v_ArrVal_5411 (Array Int Int)) (v_ArrVal_5412 Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| Int) (|v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| Int) (|ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| 8))) (let ((.cse11 (select (store (select (store |c_#memory_$Pointer$.base| .cse4 (store .cse5 .cse10 v_ArrVal_5407)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| 8) v_ArrVal_5412) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (or (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_43| .cse0) (< |v_ULTIMATE.start_dll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (<= 0 |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset| 0)) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 (store .cse6 .cse10 v_ArrVal_5409)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_5411) .cse11) |ULTIMATE.start_dll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse11)))))))) is different from false [2022-11-21 14:01:39,616 WARN L233 SmtUtils]: Spent 11.44s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:02:03,300 WARN L233 SmtUtils]: Spent 15.95s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:02:25,865 WARN L233 SmtUtils]: Spent 17.72s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:02:53,691 WARN L233 SmtUtils]: Spent 12.79s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 14:02:55,101 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:02:55,102 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 2933 treesize of output 2750 [2022-11-21 14:05:51,187 WARN L233 SmtUtils]: Spent 2.89m on a formula simplification that was a NOOP. DAG size: 123 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-21 14:05:51,188 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:05:51,223 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 6 new quantified variables, introduced 15 case distinctions, treesize of input 1791307666 treesize of output 1757685884 [2022-11-21 14:10:37,052 WARN L233 SmtUtils]: Spent 4.76m on a formula simplification that was a NOOP. DAG size: 19293 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-21 14:10:42,191 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 14:10:42,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1757685870 treesize of output 1039956118