./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/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_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/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_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/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 f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- 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:49:17,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:49:17,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:49:17,907 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:49:17,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:49:17,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:49:17,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:49:17,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:49:17,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:49:17,929 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:49:17,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:49:17,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:49:17,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:49:17,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:49:17,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:49:17,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:49:17,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:49:17,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:49:17,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:49:17,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:49:17,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:49:17,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:49:17,968 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:49:17,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:49:17,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:49:17,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:49:17,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:49:17,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:49:17,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:49:17,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:49:17,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:49:17,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:49:17,985 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:49:17,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:49:17,987 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:49:17,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:49:17,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:49:17,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:49:17,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:49:17,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:49:17,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:49:17,997 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 20:49:18,053 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:49:18,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:49:18,055 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:49:18,055 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:49:18,057 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:49:18,057 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:49:18,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:49:18,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:49:18,058 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:49:18,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:49:18,060 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:49:18,060 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:49:18,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:49:18,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:49:18,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:49:18,061 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:49:18,061 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:49:18,061 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:49:18,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:49:18,062 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:49:18,062 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:49:18,062 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:49:18,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:49:18,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:49:18,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:49:18,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:49:18,083 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:49:18,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:49:18,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:49:18,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:49:18,084 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_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/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_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/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 -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2022-11-18 20:49:18,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:49:18,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:49:18,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:49:18,511 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:49:18,512 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:49:18,513 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2022-11-18 20:49:18,601 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/data/670465998/73f5a716eaeb481da8542841aca7ba7b/FLAGe04fdc661 [2022-11-18 20:49:19,287 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:49:19,288 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2022-11-18 20:49:19,299 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/data/670465998/73f5a716eaeb481da8542841aca7ba7b/FLAGe04fdc661 [2022-11-18 20:49:19,579 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/data/670465998/73f5a716eaeb481da8542841aca7ba7b [2022-11-18 20:49:19,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:49:19,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:49:19,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:49:19,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:49:19,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:49:19,594 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:49:19" (1/1) ... [2022-11-18 20:49:19,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672b1e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:19, skipping insertion in model container [2022-11-18 20:49:19,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:49:19" (1/1) ... [2022-11-18 20:49:19,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:49:19,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:49:20,015 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_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2022-11-18 20:49:20,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:49:20,044 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:49:20,133 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_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2022-11-18 20:49:20,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:49:20,177 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:49:20,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:20 WrapperNode [2022-11-18 20:49:20,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:49:20,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:49:20,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:49:20,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:49:20,191 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:49:20" (1/1) ... [2022-11-18 20:49:20,230 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:49:20" (1/1) ... [2022-11-18 20:49:20,267 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2022-11-18 20:49:20,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:49:20,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:49:20,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:49:20,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:49:20,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:20" (1/1) ... [2022-11-18 20:49:20,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:20" (1/1) ... [2022-11-18 20:49:20,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:20" (1/1) ... [2022-11-18 20:49:20,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:20" (1/1) ... [2022-11-18 20:49:20,313 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:20" (1/1) ... [2022-11-18 20:49:20,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:20" (1/1) ... [2022-11-18 20:49:20,334 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:20" (1/1) ... [2022-11-18 20:49:20,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:20" (1/1) ... [2022-11-18 20:49:20,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:49:20,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:49:20,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:49:20,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:49:20,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:20" (1/1) ... [2022-11-18 20:49:20,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:49:20,367 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:49:20,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:49:20,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:49:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:49:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:49:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-18 20:49:20,420 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-18 20:49:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:49:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:49:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:49:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:49:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:49:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:49:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-18 20:49:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:49:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:49:20,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:49:20,559 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:49:20,577 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:49:21,124 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:49:21,133 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:49:21,133 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-18 20:49:21,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:49:21 BoogieIcfgContainer [2022-11-18 20:49:21,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:49:21,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:49:21,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:49:21,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:49:21,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:49:19" (1/3) ... [2022-11-18 20:49:21,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac37a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:49:21, skipping insertion in model container [2022-11-18 20:49:21,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:49:20" (2/3) ... [2022-11-18 20:49:21,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac37a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:49:21, skipping insertion in model container [2022-11-18 20:49:21,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:49:21" (3/3) ... [2022-11-18 20:49:21,147 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2022-11-18 20:49:21,176 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:49:21,176 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 56 error locations. [2022-11-18 20:49:21,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:49:21,254 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;@44a07367, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:49:21,255 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2022-11-18 20:49:21,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 122 states have internal predecessors, (136), 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:49:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:49:21,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:21,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:49:21,277 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:21,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:21,289 INFO L85 PathProgramCache]: Analyzing trace with hash 895521621, now seen corresponding path program 1 times [2022-11-18 20:49:21,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:21,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305061711] [2022-11-18 20:49:21,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:21,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:21,782 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:49:21,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:21,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305061711] [2022-11-18 20:49:21,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305061711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:21,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:21,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:49:21,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716264769] [2022-11-18 20:49:21,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:21,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:49:21,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:21,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:49:21,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:49:21,838 INFO L87 Difference]: Start difference. First operand has 127 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 122 states have internal predecessors, (136), 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:49:22,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:22,061 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2022-11-18 20:49:22,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:49:22,064 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:49:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:22,073 INFO L225 Difference]: With dead ends: 125 [2022-11-18 20:49:22,073 INFO L226 Difference]: Without dead ends: 122 [2022-11-18 20:49:22,075 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:49:22,079 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 8 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:22,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 197 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:49:22,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-18 20:49:22,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-11-18 20:49:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.953125) internal successors, (125), 117 states have internal predecessors, (125), 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:49:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2022-11-18 20:49:22,137 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 6 [2022-11-18 20:49:22,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:22,138 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2022-11-18 20:49:22,138 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:49:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2022-11-18 20:49:22,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-18 20:49:22,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:22,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-18 20:49:22,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:49:22,140 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:22,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:22,141 INFO L85 PathProgramCache]: Analyzing trace with hash 895521622, now seen corresponding path program 1 times [2022-11-18 20:49:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:22,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999840195] [2022-11-18 20:49:22,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:22,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:22,274 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:49:22,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:22,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999840195] [2022-11-18 20:49:22,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999840195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:22,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:22,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:49:22,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236720832] [2022-11-18 20:49:22,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:22,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:49:22,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:22,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:49:22,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:49:22,280 INFO L87 Difference]: Start difference. First operand 122 states and 131 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:49:22,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:22,466 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2022-11-18 20:49:22,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:49:22,469 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:49:22,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:22,471 INFO L225 Difference]: With dead ends: 120 [2022-11-18 20:49:22,471 INFO L226 Difference]: Without dead ends: 120 [2022-11-18 20:49:22,472 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:49:22,473 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:22,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 199 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:49:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-18 20:49:22,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-11-18 20:49:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 64 states have (on average 1.921875) internal successors, (123), 115 states have internal predecessors, (123), 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:49:22,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2022-11-18 20:49:22,501 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 6 [2022-11-18 20:49:22,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:22,502 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2022-11-18 20:49:22,502 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:49:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2022-11-18 20:49:22,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 20:49:22,503 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:22,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:49:22,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:49:22,504 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:22,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:22,505 INFO L85 PathProgramCache]: Analyzing trace with hash 164994135, now seen corresponding path program 1 times [2022-11-18 20:49:22,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:22,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009844890] [2022-11-18 20:49:22,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:22,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:22,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:49:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:22,772 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:49:22,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:22,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009844890] [2022-11-18 20:49:22,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009844890] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:22,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:22,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:49:22,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938700691] [2022-11-18 20:49:22,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:22,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:49:22,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:22,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:49:22,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:49:22,785 INFO L87 Difference]: Start difference. First operand 120 states and 129 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:49:22,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:22,977 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-11-18 20:49:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:49:22,980 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:49:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:22,986 INFO L225 Difference]: With dead ends: 127 [2022-11-18 20:49:22,987 INFO L226 Difference]: Without dead ends: 127 [2022-11-18 20:49:22,988 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:49:22,998 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 5 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:22,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 296 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:49:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-18 20:49:23,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 121. [2022-11-18 20:49:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 116 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:49:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2022-11-18 20:49:23,015 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 13 [2022-11-18 20:49:23,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:23,016 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2022-11-18 20:49:23,016 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:49:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2022-11-18 20:49:23,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 20:49:23,017 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:23,018 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:49:23,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:49:23,020 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:23,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:23,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1546453220, now seen corresponding path program 1 times [2022-11-18 20:49:23,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:23,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223046772] [2022-11-18 20:49:23,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:23,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:23,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:49:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:23,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:49:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:23,318 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:49:23,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:23,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223046772] [2022-11-18 20:49:23,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223046772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:23,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:23,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:49:23,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708338151] [2022-11-18 20:49:23,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:23,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:49:23,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:23,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:49:23,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:49:23,322 INFO L87 Difference]: Start difference. First operand 121 states and 130 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:49:23,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:23,673 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2022-11-18 20:49:23,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:49:23,674 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:49:23,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:23,677 INFO L225 Difference]: With dead ends: 121 [2022-11-18 20:49:23,677 INFO L226 Difference]: Without dead ends: 121 [2022-11-18 20:49:23,678 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:49:23,684 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 13 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:23,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 419 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:49:23,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-18 20:49:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2022-11-18 20:49:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 65 states have (on average 1.8923076923076922) internal successors, (123), 115 states have internal predecessors, (123), 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:49:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2022-11-18 20:49:23,692 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 22 [2022-11-18 20:49:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:23,692 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2022-11-18 20:49:23,693 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:49:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2022-11-18 20:49:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 20:49:23,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:23,694 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:49:23,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:49:23,694 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:23,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:23,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1546453219, now seen corresponding path program 1 times [2022-11-18 20:49:23,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:23,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25910312] [2022-11-18 20:49:23,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:23,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:24,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:49:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:24,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:49:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:24,171 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:49:24,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:24,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25910312] [2022-11-18 20:49:24,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25910312] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:24,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:24,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:49:24,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062180753] [2022-11-18 20:49:24,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:24,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:49:24,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:24,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:49:24,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:49:24,174 INFO L87 Difference]: Start difference. First operand 120 states and 129 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:49:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:24,588 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2022-11-18 20:49:24,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:49:24,592 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:49:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:24,593 INFO L225 Difference]: With dead ends: 120 [2022-11-18 20:49:24,594 INFO L226 Difference]: Without dead ends: 120 [2022-11-18 20:49:24,594 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:49:24,595 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 11 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:24,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 443 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:49:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-18 20:49:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-11-18 20:49:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.876923076923077) internal successors, (122), 114 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-18 20:49:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2022-11-18 20:49:24,604 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 22 [2022-11-18 20:49:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:24,605 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2022-11-18 20:49:24,605 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:49:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2022-11-18 20:49:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:49:24,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:24,606 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:49:24,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:49:24,611 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:24,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:24,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1726296005, now seen corresponding path program 1 times [2022-11-18 20:49:24,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:24,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760270004] [2022-11-18 20:49:24,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:24,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:24,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:49:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:24,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:49:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:24,988 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:49:24,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:24,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760270004] [2022-11-18 20:49:24,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760270004] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:24,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037040819] [2022-11-18 20:49:24,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:24,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:49:24,990 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:49:24,995 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:49:25,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:49:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:25,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-18 20:49:25,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:49:25,205 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:49:25,264 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:49:25,285 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:49:25,312 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:49:25,313 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:49:25,385 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:49:25,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:49:25,763 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:49:25,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037040819] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:49:25,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:49:25,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-11-18 20:49:25,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019558288] [2022-11-18 20:49:25,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:49:25,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-18 20:49:25,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:25,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-18 20:49:25,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2022-11-18 20:49:25,767 INFO L87 Difference]: Start difference. First operand 119 states and 128 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:49:26,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:26,222 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2022-11-18 20:49:26,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:49:26,223 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:49:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:26,225 INFO L225 Difference]: With dead ends: 125 [2022-11-18 20:49:26,225 INFO L226 Difference]: Without dead ends: 125 [2022-11-18 20:49:26,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=304, Unknown=2, NotChecked=74, Total=462 [2022-11-18 20:49:26,226 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 32 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 385 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:26,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 665 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 411 Invalid, 0 Unknown, 385 Unchecked, 0.3s Time] [2022-11-18 20:49:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-18 20:49:26,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-11-18 20:49:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 71 states have (on average 1.7887323943661972) internal successors, (127), 119 states have internal predecessors, (127), 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:49:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2022-11-18 20:49:26,236 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 25 [2022-11-18 20:49:26,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:26,237 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2022-11-18 20:49:26,237 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:49:26,238 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2022-11-18 20:49:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:49:26,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:26,239 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:49:26,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:49:26,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-18 20:49:26,447 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:26,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1726296006, now seen corresponding path program 1 times [2022-11-18 20:49:26,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:26,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421676472] [2022-11-18 20:49:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:49:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:49:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:27,177 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:49:27,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:27,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421676472] [2022-11-18 20:49:27,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421676472] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:27,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037868131] [2022-11-18 20:49:27,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:27,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:49:27,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:49:27,180 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:49:27,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:49:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:27,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-18 20:49:27,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:49:27,393 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:49:27,758 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:49:27,758 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:49:27,769 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:49:27,870 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:49:27,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:49:28,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037868131] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:28,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:49:28,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2022-11-18 20:49:28,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680944870] [2022-11-18 20:49:28,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:49:28,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:49:28,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:28,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:49:28,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2022-11-18 20:49:28,090 INFO L87 Difference]: Start difference. First operand 125 states and 133 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:49:28,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:28,942 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2022-11-18 20:49:28,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:49:28,943 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:49:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:28,944 INFO L225 Difference]: With dead ends: 126 [2022-11-18 20:49:28,944 INFO L226 Difference]: Without dead ends: 126 [2022-11-18 20:49:28,945 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:49:28,945 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 126 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:28,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 706 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:49:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-18 20:49:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2022-11-18 20:49:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 71 states have (on average 1.7746478873239437) internal successors, (126), 118 states have internal predecessors, (126), 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:49:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2022-11-18 20:49:28,957 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 25 [2022-11-18 20:49:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:28,958 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2022-11-18 20:49:28,958 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:49:28,958 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2022-11-18 20:49:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-18 20:49:28,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:28,959 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:49:28,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:49:29,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:49:29,167 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:29,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:29,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1086704927, now seen corresponding path program 1 times [2022-11-18 20:49:29,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:29,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903258385] [2022-11-18 20:49:29,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:29,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:29,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:49:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:29,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:49:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:29,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:49:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:29,784 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:49:29,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:29,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903258385] [2022-11-18 20:49:29,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903258385] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:29,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180452812] [2022-11-18 20:49:29,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:29,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:49:29,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:49:29,789 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:49:29,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:49:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:29,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-18 20:49:29,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:49:29,996 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:49:30,013 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:49:30,040 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:49:30,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:30,121 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:49:30,139 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:49:30,158 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:49:30,181 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-18 20:49:30,182 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:49:30,262 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:49:30,303 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:49:30,304 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:49:30,317 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:49:30,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:49:30,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180452812] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:30,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:49:30,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2022-11-18 20:49:30,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362015848] [2022-11-18 20:49:30,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:49:30,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:49:30,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:30,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:49:30,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=272, Unknown=4, NotChecked=148, Total=506 [2022-11-18 20:49:30,876 INFO L87 Difference]: Start difference. First operand 124 states and 132 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:49:31,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:31,540 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2022-11-18 20:49:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:49:31,540 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:49:31,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:31,542 INFO L225 Difference]: With dead ends: 137 [2022-11-18 20:49:31,542 INFO L226 Difference]: Without dead ends: 137 [2022-11-18 20:49:31,542 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:49:31,543 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 263 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 530 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:31,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 426 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 445 Invalid, 0 Unknown, 530 Unchecked, 0.5s Time] [2022-11-18 20:49:31,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-18 20:49:31,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 116. [2022-11-18 20:49:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.6619718309859155) internal successors, (118), 110 states have internal predecessors, (118), 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:49:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2022-11-18 20:49:31,550 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 37 [2022-11-18 20:49:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:31,550 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2022-11-18 20:49:31,550 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:49:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2022-11-18 20:49:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-18 20:49:31,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:31,552 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:49:31,565 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 20:49:31,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:49:31,759 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:31,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1086704928, now seen corresponding path program 1 times [2022-11-18 20:49:31,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:31,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960441349] [2022-11-18 20:49:31,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:31,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:32,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:49:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:32,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:49:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:32,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:49:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:32,763 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:49:32,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:32,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960441349] [2022-11-18 20:49:32,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960441349] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:32,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792607] [2022-11-18 20:49:32,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:32,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:49:32,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:49:32,766 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:49:32,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:49:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:32,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-18 20:49:32,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:49:32,984 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:49:33,007 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:49:33,032 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:49:33,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:33,121 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:49:33,154 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:49:33,168 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:49:33,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:33,230 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:49:33,326 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:49:33,338 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:49:33,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:33,393 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:49:33,403 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:49:33,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:49:33,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792607] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:33,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:49:33,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2022-11-18 20:49:33,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744329717] [2022-11-18 20:49:33,538 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:49:33,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-18 20:49:33,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:33,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-18 20:49:33,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=171, Unknown=3, NotChecked=84, Total=306 [2022-11-18 20:49:33,540 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 16 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:49:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:34,153 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2022-11-18 20:49:34,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:49:34,154 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2022-11-18 20:49:34,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:34,155 INFO L225 Difference]: With dead ends: 125 [2022-11-18 20:49:34,155 INFO L226 Difference]: Without dead ends: 125 [2022-11-18 20:49:34,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=243, Unknown=3, NotChecked=102, Total=420 [2022-11-18 20:49:34,156 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 267 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:34,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 223 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 321 Invalid, 0 Unknown, 306 Unchecked, 0.5s Time] [2022-11-18 20:49:34,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-18 20:49:34,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-11-18 20:49:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 71 states have (on average 1.5352112676056338) internal successors, (109), 101 states have internal predecessors, (109), 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:49:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2022-11-18 20:49:34,162 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 37 [2022-11-18 20:49:34,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:34,162 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2022-11-18 20:49:34,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-18 20:49:34,162 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2022-11-18 20:49:34,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-18 20:49:34,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:34,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, 1] [2022-11-18 20:49:34,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:49:34,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-18 20:49:34,371 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:34,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:34,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1436990998, now seen corresponding path program 1 times [2022-11-18 20:49:34,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:34,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803527901] [2022-11-18 20:49:34,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:34,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:34,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:49:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:34,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:49:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:34,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:49:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:34,567 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:49:34,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:34,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803527901] [2022-11-18 20:49:34,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803527901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:34,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:34,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:49:34,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510277177] [2022-11-18 20:49:34,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:34,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:49:34,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:34,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:49:34,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:49:34,570 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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:49:34,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:34,838 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2022-11-18 20:49:34,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:49:34,839 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 40 [2022-11-18 20:49:34,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:34,840 INFO L225 Difference]: With dead ends: 123 [2022-11-18 20:49:34,840 INFO L226 Difference]: Without dead ends: 123 [2022-11-18 20:49:34,840 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:49:34,841 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 78 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:34,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 289 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:49:34,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-18 20:49:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-11-18 20:49:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 71 states have (on average 1.5070422535211268) internal successors, (107), 99 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:49:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2022-11-18 20:49:34,846 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 40 [2022-11-18 20:49:34,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:34,846 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2022-11-18 20:49:34,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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:49:34,847 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2022-11-18 20:49:34,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-18 20:49:34,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:34,848 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] [2022-11-18 20:49:34,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:49:34,849 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:34,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:34,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1436990997, now seen corresponding path program 1 times [2022-11-18 20:49:34,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:34,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736012648] [2022-11-18 20:49:34,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:34,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:35,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:49:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:35,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:49:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:35,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:49:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:35,168 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:49:35,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:35,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736012648] [2022-11-18 20:49:35,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736012648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:35,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:35,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:49:35,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730553674] [2022-11-18 20:49:35,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:35,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:49:35,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:35,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:49:35,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:49:35,172 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:49:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:35,428 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-11-18 20:49:35,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:49:35,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 40 [2022-11-18 20:49:35,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:35,430 INFO L225 Difference]: With dead ends: 103 [2022-11-18 20:49:35,430 INFO L226 Difference]: Without dead ends: 103 [2022-11-18 20:49:35,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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:49:35,431 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 79 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:35,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 304 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:49:35,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-18 20:49:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-18 20:49:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.4788732394366197) internal successors, (105), 97 states have internal predecessors, (105), 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:49:35,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2022-11-18 20:49:35,438 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 40 [2022-11-18 20:49:35,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:35,439 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2022-11-18 20:49:35,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:49:35,439 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-11-18 20:49:35,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 20:49:35,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:35,441 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:49:35,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:49:35,441 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:35,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:35,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1596801691, now seen corresponding path program 1 times [2022-11-18 20:49:35,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:35,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448771353] [2022-11-18 20:49:35,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:35,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:35,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:49:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:35,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:49:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:36,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:49:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:36,308 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:49:36,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:36,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448771353] [2022-11-18 20:49:36,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448771353] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:36,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093191955] [2022-11-18 20:49:36,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:36,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:49:36,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:49:36,311 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:49:36,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:49:36,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:36,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-18 20:49:36,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:49:36,808 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:49:36,960 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1056 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1056))) (< |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:49:36,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:37,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 16 treesize of output 18 [2022-11-18 20:49:37,016 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-18 20:49:37,016 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:49:37,155 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:49:37,175 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:49:37,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:49:37,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093191955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:37,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:49:37,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-11-18 20:49:37,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437909371] [2022-11-18 20:49:37,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:37,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-18 20:49:37,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:37,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-18 20:49:37,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2022-11-18 20:49:37,179 INFO L87 Difference]: Start difference. First operand 103 states and 111 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:49:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:37,842 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2022-11-18 20:49:37,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-18 20:49:37,843 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:49:37,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:37,844 INFO L225 Difference]: With dead ends: 154 [2022-11-18 20:49:37,844 INFO L226 Difference]: Without dead ends: 154 [2022-11-18 20:49:37,845 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:49:37,846 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 77 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 318 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:37,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 843 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 573 Invalid, 0 Unknown, 318 Unchecked, 0.5s Time] [2022-11-18 20:49:37,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-18 20:49:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 102. [2022-11-18 20:49:37,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 96 states have internal predecessors, (105), 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:49:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2022-11-18 20:49:37,853 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 41 [2022-11-18 20:49:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:37,854 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2022-11-18 20:49:37,855 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:49:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-11-18 20:49:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-18 20:49:37,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:37,858 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:49:37,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:49:38,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-18 20:49:38,066 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:38,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1596801690, now seen corresponding path program 1 times [2022-11-18 20:49:38,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:38,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202874268] [2022-11-18 20:49:38,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:38,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:38,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:49:38,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:38,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:49:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:39,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:49:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:39,650 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:49:39,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:39,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202874268] [2022-11-18 20:49:39,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202874268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:39,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035613400] [2022-11-18 20:49:39,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:39,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:49:39,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:49:39,653 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:49:39,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:49:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:39,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-18 20:49:39,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:49:40,433 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:49:40,439 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:49:40,670 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1215 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1215))) (exists ((v_ArrVal_1211 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1211) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1214 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1214))))) is different from true [2022-11-18 20:49:40,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:40,778 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:49:40,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:40,788 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:49:40,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:40,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-18 20:49:40,811 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:49:40,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-18 20:49:40,900 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:49:40,906 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:49:41,003 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:49:41,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:49:42,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035613400] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:42,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:49:42,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2022-11-18 20:49:42,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760898902] [2022-11-18 20:49:42,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:49:42,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-18 20:49:42,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:42,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-18 20:49:42,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1222, Unknown=2, NotChecked=70, Total=1406 [2022-11-18 20:49:42,300 INFO L87 Difference]: Start difference. First operand 102 states and 111 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:49:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:44,773 INFO L93 Difference]: Finished difference Result 164 states and 178 transitions. [2022-11-18 20:49:44,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-18 20:49:44,776 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:49:44,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:44,778 INFO L225 Difference]: With dead ends: 164 [2022-11-18 20:49:44,778 INFO L226 Difference]: Without dead ends: 164 [2022-11-18 20:49:44,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=232, Invalid=2217, Unknown=5, NotChecked=96, Total=2550 [2022-11-18 20:49:44,780 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 200 mSDsluCounter, 1690 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1808 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:44,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1808 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1205 Invalid, 0 Unknown, 206 Unchecked, 1.3s Time] [2022-11-18 20:49:44,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-18 20:49:44,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 110. [2022-11-18 20:49:44,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.4125) internal successors, (113), 104 states have internal predecessors, (113), 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:49:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2022-11-18 20:49:44,787 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 41 [2022-11-18 20:49:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:44,787 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2022-11-18 20:49:44,787 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:49:44,788 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2022-11-18 20:49:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-18 20:49:44,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:44,789 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:49:44,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:49:44,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:49:44,996 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:44,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:44,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2031121995, now seen corresponding path program 1 times [2022-11-18 20:49:44,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:44,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876979900] [2022-11-18 20:49:44,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:44,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:45,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:49:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:45,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:49:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:45,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:49:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:45,224 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:49:45,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:45,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876979900] [2022-11-18 20:49:45,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876979900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:49:45,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:49:45,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:49:45,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648105223] [2022-11-18 20:49:45,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:49:45,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:49:45,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:45,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:49:45,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:49:45,227 INFO L87 Difference]: Start difference. First operand 110 states and 119 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:49:45,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:45,379 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-11-18 20:49:45,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:49:45,380 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:49:45,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:45,381 INFO L225 Difference]: With dead ends: 127 [2022-11-18 20:49:45,381 INFO L226 Difference]: Without dead ends: 127 [2022-11-18 20:49:45,381 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:49:45,382 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 165 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:45,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 173 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:49:45,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-18 20:49:45,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2022-11-18 20:49:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.4) internal successors, (112), 103 states have internal predecessors, (112), 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:49:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2022-11-18 20:49:45,386 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 42 [2022-11-18 20:49:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:45,386 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2022-11-18 20:49:45,386 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:49:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2022-11-18 20:49:45,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-18 20:49:45,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:45,387 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:49:45,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:49:45,387 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:45,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:45,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1993086700, now seen corresponding path program 1 times [2022-11-18 20:49:45,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:45,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106527182] [2022-11-18 20:49:45,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:45,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:46,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:49:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:46,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:49:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:46,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:49:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:46,529 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:49:46,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:46,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106527182] [2022-11-18 20:49:46,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106527182] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:46,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377994282] [2022-11-18 20:49:46,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:46,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:49:46,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:49:46,532 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:49:46,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:49:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:46,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-18 20:49:46,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:49:47,202 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:49:47,305 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1515 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1515) |c_#memory_$Pointer$.base|))) is different from true [2022-11-18 20:49:47,327 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_1516 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1516))))) is different from true [2022-11-18 20:49:47,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:47,362 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:49:47,438 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:49:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-11-18 20:49:47,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:49:47,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377994282] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:47,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:49:47,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16] total 34 [2022-11-18 20:49:47,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625696619] [2022-11-18 20:49:47,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:49:47,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-18 20:49:47,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:47,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-18 20:49:47,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1018, Unknown=7, NotChecked=130, Total=1260 [2022-11-18 20:49:47,708 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 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:49:48,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:48,992 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2022-11-18 20:49:48,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:49:48,993 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 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 44 [2022-11-18 20:49:48,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:48,994 INFO L225 Difference]: With dead ends: 108 [2022-11-18 20:49:48,994 INFO L226 Difference]: Without dead ends: 108 [2022-11-18 20:49:48,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=186, Invalid=1704, Unknown=10, NotChecked=170, Total=2070 [2022-11-18 20:49:48,996 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 72 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:48,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 928 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 656 Invalid, 0 Unknown, 192 Unchecked, 0.6s Time] [2022-11-18 20:49:48,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-18 20:49:48,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2022-11-18 20:49:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 99 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:49:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2022-11-18 20:49:49,001 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 44 [2022-11-18 20:49:49,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:49,002 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2022-11-18 20:49:49,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.03125) internal successors, (65), 29 states have internal predecessors, (65), 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:49:49,002 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2022-11-18 20:49:49,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-18 20:49:49,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:49,003 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:49:49,016 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:49:49,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 20:49:49,211 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:49,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:49,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1144176968, now seen corresponding path program 1 times [2022-11-18 20:49:49,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:49,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853655777] [2022-11-18 20:49:49,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:49,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:50,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:49:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:50,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:49:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:50,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:49:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:51,311 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:49:51,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:51,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853655777] [2022-11-18 20:49:51,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853655777] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:51,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647272862] [2022-11-18 20:49:51,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:51,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:49:51,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:49:51,314 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:49:51,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 20:49:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:51,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-18 20:49:51,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:49:51,677 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:49:52,101 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:49:52,102 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:49:52,296 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:49:52,527 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:49:52,528 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:49:52,840 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:49:52,841 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 22 [2022-11-18 20:49:52,851 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:49:52,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:49:53,107 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1684 (Array Int Int)) (v_ArrVal_1683 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1683)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1684) |c_#memory_$Pointer$.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-18 20:49:53,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:53,188 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:49:53,190 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 53 treesize of output 51 [2022-11-18 20:49:53,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:49:53,202 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 51 treesize of output 49 [2022-11-18 20:49:53,250 INFO L321 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2022-11-18 20:49:53,250 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 40 treesize of output 60 [2022-11-18 20:49:53,384 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 52 treesize of output 36 [2022-11-18 20:49:53,643 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:49:53,643 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:49:53,783 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:49:53,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:49:54,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647272862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:54,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:49:54,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2022-11-18 20:49:54,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523433345] [2022-11-18 20:49:54,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:49:54,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-18 20:49:54,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:49:54,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-18 20:49:54,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1918, Unknown=1, NotChecked=88, Total=2162 [2022-11-18 20:49:54,034 INFO L87 Difference]: Start difference. First operand 105 states and 113 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:49:55,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:49:55,853 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2022-11-18 20:49:55,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:49:55,854 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:49:55,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:49:55,856 INFO L225 Difference]: With dead ends: 145 [2022-11-18 20:49:55,858 INFO L226 Difference]: Without dead ends: 145 [2022-11-18 20:49:55,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=260, Invalid=2823, Unknown=1, NotChecked=108, Total=3192 [2022-11-18 20:49:55,860 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 86 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:49:55,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1427 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1225 Invalid, 0 Unknown, 312 Unchecked, 1.1s Time] [2022-11-18 20:49:55,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-18 20:49:55,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 125. [2022-11-18 20:49:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 117 states have internal predecessors, (128), 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:49:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2022-11-18 20:49:55,870 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 46 [2022-11-18 20:49:55,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:49:55,870 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2022-11-18 20:49:55,870 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:49:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2022-11-18 20:49:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-18 20:49:55,872 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:49:55,873 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:49:55,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 20:49:56,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 20:49:56,080 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:49:56,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:49:56,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1144176969, now seen corresponding path program 1 times [2022-11-18 20:49:56,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:49:56,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424228738] [2022-11-18 20:49:56,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:56,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:49:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:57,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:49:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:57,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:49:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:57,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:49:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:58,781 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:49:58,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:49:58,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424228738] [2022-11-18 20:49:58,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424228738] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:49:58,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953660493] [2022-11-18 20:49:58,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:49:58,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:49:58,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:49:58,784 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:49:58,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 20:49:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:49:59,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-18 20:49:59,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:49:59,125 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:49:59,583 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:49:59,583 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:49:59,780 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:49:59,796 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:50:00,072 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:50:00,073 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:50:00,080 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:50:00,491 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:50:00,491 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 79 treesize of output 38 [2022-11-18 20:50:00,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-11-18 20:50:00,788 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1858 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1858))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1861 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1861))) (exists ((v_ArrVal_1862 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1862))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-18 20:50:00,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:00,885 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:50:00,885 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 75 [2022-11-18 20:50:00,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:00,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:00,902 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 20:50:00,902 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 83 treesize of output 80 [2022-11-18 20:50:00,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:00,913 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 26 [2022-11-18 20:50:00,943 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-18 20:50:00,944 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 32 treesize of output 34 [2022-11-18 20:50:01,324 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:50:01,324 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 83 treesize of output 42 [2022-11-18 20:50:01,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-11-18 20:50:01,442 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:50:01,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:50:02,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953660493] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:02,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:50:02,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2022-11-18 20:50:02,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81999280] [2022-11-18 20:50:02,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:50:02,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-18 20:50:02,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:02,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-18 20:50:02,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2907, Unknown=2, NotChecked=108, Total=3192 [2022-11-18 20:50:02,178 INFO L87 Difference]: Start difference. First operand 125 states and 138 transitions. Second operand has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 44 states have internal predecessors, (79), 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:50:05,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:05,693 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2022-11-18 20:50:05,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:50:05,694 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 44 states have internal predecessors, (79), 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:50:05,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:05,696 INFO L225 Difference]: With dead ends: 185 [2022-11-18 20:50:05,697 INFO L226 Difference]: Without dead ends: 185 [2022-11-18 20:50:05,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1186 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=312, Invalid=4520, Unknown=2, NotChecked=136, Total=4970 [2022-11-18 20:50:05,701 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 171 mSDsluCounter, 2166 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 2134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 639 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:05,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 2285 Invalid, 2134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1463 Invalid, 0 Unknown, 639 Unchecked, 1.5s Time] [2022-11-18 20:50:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-18 20:50:05,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 124. [2022-11-18 20:50:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 116 states have internal predecessors, (126), 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:50:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2022-11-18 20:50:05,729 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 46 [2022-11-18 20:50:05,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:05,729 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2022-11-18 20:50:05,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 44 states have internal predecessors, (79), 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:50:05,730 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2022-11-18 20:50:05,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 20:50:05,731 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:05,731 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:50:05,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 20:50:05,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-18 20:50:05,939 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:50:05,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:05,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1589162821, now seen corresponding path program 2 times [2022-11-18 20:50:05,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:05,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171536366] [2022-11-18 20:50:05,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:05,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:50:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:50:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:07,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:50:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:08,375 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:50:08,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:08,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171536366] [2022-11-18 20:50:08,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171536366] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:08,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255680996] [2022-11-18 20:50:08,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:50:08,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:08,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:08,377 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:08,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 20:50:08,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:50:08,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:50:08,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-18 20:50:08,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:08,742 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:50:09,255 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 20:50:09,256 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:50:09,479 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:50:09,496 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:50:09,794 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-18 20:50:09,794 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:50:09,812 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:50:10,197 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-18 20:50:10,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 39 [2022-11-18 20:50:10,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2022-11-18 20:50:10,430 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2039 (Array Int Int)) (v_ArrVal_2040 (Array Int 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_2039) |c_#memory_$Pointer$.base|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2040) |c_#memory_$Pointer$.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-18 20:50:10,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:10,524 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-11-18 20:50:10,525 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 91 treesize of output 85 [2022-11-18 20:50:10,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:10,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:10,544 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 20:50:10,544 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 89 treesize of output 86 [2022-11-18 20:50:10,599 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-11-18 20:50:10,599 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 32 treesize of output 34 [2022-11-18 20:50:11,249 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-18 20:50:11,250 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 96 treesize of output 59 [2022-11-18 20:50:11,548 INFO L321 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-11-18 20:50:11,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 26 [2022-11-18 20:50:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-18 20:50:11,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:50:12,024 INFO L321 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-11-18 20:50:12,025 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:50:12,459 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_50| Int) (v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2047 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_50| v_ArrVal_2048)) (.cse2 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_50| v_ArrVal_2047))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select .cse4 .cse3) .cse1))) (or (not (< |v_node_create_~temp~0#1.base_50| |c_#StackHeapBarrier|)) (not (<= 0 .cse0)) (not (<= 0 .cse1)) (= (select (select .cse2 (select (select .cse2 .cse3) .cse1)) .cse0) .cse3) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_50|) 0))))))) is different from false [2022-11-18 20:50:12,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255680996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:12,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:50:12,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 54 [2022-11-18 20:50:12,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020730982] [2022-11-18 20:50:12,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:50:12,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-18 20:50:12,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:12,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-18 20:50:12,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3342, Unknown=2, NotChecked=234, Total=3782 [2022-11-18 20:50:12,468 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 54 states, 50 states have (on average 1.74) internal successors, (87), 47 states have internal predecessors, (87), 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:50:16,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:16,729 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2022-11-18 20:50:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 20:50:16,730 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 50 states have (on average 1.74) internal successors, (87), 47 states have internal predecessors, (87), 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:50:16,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:16,731 INFO L225 Difference]: With dead ends: 185 [2022-11-18 20:50:16,731 INFO L226 Difference]: Without dead ends: 185 [2022-11-18 20:50:16,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 74 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1458 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=411, Invalid=4997, Unknown=2, NotChecked=290, Total=5700 [2022-11-18 20:50:16,735 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 327 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 462 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:16,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1732 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1489 Invalid, 0 Unknown, 462 Unchecked, 1.5s Time] [2022-11-18 20:50:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-18 20:50:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 127. [2022-11-18 20:50:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 98 states have (on average 1.316326530612245) internal successors, (129), 119 states have internal predecessors, (129), 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:50:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2022-11-18 20:50:16,740 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 51 [2022-11-18 20:50:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:16,741 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2022-11-18 20:50:16,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 50 states have (on average 1.74) internal successors, (87), 47 states have internal predecessors, (87), 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:50:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2022-11-18 20:50:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-18 20:50:16,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:16,742 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] [2022-11-18 20:50:16,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-18 20:50:16,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-18 20:50:16,949 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:50:16,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:16,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1862680377, now seen corresponding path program 1 times [2022-11-18 20:50:16,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:16,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322343309] [2022-11-18 20:50:16,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:16,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:17,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:50:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:17,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:50:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:17,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:50:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:18,219 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:50:18,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:18,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322343309] [2022-11-18 20:50:18,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322343309] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:18,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373238128] [2022-11-18 20:50:18,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:18,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:18,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:18,223 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:18,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 20:50:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:18,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-18 20:50:18,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:18,666 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:50:18,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:50:19,034 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-18 20:50:19,034 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 25 treesize of output 20 [2022-11-18 20:50:19,122 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:50:19,127 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:50:19,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:50:19,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373238128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:19,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:50:19,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [21] total 29 [2022-11-18 20:50:19,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360716437] [2022-11-18 20:50:19,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:19,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:50:19,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:19,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:50:19,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2022-11-18 20:50:19,132 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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:50:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:19,474 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2022-11-18 20:50:19,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:50:19,475 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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 52 [2022-11-18 20:50:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:19,476 INFO L225 Difference]: With dead ends: 146 [2022-11-18 20:50:19,476 INFO L226 Difference]: Without dead ends: 146 [2022-11-18 20:50:19,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2022-11-18 20:50:19,477 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 291 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:19,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 347 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:50:19,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-18 20:50:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 126. [2022-11-18 20:50:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 118 states have internal predecessors, (128), 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:50:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2022-11-18 20:50:19,483 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 52 [2022-11-18 20:50:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:19,484 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2022-11-18 20:50:19,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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:50:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2022-11-18 20:50:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-18 20:50:19,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:19,485 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] [2022-11-18 20:50:19,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 20:50:19,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:19,686 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:50:19,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:19,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1862680376, now seen corresponding path program 1 times [2022-11-18 20:50:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:19,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678438297] [2022-11-18 20:50:19,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:19,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:21,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:50:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:21,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:50:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:21,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:50:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 20:50:21,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:21,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678438297] [2022-11-18 20:50:21,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678438297] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:21,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902055315] [2022-11-18 20:50:21,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:21,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:21,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:21,445 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:21,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 20:50:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:21,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-18 20:50:21,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:21,884 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:50:22,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:50:22,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:50:22,361 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-18 20:50:22,361 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 25 treesize of output 20 [2022-11-18 20:50:22,385 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-18 20:50:22,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-11-18 20:50:22,527 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 20:50:22,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2022-11-18 20:50:22,536 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-18 20:50:22,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-11-18 20:50:22,621 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:50:22,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:50:22,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902055315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:22,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:50:22,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [21] total 31 [2022-11-18 20:50:22,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303106870] [2022-11-18 20:50:22,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:22,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:50:22,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:22,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:50:22,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=911, Unknown=0, NotChecked=0, Total=992 [2022-11-18 20:50:22,624 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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:50:23,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:23,011 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-11-18 20:50:23,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 20:50:23,012 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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 52 [2022-11-18 20:50:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:23,013 INFO L225 Difference]: With dead ends: 126 [2022-11-18 20:50:23,013 INFO L226 Difference]: Without dead ends: 126 [2022-11-18 20:50:23,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2022-11-18 20:50:23,014 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 145 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:23,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 358 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 264 Invalid, 0 Unknown, 18 Unchecked, 0.2s Time] [2022-11-18 20:50:23,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-18 20:50:23,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2022-11-18 20:50:23,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 98 states have (on average 1.2857142857142858) internal successors, (126), 116 states have internal predecessors, (126), 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:50:23,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2022-11-18 20:50:23,021 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 52 [2022-11-18 20:50:23,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:23,021 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2022-11-18 20:50:23,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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:50:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2022-11-18 20:50:23,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-18 20:50:23,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:23,023 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, 1] [2022-11-18 20:50:23,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 20:50:23,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:23,231 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:50:23,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:23,232 INFO L85 PathProgramCache]: Analyzing trace with hash 965522297, now seen corresponding path program 1 times [2022-11-18 20:50:23,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:23,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718278498] [2022-11-18 20:50:23,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:23,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:24,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:50:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:24,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:50:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:24,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:50:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:24,939 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:50:24,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:24,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718278498] [2022-11-18 20:50:24,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718278498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:24,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084124356] [2022-11-18 20:50:24,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:24,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:24,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:24,941 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:24,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 20:50:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:25,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-18 20:50:25,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:25,279 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:50:25,576 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:50:25,576 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:50:25,732 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:50:25,898 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:50:25,898 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:50:26,146 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:50:26,146 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 30 treesize of output 17 [2022-11-18 20:50:26,155 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:50:26,162 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:50:26,316 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2640 (Array Int Int)) (v_ArrVal_2639 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2640) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2639) |c_#memory_$Pointer$.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-11-18 20:50:26,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:26,379 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-18 20:50:26,379 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 36 treesize of output 40 [2022-11-18 20:50:26,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:26,388 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 34 [2022-11-18 20:50:26,403 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:50:26,404 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:50:26,477 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 35 treesize of output 23 [2022-11-18 20:50:26,662 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:50:26,662 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 35 treesize of output 18 [2022-11-18 20:50:26,700 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-18 20:50:26,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:50:27,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084124356] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:27,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:50:27,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 46 [2022-11-18 20:50:27,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388542732] [2022-11-18 20:50:27,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:50:27,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-18 20:50:27,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:27,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-18 20:50:27,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2290, Unknown=1, NotChecked=96, Total=2550 [2022-11-18 20:50:27,057 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 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:50:29,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:29,440 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2022-11-18 20:50:29,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 20:50:29,440 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 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 54 [2022-11-18 20:50:29,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:29,442 INFO L225 Difference]: With dead ends: 127 [2022-11-18 20:50:29,442 INFO L226 Difference]: Without dead ends: 127 [2022-11-18 20:50:29,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=320, Invalid=3715, Unknown=1, NotChecked=124, Total=4160 [2022-11-18 20:50:29,444 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 254 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:29,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1583 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1493 Invalid, 0 Unknown, 96 Unchecked, 1.3s Time] [2022-11-18 20:50:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-18 20:50:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-11-18 20:50:29,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 98 states have (on average 1.2755102040816326) internal successors, (125), 116 states have internal predecessors, (125), 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:50:29,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2022-11-18 20:50:29,451 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 54 [2022-11-18 20:50:29,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:29,451 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2022-11-18 20:50:29,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.880952380952381) internal successors, (79), 39 states have internal predecessors, (79), 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:50:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2022-11-18 20:50:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-18 20:50:29,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:29,453 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:50:29,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-18 20:50:29,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-18 20:50:29,660 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:50:29,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:29,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2042113126, now seen corresponding path program 3 times [2022-11-18 20:50:29,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:29,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654729812] [2022-11-18 20:50:29,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:29,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:29,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:50:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:29,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:50:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:29,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-18 20:50:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:29,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-18 20:50:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:29,818 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:50:29,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:29,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654729812] [2022-11-18 20:50:29,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654729812] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:29,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893166897] [2022-11-18 20:50:29,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:50:29,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:29,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:29,821 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:29,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-18 20:50:30,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-18 20:50:30,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:50:30,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 20:50:30,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:30,292 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:50:30,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 20:50:30,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893166897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:50:30,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 20:50:30,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-18 20:50:30,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340964271] [2022-11-18 20:50:30,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:50:30,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:50:30,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:50:30,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:50:30,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:50:30,294 INFO L87 Difference]: Start difference. First operand 124 states and 135 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:50:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:50:30,319 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2022-11-18 20:50:30,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:50:30,320 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:50:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:50:30,324 INFO L225 Difference]: With dead ends: 92 [2022-11-18 20:50:30,324 INFO L226 Difference]: Without dead ends: 92 [2022-11-18 20:50:30,324 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:50:30,325 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:50:30,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 99 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 20:50:30,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-18 20:50:30,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-18 20:50:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 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:50:30,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-11-18 20:50:30,330 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 58 [2022-11-18 20:50:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:50:30,331 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-11-18 20:50:30,331 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:50:30,331 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-11-18 20:50:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 20:50:30,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:50:30,332 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] [2022-11-18 20:50:30,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-18 20:50:30,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-18 20:50:30,540 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:50:30,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:50:30,541 INFO L85 PathProgramCache]: Analyzing trace with hash -214738826, now seen corresponding path program 1 times [2022-11-18 20:50:30,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:50:30,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283324661] [2022-11-18 20:50:30,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:30,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:50:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:32,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:50:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:33,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:50:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:33,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:50:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:34,288 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:50:34,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:50:34,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283324661] [2022-11-18 20:50:34,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283324661] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:50:34,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771915059] [2022-11-18 20:50:34,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:50:34,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:50:34,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:50:34,291 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:50:34,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-18 20:50:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:50:34,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 174 conjunts are in the unsatisfiable core [2022-11-18 20:50:34,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:50:34,747 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:50:35,115 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:50:35,287 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:50:35,287 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:50:35,520 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:50:35,528 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:50:35,836 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:50:35,836 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:50:35,843 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:50:36,298 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 20:50:36,298 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 48 treesize of output 27 [2022-11-18 20:50:36,306 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:50:36,312 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:50:36,614 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:50:36,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:36,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:36,999 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-18 20:50:37,000 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 66 treesize of output 55 [2022-11-18 20:50:37,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:37,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:37,033 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-18 20:50:37,033 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 25 treesize of output 38 [2022-11-18 20:50:37,069 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-18 20:50:37,070 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:50:38,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:38,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:38,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:50:38,667 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 20:50:38,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 49 treesize of output 27 [2022-11-18 20:50:39,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:39,259 INFO L321 Elim1Store]: treesize reduction 57, result has 21.9 percent of original size [2022-11-18 20:50:39,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 78 treesize of output 51 [2022-11-18 20:50:39,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:39,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 20:50:39,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:50:39,721 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:50:39,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:39,731 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 18 treesize of output 20 [2022-11-18 20:50:39,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:39,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-18 20:50:39,871 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:50:39,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:50:39,879 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:50:40,039 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 28 treesize of output 16 [2022-11-18 20:50:40,046 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:50:40,098 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:50:40,101 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:50:40,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:50:40,431 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3070 (Array Int Int)) (v_ArrVal_3071 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3071) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3070) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-18 20:50:40,452 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:50:40,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-11-18 20:50:40,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:50:40,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 87 [2022-11-18 20:50:40,487 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:50:40,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 64 [2022-11-18 20:50:40,508 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:50:40,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 113 [2022-11-18 20:50:40,516 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 98 treesize of output 94 [2022-11-18 20:50:40,525 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 48 treesize of output 44 [2022-11-18 20:50:41,635 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse24 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse47 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_152) (+ v_arrayElimCell_151 4))))) (.cse25 (not .cse24))) (let ((.cse15 (or .cse25 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse66 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069)) (.cse67 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse66 v_arrayElimCell_152) .cse67)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse66 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse67))))))) (.cse2 (or .cse25 (and (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse65 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse65 (+ v_arrayElimCell_151 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse65 (+ v_arrayElimCell_150 4)))))) .cse47))) (.cse6 (or .cse24 (forall ((v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_148) (+ v_arrayElimCell_150 4)))))) (.cse7 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (let ((.cse62 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse63 (+ v_arrayElimCell_151 4)) (.cse64 (select .cse62 v_arrayElimCell_148))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse62 v_arrayElimCell_152) .cse63)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse64 .cse63)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse64 (+ v_arrayElimCell_150 4)))))))) (.cse9 (or .cse25 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (let ((.cse61 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse60 (+ v_arrayElimCell_151 4)) (.cse59 (select .cse61 v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse59 .cse60)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse61 v_arrayElimCell_148) .cse60)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse59 (+ v_arrayElimCell_150 4))))))))) (.cse11 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (let ((.cse58 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse55 (+ v_arrayElimCell_151 4)) (.cse56 (select .cse58 v_arrayElimCell_148)) (.cse54 (select .cse58 v_arrayElimCell_152)) (.cse57 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse54 .cse55)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse56 .cse55)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse56 .cse57)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse54 .cse57))))))) (.cse12 (or (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (let ((.cse52 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069)) (.cse53 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse52 v_arrayElimCell_152) .cse53)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse52 v_arrayElimCell_148) .cse53))))) .cse25)) (.cse17 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (let ((.cse3 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (or (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (let ((.cse51 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse49 (select .cse51 v_arrayElimCell_152)) (.cse50 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse49 .cse50)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse49 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse51 v_arrayElimCell_148) .cse50)))))) .cse25)) (.cse1 (or (and .cse47 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse48 (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse48 (+ v_arrayElimCell_151 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse48 .cse17)))))) .cse25)) (.cse5 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (let ((.cse46 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse43 (select .cse46 v_arrayElimCell_152)) (.cse44 (+ v_arrayElimCell_151 4)) (.cse45 (select .cse46 v_arrayElimCell_148))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse43 .cse44)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse43 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 .cse44)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 .cse17))))))) (.cse8 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse41 (+ v_arrayElimCell_151 4)) (.cse42 (select .cse40 v_arrayElimCell_148))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse40 v_arrayElimCell_152) .cse41)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse42 .cse41)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse42 .cse17))))))) (.cse4 (and .cse2 .cse6 .cse7 .cse9 .cse11 .cse12)) (.cse10 (or .cse24 (forall ((v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_148) .cse17))))) (.cse13 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse14 (and (or .cse25 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse30 (+ v_arrayElimCell_151 4)) (.cse29 (select .cse31 v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 .cse30)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse31 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse30)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 (+ v_arrayElimCell_150 4)))))))) (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse32 (select .cse36 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse35 (+ v_arrayElimCell_151 4)) (.cse34 (select .cse36 v_arrayElimCell_152)) (.cse33 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 .cse33)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 .cse35)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 .cse35)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 .cse33)))))) .cse2 .cse15 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse38 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse37 (select .cse38 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse39 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 (+ v_arrayElimCell_150 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse38 v_arrayElimCell_152) .cse39)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse37 .cse39)))))) (or .cse24 (forall ((v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_150 4)))))))) (and (or (and .cse0 .cse1 .cse2 (or .cse3 .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) .cse1 (or .cse14 .cse3) .cse15 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse19 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse18 v_arrayElimCell_152) .cse19)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse19)))))) (or .cse3 (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 (or .cse13 .cse4) .cse10 .cse11 .cse12)) (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse20 (select .cse23 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse22 (+ v_arrayElimCell_151 4)) (.cse21 (select .cse23 v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 .cse22)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 .cse22)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 .cse17)))))) (or .cse24 (forall ((v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse17)))) (or .cse13 .cse14) (or .cse25 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse27 (+ v_arrayElimCell_151 4)) (.cse26 (select .cse28 v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 .cse27)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse28 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse27)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 .cse17)))))))))))) is different from false [2022-11-18 20:50:43,882 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse25 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse18 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse30 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_152) (+ v_arrayElimCell_151 4))))) (.cse23 (not .cse25))) (let ((.cse0 (or .cse23 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (let ((.cse67 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069)) (.cse68 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse67 v_arrayElimCell_152) .cse68)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse67 v_arrayElimCell_148) .cse68))))))) (.cse2 (or .cse23 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (let ((.cse66 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse65 (+ v_arrayElimCell_151 4)) (.cse64 (select .cse66 v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse64 .cse65)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse66 v_arrayElimCell_148) .cse65)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse64 (+ v_arrayElimCell_150 4))))))))) (.cse4 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (let ((.cse63 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse60 (+ v_arrayElimCell_151 4)) (.cse61 (select .cse63 v_arrayElimCell_148)) (.cse59 (select .cse63 v_arrayElimCell_152)) (.cse62 (+ v_arrayElimCell_150 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse59 .cse60)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse61 .cse60)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse61 .cse62)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse59 .cse62))))))) (.cse8 (or .cse25 (forall ((v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_148) (+ v_arrayElimCell_150 4)))))) (.cse11 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (let ((.cse56 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse57 (+ v_arrayElimCell_151 4)) (.cse58 (select .cse56 v_arrayElimCell_148))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse56 v_arrayElimCell_152) .cse57)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse58 .cse57)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse58 (+ v_arrayElimCell_150 4)))))))) (.cse17 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse24 (or .cse23 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse54 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069)) (.cse55 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse54 v_arrayElimCell_152) .cse55)) (= (select (select .cse54 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse55) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (.cse12 (or (and (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse53 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse53 (+ v_arrayElimCell_151 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse53 (+ v_arrayElimCell_150 4)))))) .cse30) .cse23))) (let ((.cse19 (and (or .cse23 (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse44 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse42 (select .cse44 v_arrayElimCell_152)) (.cse43 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse42 .cse43)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse42 (+ v_arrayElimCell_150 4))) (= (select (select .cse44 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse43) |c_ULTIMATE.start_main_~uneq~0#1|)))))) (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse49 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse45 (select .cse49 v_arrayElimCell_152)) (.cse48 (+ v_arrayElimCell_150 4)) (.cse47 (select .cse49 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse46 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 .cse46)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse47 .cse48)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse45 .cse48)) (= (select .cse47 .cse46) |c_ULTIMATE.start_main_~uneq~0#1|))))) (forall ((v_arrayElimCell_151 Int) (v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse50 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse52 (select .cse50 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse51 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse50 v_arrayElimCell_152) .cse51)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse52 (+ v_arrayElimCell_150 4))) (= (select .cse52 .cse51) |c_ULTIMATE.start_main_~uneq~0#1|))))) .cse24 (or .cse25 (forall ((v_arrayElimCell_150 Int) (v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ v_arrayElimCell_150 4))))) .cse12)) (.cse1 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse41 (select .cse39 v_arrayElimCell_148)) (.cse40 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse39 v_arrayElimCell_152) .cse40)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse41 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse41 .cse40))))))) (.cse3 (or (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (let ((.cse38 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse36 (select .cse38 v_arrayElimCell_152)) (.cse37 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse36 .cse37)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse36 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse38 v_arrayElimCell_148) .cse37)))))) .cse23)) (.cse9 (and .cse0 .cse2 .cse4 .cse8 .cse11 .cse12)) (.cse13 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (let ((.cse35 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse32 (select .cse35 v_arrayElimCell_152)) (.cse34 (select .cse35 v_arrayElimCell_148)) (.cse33 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 .cse33)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse32 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse34 .cse33))))))) (.cse6 (or (and .cse30 (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse31 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_152))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 (+ v_arrayElimCell_151 4))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 .cse17)))))) .cse23)) (.cse7 (or .cse25 (forall ((v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (v_arrayElimCell_148 Int) (v_ArrVal_3063 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) v_arrayElimCell_148) .cse17))))) (.cse10 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or .cse9 .cse10) .cse11 .cse12) .cse13) (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse16 (select .cse14 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse15 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse14 v_arrayElimCell_152) .cse15)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse16 .cse17)) (= (select .cse16 .cse15) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or .cse10 .cse19) (or (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse20 (select .cse22 v_arrayElimCell_152)) (.cse21 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 .cse21)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 .cse17)) (= (select (select .cse22 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse21) |c_ULTIMATE.start_main_~uneq~0#1|))))) .cse23) (or .cse13 .cse19) .cse24 .cse6 (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (or .cse9 .cse13) .cse5 .cse6 .cse7 .cse8 .cse11 .cse12) .cse10) (or .cse25 (forall ((v_ArrVal_3068 (Array Int Int)) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse17)))) (forall ((v_arrayElimCell_151 Int) (v_ArrVal_3068 (Array Int Int)) (v_arrayElimCell_152 Int) (v_ArrVal_3069 (Array Int Int)) (v_ArrVal_3063 Int)) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store .cse18 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_3063)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_3068) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_3069))) (let ((.cse26 (select .cse29 v_arrayElimCell_152)) (.cse28 (select .cse29 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse27 (+ v_arrayElimCell_151 4))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 .cse27)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 .cse17)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 .cse17)) (= (select .cse28 .cse27) |c_ULTIMATE.start_main_~uneq~0#1|)))))))))) is different from false [2022-11-18 20:51:56,746 WARN L233 SmtUtils]: Spent 58.54s on a formula simplification. DAG size of input: 117 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:52:08,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:52:08,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 549 treesize of output 537 [2022-11-18 20:52:08,957 INFO L321 Elim1Store]: treesize reduction 35, result has 36.4 percent of original size [2022-11-18 20:52:08,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 787 treesize of output 791 [2022-11-18 20:52:08,977 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 756 treesize of output 748 [2022-11-18 20:52:08,996 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 748 treesize of output 732 [2022-11-18 20:52:09,110 INFO L321 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2022-11-18 20:52:09,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1364 treesize of output 1381 [2022-11-18 20:52:09,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:52:09,158 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 1327 treesize of output 1308 [2022-11-18 20:52:09,205 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:52:09,206 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 1299 treesize of output 1294 [2022-11-18 20:52:09,309 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:52:09,310 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 1924 treesize of output 1958 [2022-11-18 20:52:09,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:52:09,381 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 1885 treesize of output 1870 [2022-11-18 20:52:09,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:52:09,457 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 1861 treesize of output 1858 [2022-11-18 20:52:10,096 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 6 treesize of output 4 [2022-11-18 20:52:13,863 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:52:13,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 7 treesize of output 3 [2022-11-18 20:52:17,875 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:52:17,875 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 197 treesize of output 199 [2022-11-18 20:52:18,113 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:52:18,113 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 197 treesize of output 1 [2022-11-18 20:52:18,554 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:52:18,555 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 371 treesize of output 371 [2022-11-18 20:52:19,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:52:19,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 566 treesize of output 708 [2022-11-18 20:52:20,004 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 6 treesize of output 4 [2022-11-18 20:52:23,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771915059] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:52:23,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-18 20:52:23,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 38] total 65 [2022-11-18 20:52:23,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543087745] [2022-11-18 20:52:23,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-18 20:52:23,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-18 20:52:23,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:52:23,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-18 20:52:23,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=5910, Unknown=9, NotChecked=468, Total=6642 [2022-11-18 20:52:23,020 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 65 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 56 states have internal predecessors, (99), 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:52:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:52:31,659 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-11-18 20:52:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-18 20:52:31,660 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 56 states have internal predecessors, (99), 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 59 [2022-11-18 20:52:31,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:52:31,661 INFO L225 Difference]: With dead ends: 92 [2022-11-18 20:52:31,661 INFO L226 Difference]: Without dead ends: 92 [2022-11-18 20:52:31,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2230 ImplicationChecksByTransitivity, 95.9s TimeCoverageRelationStatistics Valid=602, Invalid=10957, Unknown=9, NotChecked=642, Total=12210 [2022-11-18 20:52:31,665 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 338 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-18 20:52:31,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1563 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1889 Invalid, 0 Unknown, 10 Unchecked, 2.0s Time] [2022-11-18 20:52:31,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-18 20:52:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-18 20:52:31,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.25) internal successors, (90), 86 states have internal predecessors, (90), 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:52:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-11-18 20:52:31,672 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 59 [2022-11-18 20:52:31,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:52:31,673 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-11-18 20:52:31,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 56 states have internal predecessors, (99), 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:52:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-11-18 20:52:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-18 20:52:31,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:52:31,674 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] [2022-11-18 20:52:31,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-18 20:52:31,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:52:31,875 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-11-18 20:52:31,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:52:31,876 INFO L85 PathProgramCache]: Analyzing trace with hash -205595639, now seen corresponding path program 1 times [2022-11-18 20:52:31,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:52:31,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149604650] [2022-11-18 20:52:31,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:31,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:52:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:34,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-18 20:52:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:34,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-18 20:52:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:34,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-18 20:52:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:35,437 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:52:35,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:52:35,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149604650] [2022-11-18 20:52:35,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149604650] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:52:35,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112294328] [2022-11-18 20:52:35,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:52:35,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:52:35,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:52:35,443 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:52:35,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aa02c95c-4883-4fb1-8eae-3af1ddcadee3/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-18 20:52:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:52:35,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-18 20:52:35,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:52:35,840 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:52:35,933 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:52:36,002 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_3275 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_3275))))) is different from true [2022-11-18 20:52:36,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:52:36,060 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:52:36,088 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:52:36,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:52:36,351 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:52:36,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-18 20:52:36,939 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:52:37,052 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:52:37,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:52:37,721 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:52:37,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:52:37,736 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:52:38,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:52:38,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2022-11-18 20:52:39,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:52:39,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-11-18 20:52:39,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:52:39,503 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 20 [2022-11-18 20:52:39,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:52:39,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-11-18 20:52:39,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:52:40,021 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-11-18 20:52:40,022 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 51 treesize of output 56 [2022-11-18 20:52:40,047 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-18 20:52:40,047 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 54 treesize of output 41 [2022-11-18 20:52:40,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:52:40,523 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 20:52:40,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 23 [2022-11-18 20:52:40,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:52:40,931 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-11-18 20:52:40,931 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 54 treesize of output 33 [2022-11-18 20:52:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-18 20:52:40,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:52:41,157 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 302 treesize of output 298 [2022-11-18 20:52:43,202 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= (select |c_#valid| (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) 1))) (or (and (let ((.cse1 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (and .cse0 .cse1 .cse2) (and (forall ((v_arrayElimCell_212 Int)) (= (select |c_#valid| (select .cse3 v_arrayElimCell_212)) 1)) (or (not .cse1) (not .cse0))))) (or (not .cse4) (not .cse5))) (and .cse4 .cse5 .cse2)))) is different from false [2022-11-18 20:53:05,041 WARN L233 SmtUtils]: Spent 8.88s on a formula simplification. DAG size of input: 61 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:53:23,776 WARN L233 SmtUtils]: Spent 14.26s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:53:38,857 WARN L233 SmtUtils]: Spent 14.34s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-18 20:53:51,725 INFO L321 Elim1Store]: treesize reduction 880, result has 48.7 percent of original size [2022-11-18 20:53:51,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 21 new quantified variables, introduced 171 case distinctions, treesize of input 89351 treesize of output 75992