./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R --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 f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 --- 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-38b53e6 [2022-11-25 17:34:16,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:34:16,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:34:16,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:34:16,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:34:16,158 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:34:16,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:34:16,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:34:16,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:34:16,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:34:16,174 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:34:16,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:34:16,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:34:16,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:34:16,182 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:34:16,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:34:16,185 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:34:16,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:34:16,188 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:34:16,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:34:16,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:34:16,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:34:16,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:34:16,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:34:16,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:34:16,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:34:16,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:34:16,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:34:16,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:34:16,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:34:16,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:34:16,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:34:16,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:34:16,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:34:16,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:34:16,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:34:16,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:34:16,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:34:16,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:34:16,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:34:16,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:34:16,230 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:34:16,274 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:34:16,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:34:16,276 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:34:16,276 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:34:16,277 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:34:16,277 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:34:16,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:34:16,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:34:16,279 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:34:16,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:34:16,280 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:34:16,281 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:34:16,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:34:16,281 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:34:16,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:34:16,282 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:34:16,282 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:34:16,282 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:34:16,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:34:16,283 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:34:16,283 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:34:16,283 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:34:16,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:34:16,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:34:16,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:34:16,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:34:16,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:34:16,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:34:16,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:34:16,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:34:16,286 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:34:16,286 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:34:16,286 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:34:16,287 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/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_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R 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 -> f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 [2022-11-25 17:34:16,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:34:16,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:34:16,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:34:16,650 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:34:16,651 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:34:16,652 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2022-11-25 17:34:19,710 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:34:19,957 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:34:19,958 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2022-11-25 17:34:19,973 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/data/034740558/602a9d8e1eba41fd94197e18f3ece896/FLAG5d87e4235 [2022-11-25 17:34:19,989 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/data/034740558/602a9d8e1eba41fd94197e18f3ece896 [2022-11-25 17:34:19,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:34:19,994 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:34:19,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:34:19,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:34:20,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:34:20,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:34:19" (1/1) ... [2022-11-25 17:34:20,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740ef17c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:20, skipping insertion in model container [2022-11-25 17:34:20,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:34:19" (1/1) ... [2022-11-25 17:34:20,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:34:20,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:34:20,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:34:20,443 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:34:20,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:34:20,547 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:34:20,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:20 WrapperNode [2022-11-25 17:34:20,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:34:20,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:34:20,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:34:20,552 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:34:20,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:20" (1/1) ... [2022-11-25 17:34:20,593 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:20" (1/1) ... [2022-11-25 17:34:20,626 INFO L138 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2022-11-25 17:34:20,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:34:20,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:34:20,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:34:20,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:34:20,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:20" (1/1) ... [2022-11-25 17:34:20,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:20" (1/1) ... [2022-11-25 17:34:20,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:20" (1/1) ... [2022-11-25 17:34:20,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:20" (1/1) ... [2022-11-25 17:34:20,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:20" (1/1) ... [2022-11-25 17:34:20,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:20" (1/1) ... [2022-11-25 17:34:20,663 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:20" (1/1) ... [2022-11-25 17:34:20,665 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:20" (1/1) ... [2022-11-25 17:34:20,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:34:20,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:34:20,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:34:20,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:34:20,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:20" (1/1) ... [2022-11-25 17:34:20,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:34:20,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:34:20,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:34:20,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:34:20,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 17:34:20,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:34:20,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:34:20,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 17:34:20,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 17:34:20,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:34:20,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 17:34:20,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:34:20,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:34:20,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:34:20,900 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:34:20,903 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:34:21,348 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:34:21,355 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:34:21,355 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 17:34:21,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:34:21 BoogieIcfgContainer [2022-11-25 17:34:21,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:34:21,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:34:21,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:34:21,370 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:34:21,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:34:19" (1/3) ... [2022-11-25 17:34:21,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15eaaed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:34:21, skipping insertion in model container [2022-11-25 17:34:21,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:34:20" (2/3) ... [2022-11-25 17:34:21,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15eaaed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:34:21, skipping insertion in model container [2022-11-25 17:34:21,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:34:21" (3/3) ... [2022-11-25 17:34:21,376 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1-2.i [2022-11-25 17:34:21,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:34:21,398 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2022-11-25 17:34:21,467 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:34:21,476 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7b26723a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:34:21,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2022-11-25 17:34:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 45 states have (on average 2.111111111111111) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:21,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 17:34:21,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:21,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 17:34:21,491 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:21,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:21,499 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-11-25 17:34:21,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:21,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232117715] [2022-11-25 17:34:21,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:21,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:21,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:22,025 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-25 17:34:22,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:22,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232117715] [2022-11-25 17:34:22,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232117715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:22,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:22,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:34:22,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962152503] [2022-11-25 17:34:22,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:22,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:34:22,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:22,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:34:22,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:34:22,066 INFO L87 Difference]: Start difference. First operand has 90 states, 45 states have (on average 2.111111111111111) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:22,262 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-11-25 17:34:22,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:34:22,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 17:34:22,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:22,273 INFO L225 Difference]: With dead ends: 101 [2022-11-25 17:34:22,274 INFO L226 Difference]: Without dead ends: 99 [2022-11-25 17:34:22,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:34:22,279 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:22,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 69 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:34:22,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-25 17:34:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2022-11-25 17:34:22,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 44 states have (on average 1.9318181818181819) internal successors, (85), 81 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2022-11-25 17:34:22,318 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 4 [2022-11-25 17:34:22,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:22,318 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2022-11-25 17:34:22,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:22,319 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2022-11-25 17:34:22,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 17:34:22,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:22,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 17:34:22,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:34:22,320 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:22,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:22,321 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-11-25 17:34:22,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:22,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673432284] [2022-11-25 17:34:22,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:22,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:22,495 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-25 17:34:22,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:22,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673432284] [2022-11-25 17:34:22,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673432284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:22,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:22,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:34:22,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596248167] [2022-11-25 17:34:22,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:22,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:34:22,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:22,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:34:22,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:34:22,499 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:22,676 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-11-25 17:34:22,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:34:22,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 17:34:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:22,679 INFO L225 Difference]: With dead ends: 93 [2022-11-25 17:34:22,680 INFO L226 Difference]: Without dead ends: 93 [2022-11-25 17:34:22,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:34:22,686 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 146 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:22,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 49 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:34:22,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-25 17:34:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2022-11-25 17:34:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.816326530612245) internal successors, (89), 82 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-11-25 17:34:22,706 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 4 [2022-11-25 17:34:22,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:22,707 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-11-25 17:34:22,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-11-25 17:34:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 17:34:22,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:22,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:34:22,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:34:22,711 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:22,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:22,713 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2022-11-25 17:34:22,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:22,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616937194] [2022-11-25 17:34:22,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:22,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:22,787 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-25 17:34:22,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:22,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616937194] [2022-11-25 17:34:22,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616937194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:22,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:22,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:34:22,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450753564] [2022-11-25 17:34:22,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:22,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:34:22,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:22,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:34:22,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:34:22,795 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:22,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:22,879 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-11-25 17:34:22,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:34:22,880 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 17:34:22,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:22,884 INFO L225 Difference]: With dead ends: 89 [2022-11-25 17:34:22,884 INFO L226 Difference]: Without dead ends: 89 [2022-11-25 17:34:22,885 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-25 17:34:22,893 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 49 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:22,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 68 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:34:22,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-25 17:34:22,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2022-11-25 17:34:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 78 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-11-25 17:34:22,904 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 5 [2022-11-25 17:34:22,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:22,904 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-11-25 17:34:22,904 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:22,904 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-11-25 17:34:22,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 17:34:22,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:22,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:34:22,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:34:22,905 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:22,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:22,906 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2022-11-25 17:34:22,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:22,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47560713] [2022-11-25 17:34:22,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:22,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:23,014 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-25 17:34:23,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:23,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47560713] [2022-11-25 17:34:23,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47560713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:23,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:23,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:34:23,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145541792] [2022-11-25 17:34:23,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:23,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:34:23,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:23,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:34:23,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:34:23,018 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:23,075 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-11-25 17:34:23,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:34:23,076 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 17:34:23,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:23,077 INFO L225 Difference]: With dead ends: 76 [2022-11-25 17:34:23,077 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 17:34:23,077 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-25 17:34:23,084 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:23,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 46 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:34:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 17:34:23,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-11-25 17:34:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2022-11-25 17:34:23,096 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 5 [2022-11-25 17:34:23,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:23,096 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2022-11-25 17:34:23,096 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-11-25 17:34:23,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 17:34:23,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:23,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:23,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:34:23,098 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:23,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:23,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2022-11-25 17:34:23,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:23,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887653272] [2022-11-25 17:34:23,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:23,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:23,351 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-25 17:34:23,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:23,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887653272] [2022-11-25 17:34:23,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887653272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:23,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:23,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:34:23,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600870141] [2022-11-25 17:34:23,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:23,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:34:23,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:23,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:34:23,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:34:23,355 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:23,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:23,591 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2022-11-25 17:34:23,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 17:34:23,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-25 17:34:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:23,593 INFO L225 Difference]: With dead ends: 86 [2022-11-25 17:34:23,593 INFO L226 Difference]: Without dead ends: 86 [2022-11-25 17:34:23,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:34:23,594 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 16 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:23,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 349 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:34:23,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-25 17:34:23,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2022-11-25 17:34:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 80 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-11-25 17:34:23,598 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 10 [2022-11-25 17:34:23,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:23,599 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-11-25 17:34:23,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:23,599 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-11-25 17:34:23,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 17:34:23,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:23,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:23,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:34:23,600 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:23,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:23,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1868053176, now seen corresponding path program 1 times [2022-11-25 17:34:23,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:23,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49680095] [2022-11-25 17:34:23,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:23,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:23,851 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-25 17:34:23,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:23,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49680095] [2022-11-25 17:34:23,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49680095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:23,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:23,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:34:23,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669670989] [2022-11-25 17:34:23,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:23,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:34:23,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:23,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:34:23,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:34:23,855 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:24,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:24,012 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-11-25 17:34:24,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:34:24,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 17:34:24,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:24,013 INFO L225 Difference]: With dead ends: 89 [2022-11-25 17:34:24,013 INFO L226 Difference]: Without dead ends: 89 [2022-11-25 17:34:24,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:34:24,015 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 109 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:24,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 102 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:34:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-25 17:34:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2022-11-25 17:34:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 79 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-11-25 17:34:24,024 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 17 [2022-11-25 17:34:24,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:24,024 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-11-25 17:34:24,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-11-25 17:34:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 17:34:24,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:24,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:24,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:34:24,027 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:24,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:24,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1868053177, now seen corresponding path program 1 times [2022-11-25 17:34:24,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:24,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122917739] [2022-11-25 17:34:24,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:24,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:24,418 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-25 17:34:24,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:24,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122917739] [2022-11-25 17:34:24,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122917739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:24,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:24,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:34:24,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817026859] [2022-11-25 17:34:24,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:24,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:34:24,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:24,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:34:24,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:34:24,422 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:24,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:24,582 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-11-25 17:34:24,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:34:24,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 17:34:24,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:24,584 INFO L225 Difference]: With dead ends: 91 [2022-11-25 17:34:24,584 INFO L226 Difference]: Without dead ends: 91 [2022-11-25 17:34:24,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:34:24,586 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 124 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:24,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 99 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:34:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-25 17:34:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2022-11-25 17:34:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 78 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2022-11-25 17:34:24,598 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2022-11-25 17:34:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:24,599 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2022-11-25 17:34:24,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:24,599 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2022-11-25 17:34:24,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 17:34:24,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:24,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:24,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:34:24,601 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:24,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:24,602 INFO L85 PathProgramCache]: Analyzing trace with hash 2076126984, now seen corresponding path program 1 times [2022-11-25 17:34:24,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:24,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644828779] [2022-11-25 17:34:24,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:24,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:24,656 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-25 17:34:24,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:24,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644828779] [2022-11-25 17:34:24,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644828779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:24,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:24,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:34:24,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656976014] [2022-11-25 17:34:24,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:24,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:34:24,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:24,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:34:24,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:34:24,659 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:24,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:24,674 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-11-25 17:34:24,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:34:24,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 17:34:24,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:24,675 INFO L225 Difference]: With dead ends: 78 [2022-11-25 17:34:24,675 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 17:34:24,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-25 17:34:24,676 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 59 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:24,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 150 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:34:24,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 17:34:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2022-11-25 17:34:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.52) internal successors, (76), 73 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2022-11-25 17:34:24,680 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 18 [2022-11-25 17:34:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:24,680 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2022-11-25 17:34:24,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2022-11-25 17:34:24,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 17:34:24,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:24,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:24,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:34:24,682 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:24,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:24,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1280939784, now seen corresponding path program 1 times [2022-11-25 17:34:24,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:24,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243776244] [2022-11-25 17:34:24,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:24,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,035 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-25 17:34:25,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:25,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243776244] [2022-11-25 17:34:25,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243776244] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:25,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:25,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:34:25,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346089437] [2022-11-25 17:34:25,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:25,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:34:25,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:25,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:34:25,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:34:25,038 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:25,254 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-11-25 17:34:25,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:34:25,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 17:34:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:25,255 INFO L225 Difference]: With dead ends: 73 [2022-11-25 17:34:25,255 INFO L226 Difference]: Without dead ends: 73 [2022-11-25 17:34:25,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:34:25,256 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 149 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:25,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 142 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:34:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-25 17:34:25,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-25 17:34:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.5) internal successors, (75), 72 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:25,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2022-11-25 17:34:25,259 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 20 [2022-11-25 17:34:25,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:25,259 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2022-11-25 17:34:25,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-11-25 17:34:25,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 17:34:25,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:25,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:25,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:34:25,261 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:25,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:25,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1280939783, now seen corresponding path program 1 times [2022-11-25 17:34:25,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:25,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487474446] [2022-11-25 17:34:25,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:25,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:25,364 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-25 17:34:25,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:25,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487474446] [2022-11-25 17:34:25,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487474446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:25,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:25,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:34:25,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382188583] [2022-11-25 17:34:25,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:25,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:34:25,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:25,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:34:25,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:34:25,367 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:25,462 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2022-11-25 17:34:25,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:34:25,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-25 17:34:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:25,464 INFO L225 Difference]: With dead ends: 72 [2022-11-25 17:34:25,464 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 17:34:25,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:34:25,465 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 14 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:25,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 154 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:34:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 17:34:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-25 17:34:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.48) internal successors, (74), 71 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2022-11-25 17:34:25,468 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 20 [2022-11-25 17:34:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:25,469 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2022-11-25 17:34:25,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2022-11-25 17:34:25,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-25 17:34:25,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:25,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:25,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:34:25,470 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:25,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1054427643, now seen corresponding path program 1 times [2022-11-25 17:34:25,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:25,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069599225] [2022-11-25 17:34:25,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:25,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:26,043 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-25 17:34:26,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:26,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069599225] [2022-11-25 17:34:26,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069599225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:26,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:26,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:34:26,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974766912] [2022-11-25 17:34:26,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:26,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:34:26,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:26,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:34:26,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:34:26,046 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:26,711 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2022-11-25 17:34:26,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 17:34:26,712 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-25 17:34:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:26,712 INFO L225 Difference]: With dead ends: 116 [2022-11-25 17:34:26,712 INFO L226 Difference]: Without dead ends: 116 [2022-11-25 17:34:26,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2022-11-25 17:34:26,713 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 192 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:26,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 253 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:34:26,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-25 17:34:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 85. [2022-11-25 17:34:26,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 84 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-11-25 17:34:26,716 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 21 [2022-11-25 17:34:26,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:26,716 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-11-25 17:34:26,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-11-25 17:34:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 17:34:26,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:26,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:26,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:34:26,718 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:26,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:26,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1672481337, now seen corresponding path program 1 times [2022-11-25 17:34:26,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:26,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509993717] [2022-11-25 17:34:26,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:26,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:27,339 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-25 17:34:27,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:27,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509993717] [2022-11-25 17:34:27,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509993717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:27,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:27,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 17:34:27,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017068236] [2022-11-25 17:34:27,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:27,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:34:27,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:27,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:34:27,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:34:27,342 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:27,964 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2022-11-25 17:34:27,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 17:34:27,964 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 17:34:27,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:27,965 INFO L225 Difference]: With dead ends: 136 [2022-11-25 17:34:27,965 INFO L226 Difference]: Without dead ends: 136 [2022-11-25 17:34:27,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2022-11-25 17:34:27,967 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 292 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:27,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 167 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:34:27,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-25 17:34:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 86. [2022-11-25 17:34:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.390625) internal successors, (89), 85 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-11-25 17:34:27,970 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 22 [2022-11-25 17:34:27,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:27,970 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-11-25 17:34:27,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-11-25 17:34:27,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 17:34:27,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:27,973 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:27,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:34:27,973 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:27,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:27,974 INFO L85 PathProgramCache]: Analyzing trace with hash -428723026, now seen corresponding path program 1 times [2022-11-25 17:34:27,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:27,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869190097] [2022-11-25 17:34:27,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:27,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:34:28,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:28,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869190097] [2022-11-25 17:34:28,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869190097] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:34:28,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706976411] [2022-11-25 17:34:28,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:28,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:34:28,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:34:28,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:34:28,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:34:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:28,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 17:34:28,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:34:28,712 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-25 17:34:28,786 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-25 17:34:28,787 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 21 treesize of output 29 [2022-11-25 17:34:28,909 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 17:34:28,909 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 33 treesize of output 24 [2022-11-25 17:34:29,023 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 17:34:29,023 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 36 treesize of output 16 [2022-11-25 17:34:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:34:29,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:34:29,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-11-25 17:34:29,695 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:34:29,695 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 103 treesize of output 255 [2022-11-25 17:34:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:34:30,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706976411] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:34:30,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:34:30,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2022-11-25 17:34:30,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103483866] [2022-11-25 17:34:30,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:34:30,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 17:34:30,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:30,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 17:34:30,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:34:30,078 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:30,778 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2022-11-25 17:34:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:34:30,779 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 17:34:30,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:30,780 INFO L225 Difference]: With dead ends: 102 [2022-11-25 17:34:30,780 INFO L226 Difference]: Without dead ends: 102 [2022-11-25 17:34:30,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2022-11-25 17:34:30,781 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 305 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:30,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 246 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:34:30,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-25 17:34:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2022-11-25 17:34:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 64 states have (on average 1.375) internal successors, (88), 84 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-11-25 17:34:30,784 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 22 [2022-11-25 17:34:30,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:30,784 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-11-25 17:34:30,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:30,784 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-11-25 17:34:30,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 17:34:30,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:30,785 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:30,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:34:30,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:34:30,991 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:30,991 INFO L85 PathProgramCache]: Analyzing trace with hash -428723025, now seen corresponding path program 1 times [2022-11-25 17:34:30,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:30,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553918889] [2022-11-25 17:34:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:30,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:31,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:34:31,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:31,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553918889] [2022-11-25 17:34:31,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553918889] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:34:31,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969859001] [2022-11-25 17:34:31,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:31,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:34:31,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:34:31,445 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:34:31,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:34:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:31,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-25 17:34:31,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:34:31,778 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-25 17:34:31,786 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-25 17:34:31,870 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 17:34:31,870 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-25 17:34:31,880 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-25 17:34:31,990 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 17:34:31,991 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 33 treesize of output 24 [2022-11-25 17:34:32,016 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 17:34:32,016 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-25 17:34:32,141 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 17:34:32,141 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 36 treesize of output 16 [2022-11-25 17:34:32,149 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 17:34:32,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-11-25 17:34:32,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:34:32,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:34:34,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-25 17:34:34,484 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 66 treesize of output 62 [2022-11-25 17:34:34,489 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 102 treesize of output 94 [2022-11-25 17:34:46,823 WARN L233 SmtUtils]: Spent 12.20s on a formula simplification. DAG size of input: 33 DAG size of output: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 17:34:46,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 17:34:46,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 51 treesize of output 91 [2022-11-25 17:34:46,926 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 58 treesize of output 54 [2022-11-25 17:34:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:34:47,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969859001] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:34:47,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:34:47,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 22 [2022-11-25 17:34:47,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282414824] [2022-11-25 17:34:47,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:34:47,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 17:34:47,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:47,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 17:34:47,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2022-11-25 17:34:47,131 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:48,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:48,286 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2022-11-25 17:34:48,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 17:34:48,287 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-25 17:34:48,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:48,288 INFO L225 Difference]: With dead ends: 113 [2022-11-25 17:34:48,288 INFO L226 Difference]: Without dead ends: 113 [2022-11-25 17:34:48,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2022-11-25 17:34:48,289 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 321 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:48,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 437 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:34:48,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-25 17:34:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2022-11-25 17:34:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.359375) internal successors, (87), 83 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2022-11-25 17:34:48,292 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 22 [2022-11-25 17:34:48,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:48,292 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2022-11-25 17:34:48,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:48,292 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2022-11-25 17:34:48,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 17:34:48,293 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:48,293 INFO L195 NwaCegarLoop]: trace histogram [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-25 17:34:48,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:34:48,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:34:48,494 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:48,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:48,494 INFO L85 PathProgramCache]: Analyzing trace with hash -307313795, now seen corresponding path program 1 times [2022-11-25 17:34:48,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:48,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141477295] [2022-11-25 17:34:48,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:48,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:48,898 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-25 17:34:48,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:48,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141477295] [2022-11-25 17:34:48,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141477295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:48,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:48,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 17:34:48,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722142831] [2022-11-25 17:34:48,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:48,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:34:48,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:48,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:34:48,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:34:48,900 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:49,402 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-11-25 17:34:49,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 17:34:49,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 17:34:49,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:49,403 INFO L225 Difference]: With dead ends: 98 [2022-11-25 17:34:49,403 INFO L226 Difference]: Without dead ends: 98 [2022-11-25 17:34:49,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2022-11-25 17:34:49,404 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 160 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:49,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 185 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:34:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-25 17:34:49,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2022-11-25 17:34:49,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 65 states have (on average 1.353846153846154) internal successors, (88), 84 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-11-25 17:34:49,407 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 23 [2022-11-25 17:34:49,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:49,408 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-11-25 17:34:49,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-11-25 17:34:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 17:34:49,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:49,409 INFO L195 NwaCegarLoop]: trace histogram [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-25 17:34:49,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:34:49,409 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:49,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:49,411 INFO L85 PathProgramCache]: Analyzing trace with hash -936792950, now seen corresponding path program 1 times [2022-11-25 17:34:49,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:49,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308877989] [2022-11-25 17:34:49,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:49,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:49,603 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-25 17:34:49,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:49,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308877989] [2022-11-25 17:34:49,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308877989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:49,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:49,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:34:49,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803347754] [2022-11-25 17:34:49,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:49,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:34:49,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:49,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:34:49,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:34:49,606 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:49,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:49,728 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-11-25 17:34:49,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:34:49,729 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 17:34:49,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:49,730 INFO L225 Difference]: With dead ends: 84 [2022-11-25 17:34:49,730 INFO L226 Difference]: Without dead ends: 84 [2022-11-25 17:34:49,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:34:49,730 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 171 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:49,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 49 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:34:49,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-25 17:34:49,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-11-25 17:34:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 83 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:49,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2022-11-25 17:34:49,733 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 24 [2022-11-25 17:34:49,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:49,733 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2022-11-25 17:34:49,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:49,733 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2022-11-25 17:34:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 17:34:49,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:49,734 INFO L195 NwaCegarLoop]: trace histogram [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-25 17:34:49,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:34:49,734 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:49,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:49,735 INFO L85 PathProgramCache]: Analyzing trace with hash -936792949, now seen corresponding path program 1 times [2022-11-25 17:34:49,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:49,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647842737] [2022-11-25 17:34:49,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:49,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:49,792 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-25 17:34:49,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:49,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647842737] [2022-11-25 17:34:49,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647842737] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:49,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:49,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:34:49,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331198534] [2022-11-25 17:34:49,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:49,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:34:49,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:49,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:34:49,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:34:49,795 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:49,839 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2022-11-25 17:34:49,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:34:49,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 17:34:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:49,841 INFO L225 Difference]: With dead ends: 79 [2022-11-25 17:34:49,841 INFO L226 Difference]: Without dead ends: 79 [2022-11-25 17:34:49,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:34:49,842 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 81 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:49,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 39 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:34:49,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-25 17:34:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-25 17:34:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-11-25 17:34:49,844 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 24 [2022-11-25 17:34:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:49,845 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-11-25 17:34:49,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-11-25 17:34:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 17:34:49,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:49,846 INFO L195 NwaCegarLoop]: trace histogram [1, 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-25 17:34:49,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 17:34:49,846 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:49,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:49,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1024189665, now seen corresponding path program 1 times [2022-11-25 17:34:49,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:49,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866051182] [2022-11-25 17:34:49,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:49,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:49,960 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-25 17:34:49,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:49,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866051182] [2022-11-25 17:34:49,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866051182] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:49,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:49,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:34:49,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627562504] [2022-11-25 17:34:49,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:49,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:34:49,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:49,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:34:49,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:34:49,963 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:50,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:50,048 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-11-25 17:34:50,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:34:50,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-25 17:34:50,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:50,049 INFO L225 Difference]: With dead ends: 78 [2022-11-25 17:34:50,049 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 17:34:50,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:34:50,050 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 64 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:50,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 95 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:34:50,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 17:34:50,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-25 17:34:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 77 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:50,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-11-25 17:34:50,053 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 25 [2022-11-25 17:34:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:50,053 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-11-25 17:34:50,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:50,053 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-11-25 17:34:50,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 17:34:50,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:50,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 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-25 17:34:50,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 17:34:50,054 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:50,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:50,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1685108650, now seen corresponding path program 1 times [2022-11-25 17:34:50,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:50,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376069563] [2022-11-25 17:34:50,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:50,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:50,203 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-25 17:34:50,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:50,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376069563] [2022-11-25 17:34:50,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376069563] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:50,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:50,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:34:50,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794266648] [2022-11-25 17:34:50,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:50,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:34:50,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:50,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:34:50,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:34:50,206 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:50,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:50,329 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-11-25 17:34:50,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:34:50,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 17:34:50,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:50,330 INFO L225 Difference]: With dead ends: 77 [2022-11-25 17:34:50,330 INFO L226 Difference]: Without dead ends: 77 [2022-11-25 17:34:50,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:34:50,331 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 60 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:50,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 77 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:34:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-25 17:34:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-11-25 17:34:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 76 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2022-11-25 17:34:50,334 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 26 [2022-11-25 17:34:50,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:50,334 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2022-11-25 17:34:50,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:50,334 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-11-25 17:34:50,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 17:34:50,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:50,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 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-25 17:34:50,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 17:34:50,335 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:50,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:50,336 INFO L85 PathProgramCache]: Analyzing trace with hash 698760707, now seen corresponding path program 1 times [2022-11-25 17:34:50,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:50,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285610751] [2022-11-25 17:34:50,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:50,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:51,030 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-25 17:34:51,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:51,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285610751] [2022-11-25 17:34:51,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285610751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:51,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:51,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 17:34:51,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439646706] [2022-11-25 17:34:51,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:51,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 17:34:51,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:51,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 17:34:51,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-25 17:34:51,032 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:51,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:51,967 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-11-25 17:34:51,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-25 17:34:51,968 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-25 17:34:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:51,968 INFO L225 Difference]: With dead ends: 84 [2022-11-25 17:34:51,968 INFO L226 Difference]: Without dead ends: 84 [2022-11-25 17:34:51,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2022-11-25 17:34:51,970 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 119 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:51,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 235 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:34:51,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-25 17:34:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2022-11-25 17:34:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2022-11-25 17:34:51,972 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 27 [2022-11-25 17:34:51,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:51,973 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2022-11-25 17:34:51,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:51,973 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2022-11-25 17:34:51,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 17:34:51,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:51,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 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-25 17:34:51,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 17:34:51,974 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:51,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:51,974 INFO L85 PathProgramCache]: Analyzing trace with hash 186745549, now seen corresponding path program 1 times [2022-11-25 17:34:51,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:51,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751981660] [2022-11-25 17:34:51,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:51,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:52,229 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-25 17:34:52,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:52,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751981660] [2022-11-25 17:34:52,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751981660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:52,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:52,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:34:52,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620088019] [2022-11-25 17:34:52,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:52,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:34:52,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:52,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:34:52,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:34:52,235 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:52,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:52,391 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-11-25 17:34:52,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:34:52,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-25 17:34:52,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:52,392 INFO L225 Difference]: With dead ends: 80 [2022-11-25 17:34:52,392 INFO L226 Difference]: Without dead ends: 80 [2022-11-25 17:34:52,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:34:52,393 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 108 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:52,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 66 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:34:52,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-25 17:34:52,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-25 17:34:52,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-11-25 17:34:52,396 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 28 [2022-11-25 17:34:52,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:52,397 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-11-25 17:34:52,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:52,397 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-11-25 17:34:52,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 17:34:52,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:52,397 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:34:52,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 17:34:52,398 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:52,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:52,399 INFO L85 PathProgramCache]: Analyzing trace with hash -973971529, now seen corresponding path program 1 times [2022-11-25 17:34:52,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:52,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460660278] [2022-11-25 17:34:52,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:52,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:53,902 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-25 17:34:53,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:53,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460660278] [2022-11-25 17:34:53,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460660278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:53,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:53,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-25 17:34:53,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579893700] [2022-11-25 17:34:53,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:53,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-25 17:34:53,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:53,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-25 17:34:53,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:34:53,921 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:55,154 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2022-11-25 17:34:55,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 17:34:55,156 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-25 17:34:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:55,157 INFO L225 Difference]: With dead ends: 117 [2022-11-25 17:34:55,157 INFO L226 Difference]: Without dead ends: 115 [2022-11-25 17:34:55,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2022-11-25 17:34:55,158 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 37 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:55,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 324 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:34:55,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-25 17:34:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2022-11-25 17:34:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 91 states have (on average 1.164835164835165) internal successors, (106), 101 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2022-11-25 17:34:55,162 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 32 [2022-11-25 17:34:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:55,162 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2022-11-25 17:34:55,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2022-11-25 17:34:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 17:34:55,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:55,165 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:34:55,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 17:34:55,166 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:55,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash -973970341, now seen corresponding path program 1 times [2022-11-25 17:34:55,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:55,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055761806] [2022-11-25 17:34:55,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:55,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:55,249 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-25 17:34:55,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:55,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055761806] [2022-11-25 17:34:55,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055761806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:34:55,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:34:55,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:34:55,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986495187] [2022-11-25 17:34:55,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:34:55,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:34:55,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:34:55,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:34:55,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:34:55,253 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:55,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:34:55,269 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2022-11-25 17:34:55,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:34:55,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-25 17:34:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:34:55,271 INFO L225 Difference]: With dead ends: 119 [2022-11-25 17:34:55,271 INFO L226 Difference]: Without dead ends: 103 [2022-11-25 17:34:55,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:34:55,272 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 18 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:34:55,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 162 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:34:55,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-25 17:34:55,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 86. [2022-11-25 17:34:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 85 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2022-11-25 17:34:55,276 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 32 [2022-11-25 17:34:55,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:34:55,276 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2022-11-25 17:34:55,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:34:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2022-11-25 17:34:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 17:34:55,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:34:55,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:34:55,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 17:34:55,278 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-11-25 17:34:55,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:34:55,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1880889347, now seen corresponding path program 1 times [2022-11-25 17:34:55,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:34:55,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690392212] [2022-11-25 17:34:55,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:55,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:34:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:56,736 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:34:56,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:34:56,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690392212] [2022-11-25 17:34:56,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690392212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:34:56,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730124688] [2022-11-25 17:34:56,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:34:56,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:34:56,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:34:56,738 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:34:56,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_399b8b1e-423b-46c9-8005-4d369b147326/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:34:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:34:56,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 92 conjunts are in the unsatisfiable core [2022-11-25 17:34:56,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:34:56,919 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-25 17:34:56,964 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 17:34:56,964 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-25 17:34:57,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 17:34:57,229 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-25 17:34:57,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 17:34:57,389 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-25 17:34:57,389 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 20 treesize of output 22 [2022-11-25 17:34:57,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-25 17:34:57,581 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-25 17:34:57,824 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 46 treesize of output 22 [2022-11-25 17:34:58,196 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:34:58,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 52 [2022-11-25 17:34:58,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 17:34:58,384 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 17:34:58,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 63 [2022-11-25 17:34:59,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2022-11-25 17:34:59,158 INFO L321 Elim1Store]: treesize reduction 20, result has 25.9 percent of original size [2022-11-25 17:34:59,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2022-11-25 17:34:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:34:59,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:34:59,411 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 80 treesize of output 76 [2022-11-25 17:35:18,112 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 879 treesize of output 863 [2022-11-25 17:35:21,707 WARN L859 $PredicateComparison]: unable to prove that (or (not (= (select |c_#valid| |c_ULTIMATE.start_append_~plist#1.base|) 1)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~plist#1.base|) |c_ULTIMATE.start_append_~plist#1.offset| |c_ULTIMATE.start_append_~item~0#1.offset|)))) (let ((.cse8 (select (select .cse1 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse18 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|)) (.cse20 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse5 (+ 4 .cse8))) (let ((.cse19 (forall ((v_ArrVal_679 Int)) (or (< v_ArrVal_679 0) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_16| Int)) (or (not (<= |v_ULTIMATE.start_append_~item~0#1.offset_16| 0)) (not (<= v_ArrVal_679 |v_ULTIMATE.start_append_~item~0#1.offset_16|)) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_20| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_20|) 0)) (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int)) (let ((.cse45 (let ((.cse47 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| (let ((.cse48 (store (select .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse8))) (store .cse48 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4) (select (select (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse48) v_arrayElimCell_59) .cse5)))))) (store .cse47 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse47 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679)))) (.cse46 (+ v_ArrVal_679 4))) (or (= (select (select .cse45 v_arrayElimCell_58) .cse46) 0) (= (select (select .cse45 |v_ULTIMATE.start_append_~item~0#1.base_20|) .cse46) 0))))))))))) (.cse21 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_20| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_16| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int) (v_ArrVal_679 Int)) (let ((.cse41 (let ((.cse43 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| (let ((.cse44 (store (select .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse8))) (store .cse44 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4) (select (select (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse44) v_arrayElimCell_59) .cse5)))))) (store .cse43 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse43 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679)))) (.cse42 (+ v_ArrVal_679 4))) (or (not (<= |v_ULTIMATE.start_append_~item~0#1.offset_16| 0)) (not (<= v_ArrVal_679 |v_ULTIMATE.start_append_~item~0#1.offset_16|)) (< v_ArrVal_679 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_20|) 0)) (= (select (select .cse41 v_arrayElimCell_58) .cse42) 0) (= (select (select .cse41 |v_ULTIMATE.start_append_~item~0#1.base_20|) .cse42) 0))))) (.cse22 (forall ((v_ArrVal_679 Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_16| Int)) (or (not (<= |v_ULTIMATE.start_append_~item~0#1.offset_16| 0)) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_20| Int)) (let ((.cse36 (store (select .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse8))) (let ((.cse37 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4)) (.cse38 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse36)) (.cse39 (+ v_ArrVal_679 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_20|) 0)) (forall ((v_arrayElimCell_59 Int)) (= (select (select (let ((.cse35 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| (store .cse36 .cse37 (select (select .cse38 v_arrayElimCell_59) .cse5))))) (store .cse35 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse35 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679))) |v_ULTIMATE.start_append_~item~0#1.base_20|) .cse39) 0)) (forall ((v_arrayElimCell_58 Int)) (= (select (select (let ((.cse40 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| (store .cse36 .cse37 (select (select .cse38 |c_ULTIMATE.start_append_~item~0#1.base|) .cse5))))) (store .cse40 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse40 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679))) v_arrayElimCell_58) .cse39) 0)))))) (not (<= v_ArrVal_679 |v_ULTIMATE.start_append_~item~0#1.offset_16|)))) (< v_ArrVal_679 0)))) (.cse23 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_20| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_16| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int) (v_ArrVal_679 Int)) (let ((.cse29 (store (select .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse8))) (let ((.cse30 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4)) (.cse31 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse29))) (let ((.cse33 (let ((.cse34 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| (store .cse29 .cse30 (select (select .cse31 v_arrayElimCell_59) .cse5))))) (store .cse34 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse34 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679)))) (.cse32 (+ v_ArrVal_679 4))) (or (not (<= |v_ULTIMATE.start_append_~item~0#1.offset_16| 0)) (not (<= v_ArrVal_679 |v_ULTIMATE.start_append_~item~0#1.offset_16|)) (= (select (select (let ((.cse28 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| (store .cse29 .cse30 (select (select .cse31 |c_ULTIMATE.start_append_~item~0#1.base|) .cse5))))) (store .cse28 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse28 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679))) |v_ULTIMATE.start_append_~item~0#1.base_20|) .cse32) 0) (< v_ArrVal_679 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_20|) 0)) (= (select (select .cse33 v_arrayElimCell_58) .cse32) 0) (= (select (select .cse33 |v_ULTIMATE.start_append_~item~0#1.base_20|) .cse32) 0))))))) (.cse9 (not .cse20)) (.cse10 (not .cse18))) (and (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_20| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_16| Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_59 Int) (v_ArrVal_679 Int)) (let ((.cse2 (store (select .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse8))) (let ((.cse3 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4)) (.cse4 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse2)) (.cse6 (+ v_ArrVal_679 4))) (or (not (<= |v_ULTIMATE.start_append_~item~0#1.offset_16| 0)) (not (<= v_ArrVal_679 |v_ULTIMATE.start_append_~item~0#1.offset_16|)) (= (select (select (let ((.cse0 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| (store .cse2 .cse3 (select (select .cse4 |c_ULTIMATE.start_append_~item~0#1.base|) .cse5))))) (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679))) |v_ULTIMATE.start_append_~item~0#1.base_20|) .cse6) 0) (< v_ArrVal_679 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_20|) 0)) (= (select (select (let ((.cse7 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| (store .cse2 .cse3 (select (select .cse4 v_arrayElimCell_59) .cse5))))) (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679))) v_arrayElimCell_58) .cse6) 0))))) .cse9 .cse10) (forall ((v_ArrVal_679 Int)) (or (< v_ArrVal_679 0) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_16| Int)) (or (not (<= |v_ULTIMATE.start_append_~item~0#1.offset_16| 0)) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_20| Int)) (let ((.cse14 (store (select .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse8))) (let ((.cse15 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4)) (.cse16 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse14))) (let ((.cse11 (let ((.cse17 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| (store .cse14 .cse15 (select (select .cse16 |c_ULTIMATE.start_append_~item~0#1.base|) .cse5))))) (store .cse17 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679)))) (.cse12 (+ v_ArrVal_679 4))) (or (= (select (select .cse11 |v_ULTIMATE.start_append_~item~0#1.base_20|) .cse12) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_20|) 0)) (forall ((v_arrayElimCell_59 Int)) (= (select (select (let ((.cse13 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| (store .cse14 .cse15 (select (select .cse16 v_arrayElimCell_59) .cse5))))) (store .cse13 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse13 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679))) |v_ULTIMATE.start_append_~item~0#1.base_20|) .cse12) 0)) (forall ((v_arrayElimCell_58 Int)) (= (select (select .cse11 v_arrayElimCell_58) .cse12) 0))))))) (not (<= v_ArrVal_679 |v_ULTIMATE.start_append_~item~0#1.offset_16|)))))) (or .cse18 (and .cse19 (or .cse20 .cse21) .cse22)) (or .cse23 .cse18) (or (and .cse19 (or .cse21 .cse18) .cse22) .cse20) (or .cse20 .cse23) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_20| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_16| Int) (v_arrayElimCell_58 Int) (v_ArrVal_679 Int)) (let ((.cse24 (let ((.cse26 (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| (let ((.cse27 (store (select .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20|) |v_ULTIMATE.start_append_~item~0#1.offset_16| .cse8))) (store .cse27 (+ |v_ULTIMATE.start_append_~item~0#1.offset_16| 4) (select (select (store .cse1 |v_ULTIMATE.start_append_~item~0#1.base_20| .cse27) |c_ULTIMATE.start_append_~item~0#1.base|) .cse5)))))) (store .cse26 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse26 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset| v_ArrVal_679)))) (.cse25 (+ v_ArrVal_679 4))) (or (not (<= |v_ULTIMATE.start_append_~item~0#1.offset_16| 0)) (not (<= v_ArrVal_679 |v_ULTIMATE.start_append_~item~0#1.offset_16|)) (= (select (select .cse24 |v_ULTIMATE.start_append_~item~0#1.base_20|) .cse25) 0) (< v_ArrVal_679 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_20|) 0)) (= (select (select .cse24 v_arrayElimCell_58) .cse25) 0)))) .cse9 .cse10))))))) is different from true [2022-11-25 17:45:39,376 WARN L233 SmtUtils]: Spent 10.15m on a formula simplification. DAG size of input: 5240 DAG size of output: 4310 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-25 17:45:39,404 INFO L321 Elim1Store]: treesize reduction 3830, result has 77.2 percent of original size [2022-11-25 17:45:39,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 55 select indices, 55 select index equivalence classes, 0 disjoint index pairs (out of 1485 index pairs), introduced 56 new quantified variables, introduced 1485 case distinctions, treesize of input 155037026 treesize of output 118473735