./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b 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_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_append_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro --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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- 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-8393723 [2022-11-18 20:11:34,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:11:34,550 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:11:34,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:11:34,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:11:34,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:11:34,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:11:34,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:11:34,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:11:34,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:11:34,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:11:34,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:11:34,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:11:34,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:11:34,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:11:34,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:11:34,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:11:34,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:11:34,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:11:34,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:11:34,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:11:34,645 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:11:34,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:11:34,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:11:34,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:11:34,665 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:11:34,666 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:11:34,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:11:34,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:11:34,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:11:34,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:11:34,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:11:34,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:11:34,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:11:34,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:11:34,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:11:34,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:11:34,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:11:34,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:11:34,680 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:11:34,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:11:34,682 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 20:11:34,707 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:11:34,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:11:34,708 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:11:34,709 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:11:34,710 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:11:34,710 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:11:34,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:11:34,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:11:34,712 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:11:34,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:11:34,713 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:11:34,713 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:11:34,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:11:34,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:11:34,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:11:34,715 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:11:34,715 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:11:34,716 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:11:34,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:11:34,716 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:11:34,717 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:11:34,717 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:11:34,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:11:34,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:11:34,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:11:34,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:11:34,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:11:34,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:11:34,720 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:11:34,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:11:34,720 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_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/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_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2022-11-18 20:11:35,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:11:35,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:11:35,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:11:35,116 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:11:35,118 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:11:35,119 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-18 20:11:35,211 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/data/22d9082e1/09f8641764874f44956a5d6e26503040/FLAGf94f63f95 [2022-11-18 20:11:35,797 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:11:35,797 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2022-11-18 20:11:35,812 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/data/22d9082e1/09f8641764874f44956a5d6e26503040/FLAGf94f63f95 [2022-11-18 20:11:36,091 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/data/22d9082e1/09f8641764874f44956a5d6e26503040 [2022-11-18 20:11:36,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:11:36,095 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:11:36,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:11:36,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:11:36,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:11:36,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:11:36" (1/1) ... [2022-11-18 20:11:36,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4925fffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:36, skipping insertion in model container [2022-11-18 20:11:36,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:11:36" (1/1) ... [2022-11-18 20:11:36,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:11:36,152 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:11:36,593 WARN L234 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_16ba017c-381d-48e0-a1af-a65a9139765f/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-18 20:11:36,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:11:36,619 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:11:36,686 WARN L234 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_16ba017c-381d-48e0-a1af-a65a9139765f/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2022-11-18 20:11:36,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:11:36,730 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:11:36,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:36 WrapperNode [2022-11-18 20:11:36,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:11:36,733 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:11:36,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:11:36,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:11:36,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:36" (1/1) ... [2022-11-18 20:11:36,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:36" (1/1) ... [2022-11-18 20:11:36,801 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2022-11-18 20:11:36,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:11:36,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:11:36,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:11:36,803 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:11:36,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:36" (1/1) ... [2022-11-18 20:11:36,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:36" (1/1) ... [2022-11-18 20:11:36,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:36" (1/1) ... [2022-11-18 20:11:36,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:36" (1/1) ... [2022-11-18 20:11:36,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:36" (1/1) ... [2022-11-18 20:11:36,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:36" (1/1) ... [2022-11-18 20:11:36,873 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:36" (1/1) ... [2022-11-18 20:11:36,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:36" (1/1) ... [2022-11-18 20:11:36,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:11:36,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:11:36,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:11:36,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:11:36,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:36" (1/1) ... [2022-11-18 20:11:36,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:11:36,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:11:36,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:11:36,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:11:37,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:11:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:11:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-18 20:11:37,008 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-18 20:11:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:11:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:11:37,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:11:37,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:11:37,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:11:37,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:11:37,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:11:37,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:11:37,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:11:37,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:11:37,224 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:11:37,233 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:11:37,666 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:11:37,676 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:11:37,676 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 20:11:37,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:11:37 BoogieIcfgContainer [2022-11-18 20:11:37,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:11:37,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:11:37,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:11:37,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:11:37,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:11:36" (1/3) ... [2022-11-18 20:11:37,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbfee60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:11:37, skipping insertion in model container [2022-11-18 20:11:37,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:36" (2/3) ... [2022-11-18 20:11:37,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbfee60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:11:37, skipping insertion in model container [2022-11-18 20:11:37,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:11:37" (3/3) ... [2022-11-18 20:11:37,692 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2022-11-18 20:11:37,716 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:11:37,716 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2022-11-18 20:11:37,827 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:11:37,835 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;@2823dd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:11:37,835 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-18 20:11:37,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 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-18 20:11:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:11:37,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:37,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:11:37,860 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:11:37,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:37,866 INFO L85 PathProgramCache]: Analyzing trace with hash 895059861, now seen corresponding path program 1 times [2022-11-18 20:11:37,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:37,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920854991] [2022-11-18 20:11:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:37,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:38,170 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-18 20:11:38,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:38,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920854991] [2022-11-18 20:11:38,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920854991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:11:38,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:11:38,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:11:38,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621509859] [2022-11-18 20:11:38,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:11:38,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:11:38,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:38,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:11:38,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:11:38,226 INFO L87 Difference]: Start difference. First operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 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) 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-18 20:11:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:38,404 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-11-18 20:11:38,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:11:38,408 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-18 20:11:38,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:38,417 INFO L225 Difference]: With dead ends: 114 [2022-11-18 20:11:38,418 INFO L226 Difference]: Without dead ends: 111 [2022-11-18 20:11:38,419 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-18 20:11:38,423 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:38,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 179 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:11:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-18 20:11:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-18 20:11:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 106 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-18 20:11:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2022-11-18 20:11:38,472 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 6 [2022-11-18 20:11:38,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:38,473 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2022-11-18 20:11:38,473 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-18 20:11:38,473 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-11-18 20:11:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:11:38,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:38,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:11:38,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:11:38,475 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:11:38,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:38,476 INFO L85 PathProgramCache]: Analyzing trace with hash 895059862, now seen corresponding path program 1 times [2022-11-18 20:11:38,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:38,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038029707] [2022-11-18 20:11:38,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:38,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:38,613 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-18 20:11:38,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:38,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038029707] [2022-11-18 20:11:38,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038029707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:11:38,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:11:38,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:11:38,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090962232] [2022-11-18 20:11:38,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:11:38,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:11:38,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:38,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:11:38,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:11:38,617 INFO L87 Difference]: Start difference. First operand 111 states and 119 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-18 20:11:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:38,715 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-11-18 20:11:38,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:11:38,716 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-18 20:11:38,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:38,717 INFO L225 Difference]: With dead ends: 109 [2022-11-18 20:11:38,717 INFO L226 Difference]: Without dead ends: 109 [2022-11-18 20:11:38,718 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-18 20:11:38,719 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:38,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 181 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:11:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-18 20:11:38,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-18 20:11:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 59 states have (on average 1.88135593220339) internal successors, (111), 104 states have internal predecessors, (111), 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-18 20:11:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2022-11-18 20:11:38,735 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 6 [2022-11-18 20:11:38,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:38,735 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2022-11-18 20:11:38,736 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-18 20:11:38,736 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-11-18 20:11:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 20:11:38,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:38,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:38,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:11:38,737 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:11:38,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:38,738 INFO L85 PathProgramCache]: Analyzing trace with hash 100467671, now seen corresponding path program 1 times [2022-11-18 20:11:38,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:38,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904821701] [2022-11-18 20:11:38,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:38,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:38,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:11:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:38,979 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-18 20:11:38,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:38,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904821701] [2022-11-18 20:11:38,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904821701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:11:38,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:11:38,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:11:38,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274978113] [2022-11-18 20:11:38,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:11:38,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:11:38,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:38,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:11:38,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:11:38,984 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:11:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:39,188 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-18 20:11:39,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:11:39,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-18 20:11:39,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:39,196 INFO L225 Difference]: With dead ends: 116 [2022-11-18 20:11:39,197 INFO L226 Difference]: Without dead ends: 116 [2022-11-18 20:11:39,198 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-18 20:11:39,206 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 5 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:39,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 269 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:11:39,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-18 20:11:39,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2022-11-18 20:11:39,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 105 states have internal predecessors, (112), 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-18 20:11:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2022-11-18 20:11:39,234 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 13 [2022-11-18 20:11:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:39,234 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2022-11-18 20:11:39,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-18 20:11:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2022-11-18 20:11:39,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 20:11:39,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:39,236 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:39,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:11:39,237 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:11:39,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:39,238 INFO L85 PathProgramCache]: Analyzing trace with hash -900354020, now seen corresponding path program 1 times [2022-11-18 20:11:39,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:39,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763868600] [2022-11-18 20:11:39,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:39,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:39,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:11:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:39,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:11:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:11:39,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:39,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763868600] [2022-11-18 20:11:39,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763868600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:11:39,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:11:39,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:11:39,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350702522] [2022-11-18 20:11:39,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:11:39,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:11:39,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:39,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:11:39,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:11:39,591 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:11:39,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:39,985 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2022-11-18 20:11:39,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:11:39,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-18 20:11:39,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:39,989 INFO L225 Difference]: With dead ends: 110 [2022-11-18 20:11:39,989 INFO L226 Difference]: Without dead ends: 110 [2022-11-18 20:11:39,989 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-18 20:11:39,991 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 13 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:39,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 380 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:11:39,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-18 20:11:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-11-18 20:11:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 60 states have (on average 1.85) internal successors, (111), 104 states have internal predecessors, (111), 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-18 20:11:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2022-11-18 20:11:40,016 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 22 [2022-11-18 20:11:40,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:40,017 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2022-11-18 20:11:40,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-18 20:11:40,017 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2022-11-18 20:11:40,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 20:11:40,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:40,019 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:40,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:11:40,020 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:11:40,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:40,022 INFO L85 PathProgramCache]: Analyzing trace with hash -900354019, now seen corresponding path program 1 times [2022-11-18 20:11:40,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:40,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692027441] [2022-11-18 20:11:40,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:40,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:40,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:11:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:40,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:11:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:40,502 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:11:40,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:40,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692027441] [2022-11-18 20:11:40,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692027441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:11:40,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:11:40,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:11:40,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570600791] [2022-11-18 20:11:40,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:11:40,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:11:40,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:40,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:11:40,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:11:40,509 INFO L87 Difference]: Start difference. First operand 109 states and 117 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-18 20:11:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:40,873 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-11-18 20:11:40,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:11:40,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-11-18 20:11:40,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:40,876 INFO L225 Difference]: With dead ends: 109 [2022-11-18 20:11:40,877 INFO L226 Difference]: Without dead ends: 109 [2022-11-18 20:11:40,878 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-18 20:11:40,879 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:40,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 404 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:11:40,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-18 20:11:40,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2022-11-18 20:11:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 103 states have internal predecessors, (110), 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-18 20:11:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2022-11-18 20:11:40,893 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 22 [2022-11-18 20:11:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:40,894 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2022-11-18 20:11:40,894 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-18 20:11:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2022-11-18 20:11:40,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:11:40,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:40,905 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:40,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:11:40,906 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:11:40,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:40,907 INFO L85 PathProgramCache]: Analyzing trace with hash -375857467, now seen corresponding path program 1 times [2022-11-18 20:11:40,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:40,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751783902] [2022-11-18 20:11:40,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:40,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:41,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:11:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:41,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:11:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 20:11:41,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:41,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751783902] [2022-11-18 20:11:41,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751783902] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:11:41,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243497208] [2022-11-18 20:11:41,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:41,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:41,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:11:41,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:11:41,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:11:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:41,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 20:11:41,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:11:41,741 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-18 20:11:41,830 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2022-11-18 20:11:41,851 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2022-11-18 20:11:41,878 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:11:41,878 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-18 20:11:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-11-18 20:11:41,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:11:42,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:11:42,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243497208] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:11:42,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:11:42,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-11-18 20:11:42,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956523548] [2022-11-18 20:11:42,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:11:42,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 20:11:42,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:42,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:11:42,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2022-11-18 20:11:42,371 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 20:11:42,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:42,801 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2022-11-18 20:11:42,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:11:42,802 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-11-18 20:11:42,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:42,803 INFO L225 Difference]: With dead ends: 114 [2022-11-18 20:11:42,803 INFO L226 Difference]: Without dead ends: 114 [2022-11-18 20:11:42,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=304, Unknown=2, NotChecked=74, Total=462 [2022-11-18 20:11:42,805 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 31 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 351 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:42,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 600 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 373 Invalid, 0 Unknown, 351 Unchecked, 0.3s Time] [2022-11-18 20:11:42,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-18 20:11:42,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-18 20:11:42,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 108 states have internal predecessors, (115), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:11:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2022-11-18 20:11:42,813 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 25 [2022-11-18 20:11:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:42,814 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2022-11-18 20:11:42,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 20:11:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2022-11-18 20:11:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:11:42,815 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:42,815 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:42,833 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:11:43,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:43,022 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:11:43,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:43,023 INFO L85 PathProgramCache]: Analyzing trace with hash -375857466, now seen corresponding path program 1 times [2022-11-18 20:11:43,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:43,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209975352] [2022-11-18 20:11:43,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:43,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:43,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:11:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:43,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:11:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:43,804 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-18 20:11:43,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:43,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209975352] [2022-11-18 20:11:43,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209975352] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:11:43,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008158183] [2022-11-18 20:11:43,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:43,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:43,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:11:43,808 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:11:43,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:11:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:43,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-18 20:11:44,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:11:44,012 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-18 20:11:44,384 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:11:44,385 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-18 20:11:44,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-18 20:11:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:11:44,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:11:44,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008158183] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:11:44,753 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:11:44,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-11-18 20:11:44,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547166377] [2022-11-18 20:11:44,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:11:44,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:11:44,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:44,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:11:44,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-11-18 20:11:44,756 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 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-18 20:11:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:45,575 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-11-18 20:11:45,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:11:45,576 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-11-18 20:11:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:45,577 INFO L225 Difference]: With dead ends: 115 [2022-11-18 20:11:45,578 INFO L226 Difference]: Without dead ends: 115 [2022-11-18 20:11:45,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2022-11-18 20:11:45,579 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 209 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:45,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 590 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:11:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-18 20:11:45,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-11-18 20:11:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.7272727272727273) internal successors, (114), 107 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:11:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2022-11-18 20:11:45,585 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 25 [2022-11-18 20:11:45,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:45,586 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2022-11-18 20:11:45,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 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-18 20:11:45,586 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2022-11-18 20:11:45,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-18 20:11:45,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:45,587 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:45,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:11:45,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:45,789 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:11:45,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:45,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867041, now seen corresponding path program 1 times [2022-11-18 20:11:45,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:45,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732614500] [2022-11-18 20:11:45,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:45,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:46,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:11:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:46,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:11:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:46,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:11:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:46,440 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 20:11:46,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:46,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732614500] [2022-11-18 20:11:46,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732614500] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:11:46,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428202268] [2022-11-18 20:11:46,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:46,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:46,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:11:46,448 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:11:46,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:11:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:46,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-18 20:11:46,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:11:46,672 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-18 20:11:46,693 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-18 20:11:46,721 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-18 20:11:46,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:46,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:11:46,814 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_522))) is different from true [2022-11-18 20:11:46,833 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_522))) is different from true [2022-11-18 20:11:46,865 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:11:46,865 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-18 20:11:46,934 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-18 20:11:46,968 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:11:46,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:11:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2022-11-18 20:11:46,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:11:47,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428202268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:11:47,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:11:47,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2022-11-18 20:11:47,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695237331] [2022-11-18 20:11:47,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:11:47,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:11:47,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:47,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:11:47,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=272, Unknown=4, NotChecked=148, Total=506 [2022-11-18 20:11:47,444 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 20:11:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:48,045 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-11-18 20:11:48,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:11:48,045 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-11-18 20:11:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:48,046 INFO L225 Difference]: With dead ends: 127 [2022-11-18 20:11:48,047 INFO L226 Difference]: Without dead ends: 127 [2022-11-18 20:11:48,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=368, Unknown=4, NotChecked=172, Total=650 [2022-11-18 20:11:48,048 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 182 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 486 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:48,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 305 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 299 Invalid, 0 Unknown, 486 Unchecked, 0.4s Time] [2022-11-18 20:11:48,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-18 20:11:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2022-11-18 20:11:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 66 states have (on average 1.621212121212121) internal successors, (107), 100 states have internal predecessors, (107), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:11:48,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2022-11-18 20:11:48,055 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 37 [2022-11-18 20:11:48,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:48,055 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2022-11-18 20:11:48,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 20:11:48,056 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2022-11-18 20:11:48,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-18 20:11:48,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:48,057 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:48,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:11:48,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:48,265 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:11:48,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:48,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867040, now seen corresponding path program 1 times [2022-11-18 20:11:48,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:48,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710566597] [2022-11-18 20:11:48,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:48,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:48,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:11:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:48,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:11:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:49,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:11:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 20:11:49,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:49,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710566597] [2022-11-18 20:11:49,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710566597] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:11:49,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002357558] [2022-11-18 20:11:49,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:49,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:49,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:11:49,137 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:11:49,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:11:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:49,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-18 20:11:49,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:11:49,368 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-18 20:11:49,393 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-18 20:11:49,418 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_686 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_686) |c_#length|)))) is different from true [2022-11-18 20:11:49,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:49,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:11:49,531 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-18 20:11:49,543 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_687 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_687))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-18 20:11:49,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:49,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:11:49,680 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-18 20:11:49,691 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-18 20:11:49,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:49,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:11:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2022-11-18 20:11:49,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:11:49,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002357558] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:11:49,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:11:49,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-11-18 20:11:49,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654162801] [2022-11-18 20:11:49,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:11:49,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:11:49,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:49,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:11:49,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2022-11-18 20:11:49,983 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 20:11:50,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:50,471 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2022-11-18 20:11:50,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:11:50,471 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-11-18 20:11:50,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:50,472 INFO L225 Difference]: With dead ends: 116 [2022-11-18 20:11:50,472 INFO L226 Difference]: Without dead ends: 116 [2022-11-18 20:11:50,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=215, Unknown=3, NotChecked=96, Total=380 [2022-11-18 20:11:50,474 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 288 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 276 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:50,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 162 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 231 Invalid, 0 Unknown, 276 Unchecked, 0.4s Time] [2022-11-18 20:11:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-18 20:11:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-11-18 20:11:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.5) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:11:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-11-18 20:11:50,479 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 37 [2022-11-18 20:11:50,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:50,479 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-11-18 20:11:50,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-18 20:11:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-11-18 20:11:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 20:11:50,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:50,481 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:50,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:11:50,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:50,688 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:11:50,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash -94242400, now seen corresponding path program 1 times [2022-11-18 20:11:50,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:50,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904497699] [2022-11-18 20:11:50,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:50,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:50,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:11:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:50,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:11:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:50,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:11:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-18 20:11:50,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:50,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904497699] [2022-11-18 20:11:50,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904497699] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:11:50,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:11:50,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:11:50,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217921830] [2022-11-18 20:11:50,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:11:50,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:11:50,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:50,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:11:50,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:11:50,885 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:11:51,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:51,152 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2022-11-18 20:11:51,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:11:51,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-18 20:11:51,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:51,154 INFO L225 Difference]: With dead ends: 114 [2022-11-18 20:11:51,155 INFO L226 Difference]: Without dead ends: 114 [2022-11-18 20:11:51,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-18 20:11:51,156 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 69 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:51,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 266 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:11:51,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-18 20:11:51,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2022-11-18 20:11:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.4696969696969697) internal successors, (97), 90 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:11:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2022-11-18 20:11:51,162 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 39 [2022-11-18 20:11:51,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:51,162 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2022-11-18 20:11:51,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:11:51,163 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2022-11-18 20:11:51,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 20:11:51,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:51,164 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:51,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:11:51,165 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:11:51,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:51,166 INFO L85 PathProgramCache]: Analyzing trace with hash -94242399, now seen corresponding path program 1 times [2022-11-18 20:11:51,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:51,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983714438] [2022-11-18 20:11:51,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:51,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:51,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:11:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:51,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:11:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:51,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:11:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 20:11:51,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:51,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983714438] [2022-11-18 20:11:51,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983714438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:11:51,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:11:51,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 20:11:51,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732869726] [2022-11-18 20:11:51,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:11:51,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 20:11:51,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:51,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 20:11:51,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:11:51,538 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:11:51,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:51,746 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-11-18 20:11:51,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:11:51,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-11-18 20:11:51,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:51,747 INFO L225 Difference]: With dead ends: 94 [2022-11-18 20:11:51,748 INFO L226 Difference]: Without dead ends: 94 [2022-11-18 20:11:51,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:11:51,748 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 75 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:51,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 288 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:11:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-18 20:11:51,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-11-18 20:11:51,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 88 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:11:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2022-11-18 20:11:51,751 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 39 [2022-11-18 20:11:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:51,752 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2022-11-18 20:11:51,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-18 20:11:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-11-18 20:11:51,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 20:11:51,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:51,753 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:51,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:11:51,753 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:11:51,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash -372386587, now seen corresponding path program 1 times [2022-11-18 20:11:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:51,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735201595] [2022-11-18 20:11:51,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:51,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:52,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:11:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:52,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:11:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:52,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:11:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 20:11:52,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:52,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735201595] [2022-11-18 20:11:52,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735201595] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:11:52,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130216352] [2022-11-18 20:11:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:52,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:52,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:11:52,621 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:11:52,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:11:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:52,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-18 20:11:52,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:11:53,095 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 9 treesize of output 5 [2022-11-18 20:11:53,245 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1044 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1044))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-11-18 20:11:53,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:53,296 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 16 treesize of output 18 [2022-11-18 20:11:53,311 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-18 20:11:53,312 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 16 treesize of output 18 [2022-11-18 20:11:53,425 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-18 20:11:53,447 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-18 20:11:53,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:11:53,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130216352] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:11:53,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:11:53,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-11-18 20:11:53,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918210728] [2022-11-18 20:11:53,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:11:53,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 20:11:53,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:53,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:11:53,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2022-11-18 20:11:53,451 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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-18 20:11:53,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:53,913 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2022-11-18 20:11:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:11:53,914 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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-18 20:11:53,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:53,915 INFO L225 Difference]: With dead ends: 137 [2022-11-18 20:11:53,915 INFO L226 Difference]: Without dead ends: 137 [2022-11-18 20:11:53,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=703, Unknown=2, NotChecked=54, Total=870 [2022-11-18 20:11:53,916 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 67 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:53,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 730 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 505 Invalid, 0 Unknown, 286 Unchecked, 0.4s Time] [2022-11-18 20:11:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-18 20:11:53,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 93. [2022-11-18 20:11:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 87 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:11:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-11-18 20:11:53,921 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 41 [2022-11-18 20:11:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:53,922 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-11-18 20:11:53,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 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-18 20:11:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-11-18 20:11:53,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 20:11:53,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:53,927 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:53,938 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:11:54,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:11:54,128 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:11:54,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:54,128 INFO L85 PathProgramCache]: Analyzing trace with hash -372386586, now seen corresponding path program 1 times [2022-11-18 20:11:54,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:54,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762037636] [2022-11-18 20:11:54,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:54,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:54,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:11:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:54,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:11:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:54,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:11:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:55,386 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:11:55,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:55,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762037636] [2022-11-18 20:11:55,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762037636] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:11:55,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298862313] [2022-11-18 20:11:55,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:55,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:55,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:11:55,389 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:11:55,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:11:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:55,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-18 20:11:55,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:11:56,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-18 20:11:56,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:11:56,488 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1203 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1203))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1199 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1199) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1202 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1202))))) is different from true [2022-11-18 20:11:56,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:56,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-18 20:11:56,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:56,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 20:11:56,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:56,569 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 14 treesize of output 16 [2022-11-18 20:11:56,582 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:11:56,583 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 15 treesize of output 15 [2022-11-18 20:11:56,671 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-18 20:11:56,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:11:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-18 20:11:56,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:11:57,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298862313] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:11:57,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:11:57,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2022-11-18 20:11:57,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924408756] [2022-11-18 20:11:57,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:11:57,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-18 20:11:57,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:57,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-18 20:11:57,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1222, Unknown=2, NotChecked=70, Total=1406 [2022-11-18 20:11:57,179 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:11:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:58,875 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2022-11-18 20:11:58,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 20:11:58,878 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-11-18 20:11:58,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:58,879 INFO L225 Difference]: With dead ends: 146 [2022-11-18 20:11:58,879 INFO L226 Difference]: Without dead ends: 146 [2022-11-18 20:11:58,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=232, Invalid=2217, Unknown=5, NotChecked=96, Total=2550 [2022-11-18 20:11:58,881 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 127 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:58,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1332 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 670 Invalid, 0 Unknown, 271 Unchecked, 0.7s Time] [2022-11-18 20:11:58,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-18 20:11:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 97. [2022-11-18 20:11:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 91 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:11:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-11-18 20:11:58,886 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 41 [2022-11-18 20:11:58,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:58,886 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-11-18 20:11:58,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:11:58,887 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-11-18 20:11:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-18 20:11:58,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:58,888 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:58,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:11:59,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:11:59,100 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:11:59,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:59,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1333284459, now seen corresponding path program 1 times [2022-11-18 20:11:59,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:59,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537495677] [2022-11-18 20:11:59,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:59,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:59,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:11:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:59,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:11:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:59,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:11:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-18 20:11:59,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:59,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537495677] [2022-11-18 20:11:59,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537495677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:11:59,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:11:59,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:11:59,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742788954] [2022-11-18 20:11:59,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:11:59,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:11:59,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:59,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:11:59,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:11:59,240 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:11:59,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:11:59,347 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-11-18 20:11:59,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:11:59,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2022-11-18 20:11:59,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:11:59,349 INFO L225 Difference]: With dead ends: 114 [2022-11-18 20:11:59,349 INFO L226 Difference]: Without dead ends: 114 [2022-11-18 20:11:59,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:11:59,351 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 85 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:11:59,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 177 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:11:59,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-18 20:11:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2022-11-18 20:11:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.380281690140845) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:11:59,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-11-18 20:11:59,355 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 42 [2022-11-18 20:11:59,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:11:59,355 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-11-18 20:11:59,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-18 20:11:59,355 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-11-18 20:11:59,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-18 20:11:59,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:11:59,356 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:11:59,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:11:59,357 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:11:59,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112687, now seen corresponding path program 1 times [2022-11-18 20:11:59,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:59,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103756778] [2022-11-18 20:11:59,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:59,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:59,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:11:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:59,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:11:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:59,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:11:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-18 20:11:59,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:59,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103756778] [2022-11-18 20:11:59,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103756778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:11:59,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:11:59,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:11:59,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774878494] [2022-11-18 20:11:59,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:11:59,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:11:59,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:59,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:11:59,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:11:59,705 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 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-18 20:12:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:12:00,079 INFO L93 Difference]: Finished difference Result 159 states and 170 transitions. [2022-11-18 20:12:00,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:12:00,082 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 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 44 [2022-11-18 20:12:00,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:12:00,083 INFO L225 Difference]: With dead ends: 159 [2022-11-18 20:12:00,084 INFO L226 Difference]: Without dead ends: 159 [2022-11-18 20:12:00,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-11-18 20:12:00,085 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 186 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:12:00,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 418 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:12:00,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-18 20:12:00,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 99. [2022-11-18 20:12:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.36) internal successors, (102), 93 states have internal predecessors, (102), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:12:00,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-11-18 20:12:00,089 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 44 [2022-11-18 20:12:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:12:00,090 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-11-18 20:12:00,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 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-18 20:12:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-11-18 20:12:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-18 20:12:00,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:12:00,091 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:12:00,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:12:00,092 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:12:00,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:00,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112688, now seen corresponding path program 1 times [2022-11-18 20:12:00,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:00,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996600354] [2022-11-18 20:12:00,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:00,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:00,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:12:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:00,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:12:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:00,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:12:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 20:12:00,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:00,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996600354] [2022-11-18 20:12:00,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996600354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:12:00,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:12:00,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-18 20:12:00,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597201296] [2022-11-18 20:12:00,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:12:00,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-18 20:12:00,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:00,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-18 20:12:00,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-18 20:12:00,721 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 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-18 20:12:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:12:01,067 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2022-11-18 20:12:01,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:12:01,068 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 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 44 [2022-11-18 20:12:01,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:12:01,069 INFO L225 Difference]: With dead ends: 141 [2022-11-18 20:12:01,069 INFO L226 Difference]: Without dead ends: 141 [2022-11-18 20:12:01,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:12:01,069 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 279 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:12:01,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 400 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:12:01,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-18 20:12:01,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 101. [2022-11-18 20:12:01,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 95 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:12:01,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-11-18 20:12:01,073 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 44 [2022-11-18 20:12:01,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:12:01,074 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-11-18 20:12:01,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 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-18 20:12:01,074 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-11-18 20:12:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-18 20:12:01,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:12:01,076 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:12:01,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:12:01,079 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:12:01,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:01,079 INFO L85 PathProgramCache]: Analyzing trace with hash 614432594, now seen corresponding path program 1 times [2022-11-18 20:12:01,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:01,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844618777] [2022-11-18 20:12:01,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:01,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:01,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:12:01,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:01,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:12:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:01,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:12:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:12:01,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:01,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844618777] [2022-11-18 20:12:01,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844618777] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:01,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747093641] [2022-11-18 20:12:01,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:01,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:01,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:01,660 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:01,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:12:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:01,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-18 20:12:01,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:02,213 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-18 20:12:02,295 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1724 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1724) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:12:02,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:02,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-18 20:12:02,377 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-18 20:12:02,404 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-18 20:12:02,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:02,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747093641] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:02,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:12:02,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-18 20:12:02,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302425488] [2022-11-18 20:12:02,568 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:02,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-18 20:12:02,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:02,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-18 20:12:02,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=611, Unknown=8, NotChecked=50, Total=756 [2022-11-18 20:12:02,570 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:12:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:12:03,556 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-11-18 20:12:03,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:12:03,556 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-11-18 20:12:03,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:12:03,561 INFO L225 Difference]: With dead ends: 97 [2022-11-18 20:12:03,561 INFO L226 Difference]: Without dead ends: 97 [2022-11-18 20:12:03,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=1010, Unknown=8, NotChecked=66, Total=1260 [2022-11-18 20:12:03,564 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 251 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 87 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:12:03,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 634 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 535 Invalid, 0 Unknown, 87 Unchecked, 0.5s Time] [2022-11-18 20:12:03,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-18 20:12:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2022-11-18 20:12:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 87 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:12:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2022-11-18 20:12:03,574 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 46 [2022-11-18 20:12:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:12:03,575 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2022-11-18 20:12:03,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:12:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2022-11-18 20:12:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-18 20:12:03,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:12:03,576 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:12:03,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:12:03,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-18 20:12:03,784 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:12:03,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:03,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450120, now seen corresponding path program 1 times [2022-11-18 20:12:03,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:03,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911242311] [2022-11-18 20:12:03,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:03,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:04,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:12:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:04,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:12:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:05,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:12:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:12:05,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:05,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911242311] [2022-11-18 20:12:05,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911242311] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:05,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917389089] [2022-11-18 20:12:05,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:05,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:05,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:05,704 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:05,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:12:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:06,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-18 20:12:06,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:06,080 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-18 20:12:06,461 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:12:06,462 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-18 20:12:06,638 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-18 20:12:06,858 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:12:06,858 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-18 20:12:07,136 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:12:07,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2022-11-18 20:12:07,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:12:07,385 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1892 (Array Int Int)) (v_ArrVal_1891 (Array Int Int))) (and (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1892) |c_#memory_$Pointer$.base|) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1891)))) is different from true [2022-11-18 20:12:07,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:07,465 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:12:07,468 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 2 case distinctions, treesize of input 45 treesize of output 43 [2022-11-18 20:12:07,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:07,477 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 14 treesize of output 16 [2022-11-18 20:12:07,516 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-18 20:12:07,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2022-11-18 20:12:07,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:12:07,876 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:12:07,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2022-11-18 20:12:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-18 20:12:08,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:08,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917389089] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:08,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:12:08,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2022-11-18 20:12:08,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932811188] [2022-11-18 20:12:08,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:08,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-18 20:12:08,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:08,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-18 20:12:08,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1918, Unknown=1, NotChecked=88, Total=2162 [2022-11-18 20:12:08,275 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:12:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:12:09,659 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2022-11-18 20:12:09,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:12:09,660 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-11-18 20:12:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:12:09,661 INFO L225 Difference]: With dead ends: 115 [2022-11-18 20:12:09,661 INFO L226 Difference]: Without dead ends: 115 [2022-11-18 20:12:09,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=260, Invalid=2823, Unknown=1, NotChecked=108, Total=3192 [2022-11-18 20:12:09,663 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 46 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:12:09,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 931 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 745 Invalid, 0 Unknown, 204 Unchecked, 0.7s Time] [2022-11-18 20:12:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-18 20:12:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-11-18 20:12:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 105 states have internal predecessors, (115), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-18 20:12:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2022-11-18 20:12:09,668 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 46 [2022-11-18 20:12:09,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:12:09,669 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2022-11-18 20:12:09,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:12:09,669 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-11-18 20:12:09,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-18 20:12:09,670 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:12:09,670 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:12:09,684 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-18 20:12:09,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 20:12:09,878 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:12:09,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:09,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450121, now seen corresponding path program 1 times [2022-11-18 20:12:09,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:09,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653083157] [2022-11-18 20:12:09,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:09,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:11,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:12:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:11,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:12:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:11,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:12:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:12:12,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:12,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653083157] [2022-11-18 20:12:12,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653083157] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:12,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355364068] [2022-11-18 20:12:12,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:12,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:12,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:12,532 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:12,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:12:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:12,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 119 conjunts are in the unsatisfiable core [2022-11-18 20:12:12,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:12,867 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-18 20:12:13,459 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:12:13,460 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-18 20:12:13,673 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-18 20:12:13,680 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-18 20:12:13,972 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:12:13,973 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 44 [2022-11-18 20:12:14,000 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-18 20:12:14,417 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:12:14,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 34 [2022-11-18 20:12:14,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:12:14,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:12:14,449 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 15 treesize of output 7 [2022-11-18 20:12:14,703 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2070 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_2069 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2069)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2070) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 20:12:14,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:14,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:14,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:14,769 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 25 treesize of output 30 [2022-11-18 20:12:14,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:14,791 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:12:14,791 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 2 case distinctions, treesize of input 69 treesize of output 59 [2022-11-18 20:12:14,846 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-18 20:12:14,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 20:12:14,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2022-11-18 20:12:15,334 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-18 20:12:15,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 41 [2022-11-18 20:12:15,349 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 20:12:15,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-18 20:12:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-18 20:12:15,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:16,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355364068] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:16,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:12:16,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26] total 52 [2022-11-18 20:12:16,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295564663] [2022-11-18 20:12:16,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:16,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-18 20:12:16,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:16,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-18 20:12:16,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=3229, Unknown=1, NotChecked=114, Total=3540 [2022-11-18 20:12:16,286 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 53 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 46 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:12:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:12:20,146 INFO L93 Difference]: Finished difference Result 220 states and 240 transitions. [2022-11-18 20:12:20,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-18 20:12:20,147 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 46 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-11-18 20:12:20,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:12:20,148 INFO L225 Difference]: With dead ends: 220 [2022-11-18 20:12:20,148 INFO L226 Difference]: Without dead ends: 220 [2022-11-18 20:12:20,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=416, Invalid=5593, Unknown=1, NotChecked=152, Total=6162 [2022-11-18 20:12:20,150 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 201 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:12:20,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1952 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1657 Invalid, 0 Unknown, 321 Unchecked, 1.5s Time] [2022-11-18 20:12:20,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-18 20:12:20,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 112. [2022-11-18 20:12:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.313953488372093) internal successors, (113), 104 states have internal predecessors, (113), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-18 20:12:20,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2022-11-18 20:12:20,155 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 46 [2022-11-18 20:12:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:12:20,156 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2022-11-18 20:12:20,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 46 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:12:20,156 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-11-18 20:12:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 20:12:20,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:12:20,157 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:12:20,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-18 20:12:20,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:20,363 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:12:20,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:20,364 INFO L85 PathProgramCache]: Analyzing trace with hash 865523061, now seen corresponding path program 1 times [2022-11-18 20:12:20,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:20,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348792579] [2022-11-18 20:12:20,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:20,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:21,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:12:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:21,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:12:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:21,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:12:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:12:21,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:21,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348792579] [2022-11-18 20:12:21,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348792579] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:21,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249200236] [2022-11-18 20:12:21,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:21,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:21,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:21,832 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:21,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:12:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:22,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-18 20:12:22,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:22,185 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-18 20:12:22,239 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-18 20:12:22,280 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-18 20:12:22,314 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:12:22,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:12:22,384 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-18 20:12:22,466 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:12:22,466 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-18 20:12:22,822 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 18 treesize of output 10 [2022-11-18 20:12:23,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:23,216 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 24 treesize of output 24 [2022-11-18 20:12:23,239 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-18 20:12:23,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-11-18 20:12:23,685 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:12:23,686 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-18 20:12:23,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:23,791 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 30 [2022-11-18 20:12:23,864 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-18 20:12:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-18 20:12:23,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:23,887 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2266) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-18 20:12:25,907 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_2265) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2266) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-18 20:12:27,933 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base| v_ArrVal_2265) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2266) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-11-18 20:12:30,338 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2273 Int) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| Int) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2272 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_2273) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_2272))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) v_ArrVal_2265)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_21| v_ArrVal_2266) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1))) is different from false [2022-11-18 20:12:30,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249200236] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:30,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:12:30,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 44 [2022-11-18 20:12:30,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617997157] [2022-11-18 20:12:30,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:30,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-18 20:12:30,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:30,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-18 20:12:30,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1896, Unknown=53, NotChecked=460, Total=2550 [2022-11-18 20:12:30,344 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 45 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:12:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:12:35,512 INFO L93 Difference]: Finished difference Result 320 states and 348 transitions. [2022-11-18 20:12:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-18 20:12:35,512 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-18 20:12:35,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:12:35,515 INFO L225 Difference]: With dead ends: 320 [2022-11-18 20:12:35,515 INFO L226 Difference]: Without dead ends: 320 [2022-11-18 20:12:35,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=409, Invalid=4954, Unknown=59, NotChecked=740, Total=6162 [2022-11-18 20:12:35,517 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 574 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 309 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:12:35,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 1394 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1447 Invalid, 0 Unknown, 309 Unchecked, 1.2s Time] [2022-11-18 20:12:35,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-11-18 20:12:35,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 147. [2022-11-18 20:12:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 119 states have (on average 1.3025210084033614) internal successors, (155), 137 states have internal predecessors, (155), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 20:12:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2022-11-18 20:12:35,525 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 51 [2022-11-18 20:12:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:12:35,525 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2022-11-18 20:12:35,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 38 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:12:35,526 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2022-11-18 20:12:35,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 20:12:35,527 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:12:35,527 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:12:35,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:12:35,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:35,734 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:12:35,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:35,734 INFO L85 PathProgramCache]: Analyzing trace with hash 865523062, now seen corresponding path program 1 times [2022-11-18 20:12:35,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:35,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329899212] [2022-11-18 20:12:35,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:35,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:36,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:12:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:36,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:12:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:37,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:12:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:12:37,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:37,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329899212] [2022-11-18 20:12:37,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329899212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:37,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600868394] [2022-11-18 20:12:37,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:37,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:37,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:37,558 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:37,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:12:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:37,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-18 20:12:37,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:37,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-18 20:12:37,900 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-18 20:12:37,939 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-11-18 20:12:37,968 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:12:37,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:12:38,042 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-18 20:12:38,212 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:12:38,212 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-18 20:12:38,773 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 33 treesize of output 21 [2022-11-18 20:12:38,779 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 19 treesize of output 11 [2022-11-18 20:12:39,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:39,164 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 41 treesize of output 32 [2022-11-18 20:12:39,175 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:12:39,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-18 20:12:39,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-11-18 20:12:39,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:39,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2022-11-18 20:12:39,809 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:12:39,810 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 52 treesize of output 49 [2022-11-18 20:12:39,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-18 20:12:39,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:39,947 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 38 treesize of output 36 [2022-11-18 20:12:39,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:39,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-11-18 20:12:40,075 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 31 treesize of output 19 [2022-11-18 20:12:40,079 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 26 treesize of output 14 [2022-11-18 20:12:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-18 20:12:40,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:40,483 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2461 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2461) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2462 (Array Int Int)) (v_ArrVal_2461 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2461) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2462) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-18 20:12:41,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600868394] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:41,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:12:41,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2022-11-18 20:12:41,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927724449] [2022-11-18 20:12:41,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:41,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-18 20:12:41,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:41,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-18 20:12:41,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2533, Unknown=44, NotChecked=206, Total=2970 [2022-11-18 20:12:41,980 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:12:44,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:12:44,988 INFO L93 Difference]: Finished difference Result 260 states and 286 transitions. [2022-11-18 20:12:44,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-18 20:12:44,989 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-18 20:12:44,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:12:44,991 INFO L225 Difference]: With dead ends: 260 [2022-11-18 20:12:44,991 INFO L226 Difference]: Without dead ends: 260 [2022-11-18 20:12:44,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=413, Invalid=4807, Unknown=44, NotChecked=286, Total=5550 [2022-11-18 20:12:44,994 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 581 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:12:44,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1172 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1218 Invalid, 0 Unknown, 114 Unchecked, 1.1s Time] [2022-11-18 20:12:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-18 20:12:45,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 164. [2022-11-18 20:12:45,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 136 states have (on average 1.2794117647058822) internal successors, (174), 154 states have internal predecessors, (174), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 20:12:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 188 transitions. [2022-11-18 20:12:45,002 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 188 transitions. Word has length 51 [2022-11-18 20:12:45,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:12:45,002 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 188 transitions. [2022-11-18 20:12:45,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:12:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 188 transitions. [2022-11-18 20:12:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 20:12:45,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:12:45,004 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:12:45,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:12:45,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:45,211 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:12:45,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:45,212 INFO L85 PathProgramCache]: Analyzing trace with hash -396596539, now seen corresponding path program 2 times [2022-11-18 20:12:45,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:45,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059658508] [2022-11-18 20:12:45,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:45,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:46,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:12:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:46,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:12:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:46,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:12:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:12:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:12:47,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:12:47,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059658508] [2022-11-18 20:12:47,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059658508] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:47,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531140291] [2022-11-18 20:12:47,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:12:47,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:12:47,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:12:47,618 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:12:47,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 20:12:47,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:12:47,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:12:47,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 136 conjunts are in the unsatisfiable core [2022-11-18 20:12:48,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:12:48,046 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-18 20:12:48,488 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:12:48,488 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-18 20:12:48,670 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-18 20:12:48,677 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-18 20:12:48,904 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 20:12:48,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2022-11-18 20:12:48,917 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-18 20:12:51,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:51,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:51,715 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 20:12:51,716 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 33 treesize of output 39 [2022-11-18 20:12:51,771 INFO L321 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2022-11-18 20:12:51,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 70 [2022-11-18 20:12:51,799 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-18 20:12:51,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 20:12:53,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:53,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:12:53,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:53,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:12:53,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:12:53,643 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 20:12:53,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 30 [2022-11-18 20:12:54,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:12:54,287 INFO L321 Elim1Store]: treesize reduction 142, result has 13.4 percent of original size [2022-11-18 20:12:54,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 94 treesize of output 60 [2022-11-18 20:12:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:12:54,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:12:54,925 INFO L321 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-11-18 20:12:54,925 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 24 treesize of output 23 [2022-11-18 20:12:55,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531140291] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:12:55,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:12:55,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 58 [2022-11-18 20:12:55,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301397099] [2022-11-18 20:12:55,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:12:55,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-11-18 20:12:55,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:12:55,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-11-18 20:12:55,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=4458, Unknown=6, NotChecked=0, Total=4692 [2022-11-18 20:12:55,957 INFO L87 Difference]: Start difference. First operand 164 states and 188 transitions. Second operand has 58 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 51 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:13:00,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:00,564 INFO L93 Difference]: Finished difference Result 158 states and 176 transitions. [2022-11-18 20:13:00,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-18 20:13:00,568 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 51 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2022-11-18 20:13:00,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:00,569 INFO L225 Difference]: With dead ends: 158 [2022-11-18 20:13:00,569 INFO L226 Difference]: Without dead ends: 158 [2022-11-18 20:13:00,571 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2301 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=478, Invalid=8257, Unknown=7, NotChecked=0, Total=8742 [2022-11-18 20:13:00,572 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 41 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1983 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 275 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:00,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1983 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 995 Invalid, 0 Unknown, 275 Unchecked, 0.9s Time] [2022-11-18 20:13:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-18 20:13:00,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2022-11-18 20:13:00,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 129 states have (on average 1.248062015503876) internal successors, (161), 147 states have internal predecessors, (161), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 20:13:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 175 transitions. [2022-11-18 20:13:00,578 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 175 transitions. Word has length 51 [2022-11-18 20:13:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:00,579 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 175 transitions. [2022-11-18 20:13:00,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 51 states have internal predecessors, (89), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:13:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2022-11-18 20:13:00,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-18 20:13:00,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:00,580 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:13:00,599 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:00,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-18 20:13:00,787 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:13:00,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:00,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1455991656, now seen corresponding path program 1 times [2022-11-18 20:13:00,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:00,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337145861] [2022-11-18 20:13:00,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:00,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:01,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:13:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:01,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:13:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:01,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:13:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:13:02,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:02,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337145861] [2022-11-18 20:13:02,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337145861] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:02,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784650992] [2022-11-18 20:13:02,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:02,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:02,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:02,470 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:02,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 20:13:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:02,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 99 conjunts are in the unsatisfiable core [2022-11-18 20:13:02,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:02,870 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-18 20:13:03,183 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:13:03,184 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-18 20:13:03,344 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-18 20:13:03,570 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:13:03,570 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 19 treesize of output 22 [2022-11-18 20:13:03,851 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:13:03,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2022-11-18 20:13:03,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:13:03,864 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-18 20:13:04,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:04,206 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-18 20:13:04,206 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 2 case distinctions, treesize of input 43 treesize of output 38 [2022-11-18 20:13:04,227 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:13:04,228 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 15 treesize of output 15 [2022-11-18 20:13:04,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:04,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-18 20:13:04,856 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-18 20:13:04,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 29 [2022-11-18 20:13:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:13:04,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:05,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784650992] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:05,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:13:05,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2022-11-18 20:13:05,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406103772] [2022-11-18 20:13:05,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:05,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-18 20:13:05,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:05,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-18 20:13:05,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2581, Unknown=0, NotChecked=0, Total=2756 [2022-11-18 20:13:05,488 INFO L87 Difference]: Start difference. First operand 157 states and 175 transitions. Second operand has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:13:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:08,796 INFO L93 Difference]: Finished difference Result 157 states and 174 transitions. [2022-11-18 20:13:08,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:13:08,797 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-11-18 20:13:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:08,799 INFO L225 Difference]: With dead ends: 157 [2022-11-18 20:13:08,799 INFO L226 Difference]: Without dead ends: 157 [2022-11-18 20:13:08,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1246 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=339, Invalid=4217, Unknown=0, NotChecked=0, Total=4556 [2022-11-18 20:13:08,801 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 136 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:08,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1587 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1722 Invalid, 0 Unknown, 58 Unchecked, 1.7s Time] [2022-11-18 20:13:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-18 20:13:08,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-11-18 20:13:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 129 states have (on average 1.2403100775193798) internal successors, (160), 147 states have internal predecessors, (160), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 20:13:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 174 transitions. [2022-11-18 20:13:08,807 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 174 transitions. Word has length 53 [2022-11-18 20:13:08,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:08,808 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 174 transitions. [2022-11-18 20:13:08,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:13:08,808 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 174 transitions. [2022-11-18 20:13:08,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 20:13:08,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:08,809 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-18 20:13:08,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:09,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-18 20:13:09,017 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:13:09,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:09,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1874385561, now seen corresponding path program 1 times [2022-11-18 20:13:09,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:09,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712092806] [2022-11-18 20:13:09,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:09,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:10,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:13:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:10,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:13:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:10,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:13:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:11,609 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:13:11,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:11,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712092806] [2022-11-18 20:13:11,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712092806] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:11,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034462309] [2022-11-18 20:13:11,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:11,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:11,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:11,612 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:11,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-18 20:13:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:12,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 110 conjunts are in the unsatisfiable core [2022-11-18 20:13:12,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:12,055 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-18 20:13:12,125 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-18 20:13:12,175 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3032 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3032) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-11-18 20:13:12,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:12,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:13:12,255 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-18 20:13:12,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:12,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:13:13,192 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 26 treesize of output 14 [2022-11-18 20:13:13,199 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-18 20:13:13,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:13,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:13:13,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:13:13,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:13,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-18 20:13:13,854 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:13:13,855 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 15 treesize of output 15 [2022-11-18 20:13:13,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:13,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:13,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-18 20:13:13,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:13,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:13:15,208 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2022-11-18 20:13:15,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 57 [2022-11-18 20:13:15,253 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-18 20:13:15,254 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 38 treesize of output 33 [2022-11-18 20:13:15,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:16,001 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 20:13:16,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 101 [2022-11-18 20:13:16,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:16,050 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 20:13:16,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 110 [2022-11-18 20:13:16,181 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-18 20:13:16,391 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-18 20:13:17,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:13:17,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-18 20:13:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-18 20:13:17,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:31,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034462309] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:31,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:13:31,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 52 [2022-11-18 20:13:31,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193810672] [2022-11-18 20:13:31,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:31,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-18 20:13:31,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:31,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-18 20:13:31,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=3551, Unknown=49, NotChecked=122, Total=4032 [2022-11-18 20:13:31,105 INFO L87 Difference]: Start difference. First operand 157 states and 174 transitions. Second operand has 53 states, 50 states have (on average 1.98) internal successors, (99), 46 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:13:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:34,117 INFO L93 Difference]: Finished difference Result 165 states and 187 transitions. [2022-11-18 20:13:34,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-18 20:13:34,117 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.98) internal successors, (99), 46 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2022-11-18 20:13:34,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:34,118 INFO L225 Difference]: With dead ends: 165 [2022-11-18 20:13:34,118 INFO L226 Difference]: Without dead ends: 165 [2022-11-18 20:13:34,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2068 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=516, Invalid=5444, Unknown=50, NotChecked=152, Total=6162 [2022-11-18 20:13:34,119 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 92 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 295 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:34,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1164 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 753 Invalid, 0 Unknown, 295 Unchecked, 0.8s Time] [2022-11-18 20:13:34,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-18 20:13:34,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2022-11-18 20:13:34,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 130 states have (on average 1.2384615384615385) internal successors, (161), 148 states have internal predecessors, (161), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-18 20:13:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2022-11-18 20:13:34,126 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 56 [2022-11-18 20:13:34,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:34,126 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2022-11-18 20:13:34,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.98) internal successors, (99), 46 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:13:34,127 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2022-11-18 20:13:34,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:13:34,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:34,128 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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-18 20:13:34,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-18 20:13:34,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-18 20:13:34,335 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:13:34,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:34,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1773529958, now seen corresponding path program 3 times [2022-11-18 20:13:34,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:34,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562311133] [2022-11-18 20:13:34,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:34,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:34,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:13:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:34,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:13:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:34,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 20:13:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:34,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 20:13:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-11-18 20:13:34,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:34,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562311133] [2022-11-18 20:13:34,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562311133] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:34,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083748801] [2022-11-18 20:13:34,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:13:34,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:34,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:34,516 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:34,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-18 20:13:35,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-18 20:13:35,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:13:35,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:13:35,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-18 20:13:35,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:13:35,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083748801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:35,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:13:35,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-18 20:13:35,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357207608] [2022-11-18 20:13:35,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:35,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:13:35,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:35,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:13:35,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:13:35,102 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 20:13:35,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:35,120 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-11-18 20:13:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:13:35,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2022-11-18 20:13:35,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:35,132 INFO L225 Difference]: With dead ends: 88 [2022-11-18 20:13:35,132 INFO L226 Difference]: Without dead ends: 88 [2022-11-18 20:13:35,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 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-18 20:13:35,133 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 64 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 103 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-18 20:13:35,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 103 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:13:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-18 20:13:35,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-11-18 20:13:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 82 states have internal predecessors, (86), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:13:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-11-18 20:13:35,139 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 58 [2022-11-18 20:13:35,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:35,140 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-11-18 20:13:35,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-18 20:13:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-11-18 20:13:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:13:35,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:35,141 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-18 20:13:35,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:35,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-18 20:13:35,351 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:13:35,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:35,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1693228282, now seen corresponding path program 1 times [2022-11-18 20:13:35,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:35,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168787356] [2022-11-18 20:13:35,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:35,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:36,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:13:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:36,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:13:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:36,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:13:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:13:36,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:36,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168787356] [2022-11-18 20:13:36,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168787356] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:36,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907112356] [2022-11-18 20:13:36,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:36,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:36,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:36,658 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:36,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-18 20:13:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:37,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-18 20:13:37,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:37,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:13:37,342 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3442 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_3442) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 20:13:37,349 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3443 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_3443)))) is different from true [2022-11-18 20:13:37,357 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3443 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_3443) |c_#memory_$Pointer$.offset|))) is different from true [2022-11-18 20:13:37,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:37,371 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 14 treesize of output 16 [2022-11-18 20:13:37,537 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-18 20:13:37,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2022-11-18 20:13:37,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:37,671 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-18 20:13:37,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2022-11-18 20:13:37,694 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-18 20:13:37,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:13:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 20:13:37,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:13:37,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907112356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:13:37,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:13:37,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [22] total 38 [2022-11-18 20:13:37,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464227600] [2022-11-18 20:13:37,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:13:37,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 20:13:37,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:37,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:13:37,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1149, Unknown=3, NotChecked=210, Total=1482 [2022-11-18 20:13:37,885 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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-18 20:13:38,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:13:38,378 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-11-18 20:13:38,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:13:38,378 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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 58 [2022-11-18 20:13:38,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:13:38,379 INFO L225 Difference]: With dead ends: 93 [2022-11-18 20:13:38,379 INFO L226 Difference]: Without dead ends: 93 [2022-11-18 20:13:38,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=156, Invalid=1575, Unknown=3, NotChecked=246, Total=1980 [2022-11-18 20:13:38,380 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 284 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:13:38,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 553 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 294 Invalid, 0 Unknown, 284 Unchecked, 0.3s Time] [2022-11-18 20:13:38,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-18 20:13:38,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2022-11-18 20:13:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:13:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2022-11-18 20:13:38,390 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 58 [2022-11-18 20:13:38,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:13:38,391 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2022-11-18 20:13:38,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 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-18 20:13:38,392 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2022-11-18 20:13:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:13:38,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:13:38,392 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-18 20:13:38,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-18 20:13:38,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:38,593 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:13:38,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:13:38,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1693228283, now seen corresponding path program 1 times [2022-11-18 20:13:38,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:13:38,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246764547] [2022-11-18 20:13:38,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:38,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:13:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:41,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:13:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:42,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:13:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:42,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:13:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:13:43,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:13:43,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246764547] [2022-11-18 20:13:43,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246764547] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:43,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261222036] [2022-11-18 20:13:43,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:13:43,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:13:43,929 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:13:43,930 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:13:43,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-18 20:13:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:13:44,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 143 conjunts are in the unsatisfiable core [2022-11-18 20:13:44,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:13:44,297 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-18 20:13:44,407 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-18 20:13:44,692 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:13:44,693 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-18 20:13:44,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:13:44,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:13:45,223 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-18 20:13:45,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 20:13:45,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:13:45,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:45,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 20:13:45,990 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:13:45,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-11-18 20:13:45,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 20:13:46,586 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:13:46,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 28 [2022-11-18 20:13:46,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:13:47,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:47,288 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-18 20:13:47,288 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 2 case distinctions, treesize of input 57 treesize of output 46 [2022-11-18 20:13:47,306 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:13:47,306 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 15 treesize of output 15 [2022-11-18 20:13:47,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2022-11-18 20:13:47,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:47,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-18 20:13:48,951 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-18 20:13:48,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 83 [2022-11-18 20:13:48,976 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:13:48,977 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 44 treesize of output 45 [2022-11-18 20:13:48,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:48,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-18 20:13:49,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:49,231 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:13:49,231 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 2 case distinctions, treesize of input 54 treesize of output 50 [2022-11-18 20:13:49,240 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-18 20:13:49,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:13:49,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:13:49,468 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:13:49,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2022-11-18 20:13:49,474 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-18 20:13:49,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:13:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:13:49,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:13:50,261 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3644 (Array Int Int)) (v_ArrVal_3645 (Array Int Int)) (v_ArrVal_3646 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3646) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3644) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-18 20:13:50,278 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3641 (Array Int Int)) (v_ArrVal_3642 (Array Int Int)) (v_ArrVal_3643 (Array Int Int)) (v_ArrVal_3644 (Array Int Int)) (v_ArrVal_3645 (Array Int Int)) (v_ArrVal_3646 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3643) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3646) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3642) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3644) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3641) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-18 20:13:50,310 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3641 (Array Int Int)) (v_ArrVal_3642 (Array Int Int)) (v_ArrVal_3643 (Array Int Int)) (v_ArrVal_3644 (Array Int Int)) (v_ArrVal_3645 (Array Int Int)) (v_ArrVal_3646 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3643) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3646) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3642) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3644) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3641) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-11-18 20:13:50,329 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3641 (Array Int Int)) (v_ArrVal_3642 (Array Int Int)) (v_ArrVal_3643 (Array Int Int)) (v_ArrVal_3644 (Array Int Int)) (v_ArrVal_3645 (Array Int Int)) (v_ArrVal_3646 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3643) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3646) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3642) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3644) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3641) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-18 20:13:50,371 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3641 (Array Int Int)) (v_ArrVal_3642 (Array Int Int)) (v_ArrVal_3643 (Array Int Int)) (v_ArrVal_3644 (Array Int Int)) (v_ArrVal_3645 (Array Int Int)) (v_ArrVal_3646 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3643) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3646) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3642) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3644) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3641) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-18 20:13:50,386 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3641 (Array Int Int)) (v_ArrVal_3642 (Array Int Int)) (v_ArrVal_3643 (Array Int Int)) (v_ArrVal_3644 (Array Int Int)) (v_ArrVal_3645 (Array Int Int)) (v_ArrVal_3646 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3643) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3646) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3642) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3644) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3641) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-18 20:13:50,416 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3641 (Array Int Int)) (v_ArrVal_3642 (Array Int Int)) (v_ArrVal_3643 (Array Int Int)) (v_ArrVal_3644 (Array Int Int)) (v_ArrVal_3645 (Array Int Int)) (v_ArrVal_3646 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3643) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3646) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3642) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3644) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3641) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3645) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-11-18 20:13:51,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261222036] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:13:51,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:13:51,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 33] total 66 [2022-11-18 20:13:51,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252209021] [2022-11-18 20:13:51,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:13:51,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-18 20:13:51,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:13:51,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-18 20:13:51,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=4595, Unknown=7, NotChecked=994, Total=5852 [2022-11-18 20:13:51,254 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 66 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 57 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:14:02,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:14:02,736 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2022-11-18 20:14:02,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-18 20:14:02,736 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 57 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2022-11-18 20:14:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:14:02,737 INFO L225 Difference]: With dead ends: 109 [2022-11-18 20:14:02,738 INFO L226 Difference]: Without dead ends: 109 [2022-11-18 20:14:02,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1359 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=772, Invalid=8369, Unknown=7, NotChecked=1358, Total=10506 [2022-11-18 20:14:02,739 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 817 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 2241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:14:02,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1208 Invalid, 2241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2188 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-18 20:14:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-18 20:14:02,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2022-11-18 20:14:02,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:14:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-11-18 20:14:02,743 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 58 [2022-11-18 20:14:02,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:14:02,744 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-11-18 20:14:02,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 62 states have (on average 1.5806451612903225) internal successors, (98), 57 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:14:02,744 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-11-18 20:14:02,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-18 20:14:02,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:14:02,745 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2022-11-18 20:14:02,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-18 20:14:02,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-18 20:14:02,954 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:14:02,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:02,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478905, now seen corresponding path program 1 times [2022-11-18 20:14:02,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:02,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960365813] [2022-11-18 20:14:02,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:02,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:06,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:14:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:06,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:14:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:06,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:14:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:07,540 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:14:07,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:07,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960365813] [2022-11-18 20:14:07,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960365813] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:14:07,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843367635] [2022-11-18 20:14:07,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:07,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:14:07,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:14:07,544 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:14:07,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-18 20:14:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:07,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 122 conjunts are in the unsatisfiable core [2022-11-18 20:14:07,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:14:07,935 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-18 20:14:08,030 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-18 20:14:08,343 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:14:08,344 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-18 20:14:08,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:14:08,833 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-18 20:14:08,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 20:14:09,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:14:09,446 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:14:09,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-18 20:14:09,936 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:14:09,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 21 [2022-11-18 20:14:09,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:14:10,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:10,745 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 14 treesize of output 16 [2022-11-18 20:14:10,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:10,768 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:14:10,768 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 2 case distinctions, treesize of input 44 treesize of output 42 [2022-11-18 20:14:10,789 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:14:10,789 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 15 treesize of output 15 [2022-11-18 20:14:12,338 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-18 20:14:12,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 73 [2022-11-18 20:14:12,364 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:14:12,364 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 43 treesize of output 44 [2022-11-18 20:14:12,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:12,597 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:14:12,597 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 2 case distinctions, treesize of input 60 treesize of output 52 [2022-11-18 20:14:12,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:12,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-11-18 20:14:12,811 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 32 treesize of output 20 [2022-11-18 20:14:13,237 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:14:13,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2022-11-18 20:14:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:14:13,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:14:13,659 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3848))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3849) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-18 20:14:13,674 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3847) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3848))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3846) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3849) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-18 20:14:13,700 INFO L321 Elim1Store]: treesize reduction 5, result has 86.8 percent of original size [2022-11-18 20:14:13,701 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-18 20:14:13,708 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3847) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3848))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3846) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3849) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) is different from false [2022-11-18 20:14:13,721 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3847) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3848))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3846) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3849) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-11-18 20:14:13,734 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (= .cse0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3847) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3848))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3846) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3849) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-18 20:14:14,166 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3847) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3848))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3846) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3849) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))) is different from false [2022-11-18 20:14:14,189 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3849 (Array Int Int)) (v_ArrVal_3846 (Array Int Int)) (v_ArrVal_3847 (Array Int Int)) (v_ArrVal_3848 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3847) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3848))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3846) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3849) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))) is different from false [2022-11-18 20:14:14,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843367635] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:14:14,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:14:14,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 33] total 69 [2022-11-18 20:14:14,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990166071] [2022-11-18 20:14:14,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:14:14,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-18 20:14:14,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:14,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-18 20:14:14,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=5307, Unknown=70, NotChecked=1064, Total=6642 [2022-11-18 20:14:14,689 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 70 states, 65 states have (on average 1.646153846153846) internal successors, (107), 61 states have internal predecessors, (107), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:14:26,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:14:26,022 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2022-11-18 20:14:26,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-18 20:14:26,022 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 65 states have (on average 1.646153846153846) internal successors, (107), 61 states have internal predecessors, (107), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2022-11-18 20:14:26,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:14:26,024 INFO L225 Difference]: With dead ends: 123 [2022-11-18 20:14:26,024 INFO L226 Difference]: Without dead ends: 123 [2022-11-18 20:14:26,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=618, Invalid=8646, Unknown=76, NotChecked=1372, Total=10712 [2022-11-18 20:14:26,027 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 383 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 2636 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-18 20:14:26,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1610 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2636 Invalid, 0 Unknown, 166 Unchecked, 2.8s Time] [2022-11-18 20:14:26,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-18 20:14:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2022-11-18 20:14:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 88 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:14:26,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2022-11-18 20:14:26,031 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 62 [2022-11-18 20:14:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:14:26,032 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2022-11-18 20:14:26,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 65 states have (on average 1.646153846153846) internal successors, (107), 61 states have internal predecessors, (107), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:14:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-11-18 20:14:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-18 20:14:26,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:14:26,033 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2022-11-18 20:14:26,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-18 20:14:26,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-18 20:14:26,242 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:14:26,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:14:26,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478904, now seen corresponding path program 1 times [2022-11-18 20:14:26,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:14:26,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671840883] [2022-11-18 20:14:26,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:26,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:14:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:29,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:14:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:29,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:14:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:30,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:14:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:14:30,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:14:30,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671840883] [2022-11-18 20:14:30,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671840883] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:14:30,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901332201] [2022-11-18 20:14:30,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:14:30,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:14:30,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:14:30,834 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:14:30,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-18 20:14:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:14:31,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 150 conjunts are in the unsatisfiable core [2022-11-18 20:14:31,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:14:31,273 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-18 20:14:31,777 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:14:31,777 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-18 20:14:32,480 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-18 20:14:32,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-18 20:14:32,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:14:32,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:14:32,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:14:33,253 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:14:33,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2022-11-18 20:14:33,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-18 20:14:34,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:34,534 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:14:34,534 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 2 case distinctions, treesize of input 81 treesize of output 65 [2022-11-18 20:14:34,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:34,568 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-11-18 20:14:34,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 42 [2022-11-18 20:14:34,586 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-18 20:14:34,613 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-18 20:14:34,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 34 [2022-11-18 20:14:34,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:34,653 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-18 20:14:34,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-11-18 20:14:36,469 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-18 20:14:36,469 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 84 [2022-11-18 20:14:36,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:36,515 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-18 20:14:36,516 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2022-11-18 20:14:36,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:14:36,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-18 20:14:36,752 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:14:36,752 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 2 case distinctions, treesize of input 79 treesize of output 63 [2022-11-18 20:14:37,422 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-18 20:14:37,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 45 [2022-11-18 20:14:37,894 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 20:14:37,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-18 20:14:38,026 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:14:38,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:14:46,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901332201] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:14:46,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:14:46,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 72 [2022-11-18 20:14:46,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823268816] [2022-11-18 20:14:46,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:14:46,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-18 20:14:46,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:14:46,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-18 20:14:46,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=6875, Unknown=117, NotChecked=0, Total=7310 [2022-11-18 20:14:46,954 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 73 states, 68 states have (on average 1.6323529411764706) internal successors, (111), 63 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:15:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:15:01,052 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2022-11-18 20:15:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-18 20:15:01,053 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 68 states have (on average 1.6323529411764706) internal successors, (111), 63 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2022-11-18 20:15:01,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:15:01,054 INFO L225 Difference]: With dead ends: 127 [2022-11-18 20:15:01,054 INFO L226 Difference]: Without dead ends: 127 [2022-11-18 20:15:01,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2130 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=700, Invalid=11392, Unknown=118, NotChecked=0, Total=12210 [2022-11-18 20:15:01,057 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 185 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1746 SdHoareTripleChecker+Invalid, 2544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:15:01,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1746 Invalid, 2544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2232 Invalid, 0 Unknown, 280 Unchecked, 4.4s Time] [2022-11-18 20:15:01,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-18 20:15:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2022-11-18 20:15:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.263157894736842) internal successors, (96), 90 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:15:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2022-11-18 20:15:01,061 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 62 [2022-11-18 20:15:01,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:15:01,062 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2022-11-18 20:15:01,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 68 states have (on average 1.6323529411764706) internal successors, (111), 63 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:15:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2022-11-18 20:15:01,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-18 20:15:01,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:15:01,063 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2022-11-18 20:15:01,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-18 20:15:01,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-18 20:15:01,271 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:15:01,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:01,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1350141375, now seen corresponding path program 1 times [2022-11-18 20:15:01,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:01,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316418803] [2022-11-18 20:15:01,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:01,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:04,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:15:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:04,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:15:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:05,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:15:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:06,016 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:15:06,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:06,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316418803] [2022-11-18 20:15:06,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316418803] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:15:06,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23403729] [2022-11-18 20:15:06,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:06,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:15:06,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:15:06,019 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:15:06,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-18 20:15:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:06,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-18 20:15:06,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:15:06,492 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-18 20:15:06,635 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-18 20:15:07,126 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:15:07,127 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-18 20:15:07,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:15:07,862 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-18 20:15:07,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 20:15:08,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:15:08,792 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:15:08,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-18 20:15:09,532 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-18 20:15:09,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 21 [2022-11-18 20:15:10,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:10,737 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:15:10,738 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 2 case distinctions, treesize of input 60 treesize of output 56 [2022-11-18 20:15:10,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:10,751 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 43 treesize of output 43 [2022-11-18 20:15:10,790 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:15:10,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-18 20:15:12,825 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-11-18 20:15:12,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 54 [2022-11-18 20:15:12,860 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:15:12,861 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 74 treesize of output 73 [2022-11-18 20:15:13,284 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2022-11-18 20:15:13,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 95 [2022-11-18 20:15:13,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:13,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2022-11-18 20:15:13,324 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 35 treesize of output 29 [2022-11-18 20:15:13,741 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 108 treesize of output 84 [2022-11-18 20:15:15,406 INFO L321 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2022-11-18 20:15:15,407 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 135 treesize of output 93 [2022-11-18 20:15:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:15:15,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:15:15,993 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4254 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4257 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4257))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_4254) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-18 20:15:16,042 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4254 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4257 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4257))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_4254) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-18 20:15:16,057 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4254 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4257 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4257))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4254) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-18 20:15:16,094 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4254 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4257 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4257))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4254) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-18 20:15:16,122 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4254 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4257 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4257))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4254) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-18 20:15:16,154 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4254 (Array Int Int)) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4257 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int)) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_4257))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4254) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_4256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2022-11-18 20:15:16,350 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4264 (Array Int Int)) (v_ArrVal_4265 (Array Int Int)) (v_ArrVal_4254 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| Int) (v_ArrVal_4256 (Array Int Int)) (v_ArrVal_4257 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int)) (or (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| v_ArrVal_4265)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| v_ArrVal_4264))) (let ((.cse3 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| v_ArrVal_4257))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store .cse2 .cse3 v_ArrVal_4254) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| v_ArrVal_4256) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_45| |c_#StackHeapBarrier|)))) is different from false [2022-11-18 20:15:16,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23403729] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:15:16,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:15:16,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 67 [2022-11-18 20:15:16,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36072099] [2022-11-18 20:15:16,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:15:16,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-18 20:15:16,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:16,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-18 20:15:16,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=4292, Unknown=56, NotChecked=966, Total=5550 [2022-11-18 20:15:16,356 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 67 states, 63 states have (on average 1.746031746031746) internal successors, (110), 58 states have internal predecessors, (110), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:15:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:15:22,740 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-11-18 20:15:22,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-18 20:15:22,741 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 63 states have (on average 1.746031746031746) internal successors, (110), 58 states have internal predecessors, (110), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2022-11-18 20:15:22,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:15:22,742 INFO L225 Difference]: With dead ends: 96 [2022-11-18 20:15:22,742 INFO L226 Difference]: Without dead ends: 96 [2022-11-18 20:15:22,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1151 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=399, Invalid=6542, Unknown=59, NotChecked=1190, Total=8190 [2022-11-18 20:15:22,744 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 78 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 183 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:15:22,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1550 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1351 Invalid, 0 Unknown, 183 Unchecked, 2.5s Time] [2022-11-18 20:15:22,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-18 20:15:22,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-11-18 20:15:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.25) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:15:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2022-11-18 20:15:22,748 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 63 [2022-11-18 20:15:22,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:15:22,748 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2022-11-18 20:15:22,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 63 states have (on average 1.746031746031746) internal successors, (110), 58 states have internal predecessors, (110), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:15:22,749 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-11-18 20:15:22,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-18 20:15:22,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:15:22,750 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2022-11-18 20:15:22,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-18 20:15:22,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:15:22,968 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:15:22,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:15:22,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1095322986, now seen corresponding path program 1 times [2022-11-18 20:15:22,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:15:22,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130401792] [2022-11-18 20:15:22,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:22,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:15:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:27,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:15:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:27,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:15:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:28,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:15:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:29,463 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:15:29,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:15:29,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130401792] [2022-11-18 20:15:29,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130401792] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:15:29,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907206650] [2022-11-18 20:15:29,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:15:29,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:15:29,465 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:15:29,466 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:15:29,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-18 20:15:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:15:29,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 192 conjunts are in the unsatisfiable core [2022-11-18 20:15:29,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:15:29,902 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-18 20:15:30,070 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-18 20:15:30,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 20:15:30,828 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:15:30,829 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-18 20:15:31,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:15:32,402 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:15:32,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-18 20:15:32,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:15:32,511 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-18 20:15:32,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 20:15:33,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:15:33,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:15:33,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:15:33,903 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:15:33,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 67 [2022-11-18 20:15:33,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-18 20:15:33,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-18 20:15:34,961 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:15:34,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2022-11-18 20:15:34,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-18 20:15:36,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:36,109 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-18 20:15:36,110 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 2 case distinctions, treesize of input 85 treesize of output 62 [2022-11-18 20:15:36,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:36,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:36,173 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-11-18 20:15:36,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2022-11-18 20:15:36,255 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-18 20:15:36,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-18 20:15:36,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-11-18 20:15:40,463 INFO L321 Elim1Store]: treesize reduction 143, result has 15.4 percent of original size [2022-11-18 20:15:40,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 222 treesize of output 108 [2022-11-18 20:15:40,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:40,537 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-18 20:15:40,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 99 [2022-11-18 20:15:40,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:15:40,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:15:40,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 50 [2022-11-18 20:15:41,090 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-11-18 20:15:41,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 238 treesize of output 157 [2022-11-18 20:15:41,148 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-11-18 20:15:41,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 154 [2022-11-18 20:15:41,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2022-11-18 20:15:42,515 INFO L321 Elim1Store]: treesize reduction 44, result has 26.7 percent of original size [2022-11-18 20:15:42,515 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 166 treesize of output 74 [2022-11-18 20:15:43,264 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 20:15:43,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-11-18 20:15:43,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-18 20:15:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:15:43,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:15:44,907 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4471 (Array Int Int)) (v_ArrVal_4472 (Array Int Int)) (v_ArrVal_4470 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4470)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4472))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4471) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) is different from false [2022-11-18 20:15:44,931 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4471 (Array Int Int)) (v_ArrVal_4472 (Array Int Int)) (v_ArrVal_4468 (Array Int Int)) (v_ArrVal_4467 Int) (v_ArrVal_4470 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_4468) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4470)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4472))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_4467)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4471) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) is different from false [2022-11-18 20:15:48,553 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4482 (Array Int Int)) (v_ArrVal_4471 (Array Int Int)) (v_ArrVal_4483 (Array Int Int)) (v_ArrVal_4472 (Array Int Int)) (v_ArrVal_4484 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| Int) (v_ArrVal_4468 (Array Int Int)) (v_ArrVal_4467 Int) (v_ArrVal_4470 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| v_ArrVal_4482)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| v_ArrVal_4483))) (let ((.cse10 (select (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse11 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select (select .cse7 .cse10) .cse11))) (let ((.cse8 (select .cse7 .cse1)) (.cse2 (select (select .cse9 .cse10) .cse11))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store (store .cse9 .cse1 v_ArrVal_4468) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| v_ArrVal_4470)) (.cse3 (store (store .cse7 .cse1 (store .cse8 .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| v_ArrVal_4472))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| v_ArrVal_4484))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_4467))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| v_ArrVal_4471) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 4))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_48|) 0)) (not (= .cse10 (select .cse8 .cse2))))))))) is different from false [2022-11-18 20:15:48,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907206650] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:15:48,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:15:48,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 41] total 74 [2022-11-18 20:15:48,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175451768] [2022-11-18 20:15:48,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:15:48,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-18 20:15:48,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:15:48,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-18 20:15:48,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=7140, Unknown=8, NotChecked=516, Total=8010 [2022-11-18 20:15:48,562 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 74 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 64 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:16:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:16:06,564 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-11-18 20:16:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-18 20:16:06,564 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 64 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2022-11-18 20:16:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:16:06,565 INFO L225 Difference]: With dead ends: 97 [2022-11-18 20:16:06,565 INFO L226 Difference]: Without dead ends: 97 [2022-11-18 20:16:06,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 114 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2735 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=837, Invalid=11821, Unknown=10, NotChecked=672, Total=13340 [2022-11-18 20:16:06,567 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 226 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 2478 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 2654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:16:06,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1991 Invalid, 2654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2478 Invalid, 0 Unknown, 133 Unchecked, 5.4s Time] [2022-11-18 20:16:06,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-18 20:16:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2022-11-18 20:16:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.236842105263158) internal successors, (94), 90 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:16:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2022-11-18 20:16:06,571 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 64 [2022-11-18 20:16:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:16:06,571 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2022-11-18 20:16:06,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 64 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-18 20:16:06,572 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-11-18 20:16:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-18 20:16:06,573 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:16:06,573 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-18 20:16:06,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-11-18 20:16:06,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-18 20:16:06,781 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:16:06,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:16:06,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826698, now seen corresponding path program 2 times [2022-11-18 20:16:06,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:16:06,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194934116] [2022-11-18 20:16:06,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:16:06,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:16:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:16:12,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:16:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:16:13,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:16:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:16:13,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:16:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:16:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:16:14,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:16:14,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194934116] [2022-11-18 20:16:14,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194934116] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:16:14,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790252347] [2022-11-18 20:16:14,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:16:14,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:16:14,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:16:14,826 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:16:14,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-18 20:16:15,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:16:15,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:16:15,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 160 conjunts are in the unsatisfiable core [2022-11-18 20:16:15,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:16:17,280 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 9 treesize of output 5 [2022-11-18 20:16:17,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:16:17,521 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-18 20:16:18,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:16:18,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:16:18,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-11-18 20:16:18,788 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:16:18,788 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 15 treesize of output 15 [2022-11-18 20:16:18,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:16:18,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:16:24,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:16:24,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:16:24,861 INFO L321 Elim1Store]: treesize reduction 123, result has 25.9 percent of original size [2022-11-18 20:16:24,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 209 treesize of output 132 [2022-11-18 20:16:24,930 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-18 20:16:24,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 162 treesize of output 97 [2022-11-18 20:16:26,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:16:26,741 INFO L321 Elim1Store]: treesize reduction 208, result has 29.0 percent of original size [2022-11-18 20:16:26,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 161 treesize of output 184 [2022-11-18 20:16:26,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:16:26,939 INFO L321 Elim1Store]: treesize reduction 128, result has 22.9 percent of original size [2022-11-18 20:16:26,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 160 treesize of output 143 [2022-11-18 20:16:33,004 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:16:33,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 197 treesize of output 215 [2022-11-18 20:16:37,204 INFO L321 Elim1Store]: treesize reduction 148, result has 54.5 percent of original size [2022-11-18 20:16:37,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 219 treesize of output 321 [2022-11-18 20:16:37,723 INFO L321 Elim1Store]: treesize reduction 64, result has 70.0 percent of original size [2022-11-18 20:16:37,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 240 treesize of output 310 [2022-11-18 20:16:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:16:52,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:16:54,169 INFO L321 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2022-11-18 20:16:54,170 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 96 treesize of output 95 [2022-11-18 20:17:04,127 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 5913 treesize of output 4714 [2022-11-18 20:17:08,066 WARN L859 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (or (forall ((v_ArrVal_4690 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4690))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4689 Int)) (let ((.cse10 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 0) 4 v_ArrVal_4689)))) (let ((.cse0 (select (select .cse10 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select (select .cse10 .cse0) .cse13))) (let ((.cse6 (select .cse10 .cse1)) (.cse7 (select (select .cse12 .cse0) .cse13))) (let ((.cse8 (let ((.cse11 (store .cse12 .cse1 (store (select .cse12 .cse1) .cse7 0)))) (store .cse11 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse11 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse11 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse2 (let ((.cse9 (store .cse10 .cse1 (store .cse6 .cse7 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)))) (store .cse9 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse9 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (select (select .cse8 .cse3) .cse4))) (or (= .cse0 .cse1) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (select (select .cse2 (select (select .cse2 .cse3) .cse4)) .cse5)) (not (= .cse0 (select .cse6 .cse7))) (< 0 .cse5) (= .cse0 0) (not (<= 0 .cse7))))))))))) (not (<= 0 .cse13)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (or (forall ((v_ArrVal_4690 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4690))) (let ((.cse21 (select (select .cse27 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4689 Int)) (let ((.cse24 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 0) 4 v_ArrVal_4689)))) (let ((.cse18 (select (select .cse24 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse25 (select (select .cse24 .cse18) .cse21))) (let ((.cse19 (select .cse24 .cse25)) (.cse20 (select (select .cse27 .cse18) .cse21))) (let ((.cse22 (let ((.cse26 (store .cse27 .cse25 (store (select .cse27 .cse25) .cse20 0)))) (store .cse26 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse26 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse26 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse14 (let ((.cse23 (store .cse24 .cse25 (store .cse19 .cse20 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)))) (store .cse23 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse23 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse23 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse17 (select (select .cse22 .cse15) .cse16))) (or (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (select (select .cse14 (select (select .cse14 .cse15) .cse16)) .cse17)) (not (= .cse18 (select .cse19 .cse20))) (= .cse21 .cse20) (< 0 .cse17) (= .cse18 0) (not (<= 0 .cse20))))))))))) (not (<= 0 .cse21)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (or (forall ((v_ArrVal_4690 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4690))) (let ((.cse28 (select (select .cse41 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= .cse28 0) (not (<= 0 .cse28)) (forall ((v_ArrVal_4689 Int)) (let ((.cse39 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 0) 4 v_ArrVal_4689)))) (let ((.cse29 (select (select .cse39 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse30 (select (select .cse39 .cse29) .cse28))) (let ((.cse35 (select .cse39 .cse30)) (.cse36 (select (select .cse41 .cse29) .cse28))) (let ((.cse37 (let ((.cse40 (store .cse41 .cse30 (store (select .cse41 .cse30) .cse36 0)))) (store .cse40 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse40 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse40 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse31 (let ((.cse38 (store .cse39 .cse30 (store .cse35 .cse36 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)))) (store .cse38 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse38 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse38 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse32 (select (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse33 (select (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (select (select .cse37 .cse32) .cse33))) (or (= .cse29 .cse30) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (select (select .cse31 (select (select .cse31 .cse32) .cse33)) .cse34)) (not (= .cse29 (select .cse35 .cse36))) (< 0 .cse34) (not (<= 0 .cse36))))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (or (forall ((v_ArrVal_4690 (Array Int Int))) (let ((.cse54 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4690))) (let ((.cse55 (select (select .cse54 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (forall ((v_ArrVal_4689 Int)) (let ((.cse52 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 0) 4 v_ArrVal_4689)))) (let ((.cse43 (select (select .cse52 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse44 (select (select .cse52 .cse43) .cse55))) (let ((.cse49 (select .cse52 .cse44)) (.cse50 (select (select .cse54 .cse43) .cse55))) (let ((.cse46 (let ((.cse53 (store .cse54 .cse44 (store (select .cse54 .cse44) .cse50 0)))) (store .cse53 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse53 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse53 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse45 (let ((.cse51 (store .cse52 .cse44 (store .cse49 .cse50 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)))) (store .cse51 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse51 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse51 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse47 (select (select .cse45 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse48 (select (select .cse46 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse42 (select (select .cse45 .cse47) .cse48))) (or (= .cse42 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) (= .cse43 .cse44) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (select (select .cse45 .cse42) (select (select .cse46 .cse47) .cse48))) (not (= .cse43 (select .cse49 .cse50))) (= .cse43 0) (not (<= 0 .cse50))))))))))) (not (<= 0 .cse55)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (or (forall ((v_ArrVal_4690 (Array Int Int))) (let ((.cse69 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4690))) (let ((.cse56 (select (select .cse69 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= .cse56 0) (not (<= 0 .cse56)) (forall ((v_ArrVal_4689 Int)) (let ((.cse67 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 0) 4 v_ArrVal_4689)))) (let ((.cse58 (select (select .cse67 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse59 (select (select .cse67 .cse58) .cse56))) (let ((.cse64 (select .cse67 .cse59)) (.cse65 (select (select .cse69 .cse58) .cse56))) (let ((.cse61 (let ((.cse68 (store .cse69 .cse59 (store (select .cse69 .cse59) .cse65 0)))) (store .cse68 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse68 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse68 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse60 (let ((.cse66 (store .cse67 .cse59 (store .cse64 .cse65 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)))) (store .cse66 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse66 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse66 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse62 (select (select .cse60 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse63 (select (select .cse61 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse57 (select (select .cse60 .cse62) .cse63))) (or (= .cse57 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) (= .cse58 .cse59) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (select (select .cse60 .cse57) (select (select .cse61 .cse62) .cse63))) (not (= .cse58 (select .cse64 .cse65))) (not (<= 0 .cse65))))))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (or (forall ((v_ArrVal_4690 (Array Int Int))) (let ((.cse83 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4690))) (let ((.cse70 (select (select .cse83 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= .cse70 0) (forall ((v_ArrVal_4689 Int)) (let ((.cse80 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 0) 4 v_ArrVal_4689)))) (let ((.cse76 (select (select .cse80 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse81 (select (select .cse80 .cse76) .cse70))) (let ((.cse77 (select .cse80 .cse81)) (.cse78 (select (select .cse83 .cse76) .cse70))) (let ((.cse73 (let ((.cse82 (store .cse83 .cse81 (store (select .cse83 .cse81) .cse78 0)))) (store .cse82 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse82 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse82 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse72 (let ((.cse79 (store .cse80 .cse81 (store .cse77 .cse78 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)))) (store .cse79 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse79 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse79 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse74 (select (select .cse72 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse75 (select (select .cse73 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse71 (select (select .cse72 .cse74) .cse75))) (or (= .cse71 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (select (select .cse72 .cse71) (select (select .cse73 .cse74) .cse75))) (not (= .cse76 (select .cse77 .cse78))) (= .cse70 .cse78) (not (<= 0 .cse78))))))))))) (not (<= 0 .cse70)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (forall ((v_ArrVal_4690 (Array Int Int))) (let ((.cse97 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4690))) (let ((.cse84 (select (select .cse97 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (<= 0 .cse84)) (forall ((v_ArrVal_4689 Int)) (let ((.cse94 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 0) 4 v_ArrVal_4689)))) (let ((.cse90 (select (select .cse94 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse95 (select (select .cse94 .cse90) .cse84))) (let ((.cse91 (select .cse94 .cse95)) (.cse92 (select (select .cse97 .cse90) .cse84))) (let ((.cse87 (let ((.cse96 (store .cse97 .cse95 (store (select .cse97 .cse95) .cse92 0)))) (store .cse96 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse96 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse96 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse86 (let ((.cse93 (store .cse94 .cse95 (store .cse91 .cse92 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)))) (store .cse93 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse93 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse93 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse88 (select (select .cse86 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse89 (select (select .cse87 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse85 (select (select .cse86 .cse88) .cse89))) (or (= .cse85 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (select (select .cse86 .cse85) (select (select .cse87 .cse88) .cse89))) (not (= .cse90 (select .cse91 .cse92))) (= .cse84 .cse92) (= .cse90 0) (not (<= 0 .cse92))))))))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| Int)) (or (forall ((v_ArrVal_4690 (Array Int Int))) (let ((.cse111 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| v_ArrVal_4690))) (let ((.cse98 (select (select .cse111 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= .cse98 0) (forall ((v_ArrVal_4689 Int)) (let ((.cse108 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 0) 4 v_ArrVal_4689)))) (let ((.cse103 (select (select .cse108 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse109 (select (select .cse108 .cse103) .cse98))) (let ((.cse104 (select .cse108 .cse109)) (.cse105 (select (select .cse111 .cse103) .cse98))) (let ((.cse106 (let ((.cse110 (store .cse111 .cse109 (store (select .cse111 .cse109) .cse105 0)))) (store .cse110 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse110 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse110 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))))) (.cse99 (let ((.cse107 (store .cse108 .cse109 (store .cse104 .cse105 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|)))) (store .cse107 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (store (select .cse107 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0 (select (select .cse107 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse100 (select (select .cse99 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse101 (select (select .cse106 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse102 (select (select .cse106 .cse100) .cse101))) (or (= |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| (select (select .cse99 (select (select .cse99 .cse100) .cse101)) .cse102)) (not (= .cse103 (select .cse104 .cse105))) (= .cse98 .cse105) (< 0 .cse102) (not (<= 0 .cse105))))))))))) (not (<= 0 .cse98)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_51| |c_#StackHeapBarrier|))))) is different from true [2022-11-18 20:17:08,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790252347] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:17:08,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:17:08,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 40] total 82 [2022-11-18 20:17:08,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169913567] [2022-11-18 20:17:08,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:17:08,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-11-18 20:17:08,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:17:08,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-11-18 20:17:08,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=10271, Unknown=1, NotChecked=204, Total=10920 [2022-11-18 20:17:08,073 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 83 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 76 states have internal predecessors, (121), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:17:24,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:17:24,981 INFO L93 Difference]: Finished difference Result 133 states and 141 transitions. [2022-11-18 20:17:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-18 20:17:24,982 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 76 states have internal predecessors, (121), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 68 [2022-11-18 20:17:24,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:17:24,983 INFO L225 Difference]: With dead ends: 133 [2022-11-18 20:17:24,983 INFO L226 Difference]: Without dead ends: 133 [2022-11-18 20:17:24,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3545 ImplicationChecksByTransitivity, 44.0s TimeCoverageRelationStatistics Valid=860, Invalid=16965, Unknown=1, NotChecked=264, Total=18090 [2022-11-18 20:17:24,986 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 145 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 404 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:17:24,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1625 Invalid, 2612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2181 Invalid, 0 Unknown, 404 Unchecked, 4.6s Time] [2022-11-18 20:17:24,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-18 20:17:24,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 100. [2022-11-18 20:17:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.25) internal successors, (100), 94 states have internal predecessors, (100), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:17:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-11-18 20:17:24,991 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 68 [2022-11-18 20:17:24,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:17:24,992 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-11-18 20:17:24,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 76 states have internal predecessors, (121), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:17:24,992 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-11-18 20:17:24,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-18 20:17:24,993 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:17:24,993 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-18 20:17:25,003 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-11-18 20:17:25,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-18 20:17:25,199 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:17:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:17:25,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826697, now seen corresponding path program 2 times [2022-11-18 20:17:25,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:17:25,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124269876] [2022-11-18 20:17:25,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:17:25,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:17:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:17:30,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:17:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:17:30,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:17:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:17:30,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:17:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:17:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:17:32,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:17:32,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124269876] [2022-11-18 20:17:32,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124269876] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:17:32,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433392503] [2022-11-18 20:17:32,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:17:32,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:17:32,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:17:32,367 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:17:32,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-18 20:17:32,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:17:32,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:17:32,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 164 conjunts are in the unsatisfiable core [2022-11-18 20:17:32,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:17:32,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-18 20:17:33,006 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-18 20:17:34,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-18 20:17:34,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:17:35,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:17:35,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-18 20:17:35,951 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:17:35,951 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 15 treesize of output 15 [2022-11-18 20:17:35,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-18 20:17:35,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:17:35,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:17:39,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:17:39,987 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2022-11-18 20:17:39,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 168 treesize of output 111 [2022-11-18 20:17:40,052 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2022-11-18 20:17:40,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 84 [2022-11-18 20:17:41,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:17:41,538 INFO L321 Elim1Store]: treesize reduction 160, result has 48.9 percent of original size [2022-11-18 20:17:41,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 167 treesize of output 254 [2022-11-18 20:17:41,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:17:41,712 INFO L321 Elim1Store]: treesize reduction 140, result has 26.3 percent of original size [2022-11-18 20:17:41,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 330 treesize of output 232 [2022-11-18 20:17:57,911 INFO L321 Elim1Store]: treesize reduction 240, result has 39.5 percent of original size [2022-11-18 20:17:57,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 13 new quantified variables, introduced 28 case distinctions, treesize of input 312 treesize of output 335 [2022-11-18 20:17:58,373 INFO L321 Elim1Store]: treesize reduction 68, result has 64.0 percent of original size [2022-11-18 20:17:58,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 17 case distinctions, treesize of input 313 treesize of output 297 [2022-11-18 20:18:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 20:18:03,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:19:56,680 WARN L233 SmtUtils]: Spent 9.83s on a formula simplification. DAG size of input: 129 DAG size of output: 117 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:19:56,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433392503] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:19:56,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:19:56,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37] total 75 [2022-11-18 20:19:56,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764792195] [2022-11-18 20:19:56,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:19:56,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-11-18 20:19:56,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:19:56,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-11-18 20:19:56,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=9643, Unknown=15, NotChecked=0, Total=10100 [2022-11-18 20:19:56,688 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 76 states, 72 states have (on average 1.7083333333333333) internal successors, (123), 69 states have internal predecessors, (123), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:20:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:20:33,843 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2022-11-18 20:20:33,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-18 20:20:33,844 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 72 states have (on average 1.7083333333333333) internal successors, (123), 69 states have internal predecessors, (123), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 68 [2022-11-18 20:20:33,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:20:33,845 INFO L225 Difference]: With dead ends: 100 [2022-11-18 20:20:33,846 INFO L226 Difference]: Without dead ends: 100 [2022-11-18 20:20:33,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3619 ImplicationChecksByTransitivity, 160.1s TimeCoverageRelationStatistics Valid=867, Invalid=17476, Unknown=17, NotChecked=0, Total=18360 [2022-11-18 20:20:33,849 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 76 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 1741 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 338 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:20:33,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1982 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1741 Invalid, 0 Unknown, 338 Unchecked, 3.9s Time] [2022-11-18 20:20:33,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-18 20:20:33,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-11-18 20:20:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.2375) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:20:33,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2022-11-18 20:20:33,855 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 68 [2022-11-18 20:20:33,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:20:33,855 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2022-11-18 20:20:33,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 72 states have (on average 1.7083333333333333) internal successors, (123), 69 states have internal predecessors, (123), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-18 20:20:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2022-11-18 20:20:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-18 20:20:33,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:20:33,857 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-18 20:20:33,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-11-18 20:20:34,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:20:34,068 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2022-11-18 20:20:34,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:20:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1057077042, now seen corresponding path program 1 times [2022-11-18 20:20:34,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:20:34,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576894712] [2022-11-18 20:20:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:34,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:20:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:38,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:20:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:39,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:20:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:39,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:20:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:20:41,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:20:41,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576894712] [2022-11-18 20:20:41,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576894712] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:20:41,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677800243] [2022-11-18 20:20:41,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:20:41,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:20:41,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:20:41,239 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:20:41,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_16ba017c-381d-48e0-a1af-a65a9139765f/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-18 20:20:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:20:41,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 189 conjunts are in the unsatisfiable core [2022-11-18 20:20:41,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:20:41,739 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-18 20:20:41,749 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-18 20:20:41,946 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-18 20:20:41,952 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-18 20:20:42,594 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:20:42,594 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-18 20:20:42,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:20:43,015 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-18 20:20:43,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:43,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-18 20:20:45,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-18 20:20:45,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 20:20:45,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:45,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:20:45,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:20:47,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:47,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:47,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2022-11-18 20:20:47,319 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:20:47,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-18 20:20:47,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:47,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:47,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-18 20:20:47,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:47,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 20:20:53,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:53,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:20:54,011 INFO L321 Elim1Store]: treesize reduction 127, result has 23.5 percent of original size [2022-11-18 20:20:54,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 258 treesize of output 153 [2022-11-18 20:20:54,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:54,081 INFO L321 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-11-18 20:20:54,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 104 [2022-11-18 20:20:56,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:56,444 INFO L321 Elim1Store]: treesize reduction 256, result has 29.1 percent of original size [2022-11-18 20:20:56,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 18 case distinctions, treesize of input 287 treesize of output 274 [2022-11-18 20:20:56,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:20:56,685 INFO L321 Elim1Store]: treesize reduction 152, result has 20.0 percent of original size [2022-11-18 20:20:56,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 292 treesize of output 218 [2022-11-18 20:21:04,068 INFO L321 Elim1Store]: treesize reduction 92, result has 70.2 percent of original size [2022-11-18 20:21:04,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 268 treesize of output 406