./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a92c386f0a3e93e7f4997075243ca49a5a9660dc1b84c645c53a036868e1508d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 20:08:50,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:08:50,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:08:50,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:08:50,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:08:50,747 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:08:50,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:08:50,751 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:08:50,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:08:50,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:08:50,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:08:50,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:08:50,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:08:50,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:08:50,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:08:50,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:08:50,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:08:50,763 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:08:50,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:08:50,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:08:50,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:08:50,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:08:50,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:08:50,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:08:50,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:08:50,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:08:50,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:08:50,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:08:50,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:08:50,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:08:50,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:08:50,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:08:50,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:08:50,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:08:50,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:08:50,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:08:50,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:08:50,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:08:50,796 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:08:50,797 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:08:50,798 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:08:50,799 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 20:08:50,838 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:08:50,838 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:08:50,839 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:08:50,839 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:08:50,840 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:08:50,840 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:08:50,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:08:50,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:08:50,841 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:08:50,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:08:50,843 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:08:50,843 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 20:08:50,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:08:50,844 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:08:50,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:08:50,844 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 20:08:50,844 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 20:08:50,844 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 20:08:50,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:08:50,845 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 20:08:50,845 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:08:50,845 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:08:50,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:08:50,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:08:50,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:08:50,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:08:50,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:08:50,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:08:50,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:08:50,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:08:50,849 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a92c386f0a3e93e7f4997075243ca49a5a9660dc1b84c645c53a036868e1508d [2022-11-18 20:08:51,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:08:51,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:08:51,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:08:51,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:08:51,141 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:08:51,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i [2022-11-18 20:08:51,217 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/data/3899510cb/114b6181d1094611b7c255165518a7c0/FLAG4ddf762ca [2022-11-18 20:08:51,819 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:08:51,819 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/sv-benchmarks/c/memsafety-ext/skiplist_3lvl.i [2022-11-18 20:08:51,842 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/data/3899510cb/114b6181d1094611b7c255165518a7c0/FLAG4ddf762ca [2022-11-18 20:08:52,104 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/data/3899510cb/114b6181d1094611b7c255165518a7c0 [2022-11-18 20:08:52,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:08:52,108 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:08:52,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:08:52,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:08:52,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:08:52,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:08:52" (1/1) ... [2022-11-18 20:08:52,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@468df67a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:52, skipping insertion in model container [2022-11-18 20:08:52,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:08:52" (1/1) ... [2022-11-18 20:08:52,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:08:52,157 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:08:52,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:08:52,463 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:08:52,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:08:52,529 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:08:52,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:52 WrapperNode [2022-11-18 20:08:52,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:08:52,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:08:52,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:08:52,531 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:08:52,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:52" (1/1) ... [2022-11-18 20:08:52,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:52" (1/1) ... [2022-11-18 20:08:52,578 INFO L138 Inliner]: procedures = 127, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 175 [2022-11-18 20:08:52,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:08:52,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:08:52,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:08:52,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:08:52,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:52" (1/1) ... [2022-11-18 20:08:52,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:52" (1/1) ... [2022-11-18 20:08:52,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:52" (1/1) ... [2022-11-18 20:08:52,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:52" (1/1) ... [2022-11-18 20:08:52,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:52" (1/1) ... [2022-11-18 20:08:52,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:52" (1/1) ... [2022-11-18 20:08:52,609 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:52" (1/1) ... [2022-11-18 20:08:52,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:52" (1/1) ... [2022-11-18 20:08:52,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:08:52,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:08:52,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:08:52,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:08:52,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:52" (1/1) ... [2022-11-18 20:08:52,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:08:52,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:08:52,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:08:52,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:08:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 20:08:52,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:08:52,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 20:08:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 20:08:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:08:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:08:52,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:08:52,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:08:52,855 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:08:52,857 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:08:53,482 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:08:53,490 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:08:53,498 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-18 20:08:53,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:08:53 BoogieIcfgContainer [2022-11-18 20:08:53,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:08:53,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:08:53,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:08:53,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:08:53,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:08:52" (1/3) ... [2022-11-18 20:08:53,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758be8bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:08:53, skipping insertion in model container [2022-11-18 20:08:53,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:08:52" (2/3) ... [2022-11-18 20:08:53,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758be8bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:08:53, skipping insertion in model container [2022-11-18 20:08:53,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:08:53" (3/3) ... [2022-11-18 20:08:53,519 INFO L112 eAbstractionObserver]: Analyzing ICFG skiplist_3lvl.i [2022-11-18 20:08:53,540 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:08:53,540 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 85 error locations. [2022-11-18 20:08:53,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:08:53,642 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3582a96f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:08:53,642 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-11-18 20:08:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 85 states have (on average 2.176470588235294) internal successors, (185), 170 states have internal predecessors, (185), 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-18 20:08:53,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 20:08:53,655 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:53,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 20:08:53,656 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:08:53,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-18 20:08:53,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:53,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10219344] [2022-11-18 20:08:53,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:53,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:08:53,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:53,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10219344] [2022-11-18 20:08:53,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10219344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:53,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:53,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:08:54,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112143291] [2022-11-18 20:08:54,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:54,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:08:54,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:54,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:08:54,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:08:54,044 INFO L87 Difference]: Start difference. First operand has 171 states, 85 states have (on average 2.176470588235294) internal successors, (185), 170 states have internal predecessors, (185), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-18 20:08:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:54,362 INFO L93 Difference]: Finished difference Result 192 states and 202 transitions. [2022-11-18 20:08:54,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:08:54,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-11-18 20:08:54,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:54,382 INFO L225 Difference]: With dead ends: 192 [2022-11-18 20:08:54,382 INFO L226 Difference]: Without dead ends: 190 [2022-11-18 20:08:54,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:08:54,390 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 161 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:54,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 105 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:08:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-11-18 20:08:54,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 160. [2022-11-18 20:08:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 84 states have (on average 2.011904761904762) internal successors, (169), 159 states have internal predecessors, (169), 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-18 20:08:54,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2022-11-18 20:08:54,446 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 3 [2022-11-18 20:08:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:54,446 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2022-11-18 20:08:54,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-18 20:08:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2022-11-18 20:08:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-18 20:08:54,448 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:54,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-18 20:08:54,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:08:54,449 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:08:54,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:54,450 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-18 20:08:54,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:54,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979993917] [2022-11-18 20:08:54,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:54,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:54,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:08:54,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:54,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979993917] [2022-11-18 20:08:54,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979993917] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:54,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:54,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:08:54,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027295192] [2022-11-18 20:08:54,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:54,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:08:54,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:54,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:08:54,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:08:54,579 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-18 20:08:54,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:54,744 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2022-11-18 20:08:54,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:08:54,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-11-18 20:08:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:54,749 INFO L225 Difference]: With dead ends: 159 [2022-11-18 20:08:54,749 INFO L226 Difference]: Without dead ends: 159 [2022-11-18 20:08:54,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:08:54,755 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:54,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 252 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:08:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-18 20:08:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-11-18 20:08:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 84 states have (on average 2.0) internal successors, (168), 158 states have internal predecessors, (168), 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-18 20:08:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2022-11-18 20:08:54,778 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 3 [2022-11-18 20:08:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:54,779 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2022-11-18 20:08:54,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-18 20:08:54,779 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2022-11-18 20:08:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 20:08:54,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:54,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 20:08:54,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:08:54,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:08:54,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:54,785 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2022-11-18 20:08:54,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:54,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136206527] [2022-11-18 20:08:54,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:54,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:55,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:08:55,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:55,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136206527] [2022-11-18 20:08:55,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136206527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:55,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:55,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:08:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95958446] [2022-11-18 20:08:55,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:55,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:08:55,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:55,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:08:55,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:08:55,134 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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-18 20:08:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:55,476 INFO L93 Difference]: Finished difference Result 181 states and 191 transitions. [2022-11-18 20:08:55,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:08:55,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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-18 20:08:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:55,479 INFO L225 Difference]: With dead ends: 181 [2022-11-18 20:08:55,479 INFO L226 Difference]: Without dead ends: 181 [2022-11-18 20:08:55,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:08:55,491 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 187 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:55,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 119 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:08:55,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-18 20:08:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 151. [2022-11-18 20:08:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 84 states have (on average 1.9047619047619047) internal successors, (160), 150 states have internal predecessors, (160), 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-18 20:08:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2022-11-18 20:08:55,511 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 5 [2022-11-18 20:08:55,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:55,511 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2022-11-18 20:08:55,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 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-18 20:08:55,512 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2022-11-18 20:08:55,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:08:55,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:55,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:08:55,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:08:55,513 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:08:55,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:55,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937495, now seen corresponding path program 1 times [2022-11-18 20:08:55,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:55,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423803469] [2022-11-18 20:08:55,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:55,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:55,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:08:55,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:55,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423803469] [2022-11-18 20:08:55,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423803469] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:55,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:55,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:08:55,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962402456] [2022-11-18 20:08:55,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:55,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:08:55,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:55,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:08:55,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:08:55,815 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:08:56,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:56,055 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2022-11-18 20:08:56,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:08:56,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-18 20:08:56,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:56,057 INFO L225 Difference]: With dead ends: 150 [2022-11-18 20:08:56,057 INFO L226 Difference]: Without dead ends: 150 [2022-11-18 20:08:56,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-18 20:08:56,058 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 12 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:56,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 384 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:08:56,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-18 20:08:56,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-18 20:08:56,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 84 states have (on average 1.8928571428571428) internal successors, (159), 149 states have internal predecessors, (159), 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-18 20:08:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2022-11-18 20:08:56,071 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 11 [2022-11-18 20:08:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:56,072 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2022-11-18 20:08:56,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:08:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2022-11-18 20:08:56,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-18 20:08:56,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:56,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:08:56,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:08:56,073 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:08:56,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:56,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937494, now seen corresponding path program 1 times [2022-11-18 20:08:56,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:56,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541097180] [2022-11-18 20:08:56,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:56,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:08:56,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:56,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541097180] [2022-11-18 20:08:56,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541097180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:56,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:56,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:08:56,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727109113] [2022-11-18 20:08:56,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:56,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:08:56,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:56,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:08:56,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:08:56,438 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:08:56,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:56,717 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2022-11-18 20:08:56,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:08:56,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-18 20:08:56,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:56,719 INFO L225 Difference]: With dead ends: 149 [2022-11-18 20:08:56,719 INFO L226 Difference]: Without dead ends: 149 [2022-11-18 20:08:56,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-18 20:08:56,720 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 15 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:56,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 365 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:08:56,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-18 20:08:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-18 20:08:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 84 states have (on average 1.880952380952381) internal successors, (158), 148 states have internal predecessors, (158), 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-18 20:08:56,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 158 transitions. [2022-11-18 20:08:56,724 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 158 transitions. Word has length 11 [2022-11-18 20:08:56,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:56,725 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 158 transitions. [2022-11-18 20:08:56,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:08:56,725 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 158 transitions. [2022-11-18 20:08:56,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:08:56,725 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:56,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:08:56,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 20:08:56,726 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:08:56,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:56,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1786545203, now seen corresponding path program 1 times [2022-11-18 20:08:56,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:56,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773969219] [2022-11-18 20:08:56,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:56,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:08:56,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:56,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773969219] [2022-11-18 20:08:56,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773969219] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:56,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:56,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:08:56,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959665165] [2022-11-18 20:08:56,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:56,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:08:56,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:56,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:08:56,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:08:56,839 INFO L87 Difference]: Start difference. First operand 149 states and 158 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-18 20:08:56,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:56,994 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2022-11-18 20:08:56,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:08:56,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-11-18 20:08:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:56,996 INFO L225 Difference]: With dead ends: 148 [2022-11-18 20:08:56,996 INFO L226 Difference]: Without dead ends: 148 [2022-11-18 20:08:56,997 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-18 20:08:57,000 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 13 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:57,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 487 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:08:57,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-18 20:08:57,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-11-18 20:08:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 84 states have (on average 1.869047619047619) internal successors, (157), 147 states have internal predecessors, (157), 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-18 20:08:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2022-11-18 20:08:57,013 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 12 [2022-11-18 20:08:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:57,014 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2022-11-18 20:08:57,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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-18 20:08:57,014 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2022-11-18 20:08:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-18 20:08:57,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:57,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:08:57,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:08:57,016 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:08:57,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1786545204, now seen corresponding path program 1 times [2022-11-18 20:08:57,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:57,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111104196] [2022-11-18 20:08:57,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:57,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:08:57,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:57,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111104196] [2022-11-18 20:08:57,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111104196] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:57,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:57,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:08:57,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375173238] [2022-11-18 20:08:57,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:57,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:08:57,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:57,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:08:57,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:08:57,368 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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-18 20:08:57,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:57,652 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2022-11-18 20:08:57,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:08:57,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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 12 [2022-11-18 20:08:57,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:57,654 INFO L225 Difference]: With dead ends: 147 [2022-11-18 20:08:57,654 INFO L226 Difference]: Without dead ends: 147 [2022-11-18 20:08:57,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:08:57,655 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 13 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:57,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 480 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:08:57,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-18 20:08:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2022-11-18 20:08:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 84 states have (on average 1.8571428571428572) internal successors, (156), 146 states have internal predecessors, (156), 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-18 20:08:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2022-11-18 20:08:57,659 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 12 [2022-11-18 20:08:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:57,659 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2022-11-18 20:08:57,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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-18 20:08:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2022-11-18 20:08:57,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 20:08:57,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:57,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:08:57,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 20:08:57,660 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:08:57,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:57,661 INFO L85 PathProgramCache]: Analyzing trace with hash -451673556, now seen corresponding path program 1 times [2022-11-18 20:08:57,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:57,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820050599] [2022-11-18 20:08:57,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:57,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:08:57,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:57,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820050599] [2022-11-18 20:08:57,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820050599] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:57,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:57,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:08:57,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873024754] [2022-11-18 20:08:57,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:57,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:08:57,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:57,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:08:57,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:08:57,741 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-18 20:08:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:57,895 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2022-11-18 20:08:57,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:08:57,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-11-18 20:08:57,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:57,897 INFO L225 Difference]: With dead ends: 146 [2022-11-18 20:08:57,897 INFO L226 Difference]: Without dead ends: 146 [2022-11-18 20:08:57,897 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-18 20:08:57,898 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 8 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:57,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 483 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:08:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-18 20:08:57,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-11-18 20:08:57,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 84 states have (on average 1.8452380952380953) internal successors, (155), 145 states have internal predecessors, (155), 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-18 20:08:57,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 155 transitions. [2022-11-18 20:08:57,902 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 155 transitions. Word has length 13 [2022-11-18 20:08:57,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:57,903 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 155 transitions. [2022-11-18 20:08:57,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-18 20:08:57,903 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 155 transitions. [2022-11-18 20:08:57,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-18 20:08:57,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:57,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:08:57,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 20:08:57,905 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:08:57,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:57,905 INFO L85 PathProgramCache]: Analyzing trace with hash -451673555, now seen corresponding path program 1 times [2022-11-18 20:08:57,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:57,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261095129] [2022-11-18 20:08:57,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:57,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:08:58,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:58,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261095129] [2022-11-18 20:08:58,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261095129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:58,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:58,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:08:58,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115239550] [2022-11-18 20:08:58,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:58,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:08:58,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:58,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:08:58,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:08:58,297 INFO L87 Difference]: Start difference. First operand 146 states and 155 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-18 20:08:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:58,584 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2022-11-18 20:08:58,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 20:08:58,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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 13 [2022-11-18 20:08:58,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:58,585 INFO L225 Difference]: With dead ends: 145 [2022-11-18 20:08:58,585 INFO L226 Difference]: Without dead ends: 145 [2022-11-18 20:08:58,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:08:58,586 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 14 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:58,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 476 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:08:58,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-18 20:08:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-11-18 20:08:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 84 states have (on average 1.8333333333333333) internal successors, (154), 144 states have internal predecessors, (154), 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-18 20:08:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2022-11-18 20:08:58,590 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 13 [2022-11-18 20:08:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:58,590 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2022-11-18 20:08:58,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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-18 20:08:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2022-11-18 20:08:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 20:08:58,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:58,591 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-18 20:08:58,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 20:08:58,592 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:08:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:58,592 INFO L85 PathProgramCache]: Analyzing trace with hash -598729444, now seen corresponding path program 1 times [2022-11-18 20:08:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:58,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470188266] [2022-11-18 20:08:58,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:58,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:08:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:08:59,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:08:59,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470188266] [2022-11-18 20:08:59,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470188266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:08:59,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:08:59,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 20:08:59,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049494458] [2022-11-18 20:08:59,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:08:59,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 20:08:59,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:08:59,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 20:08:59,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:08:59,036 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 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-18 20:08:59,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:08:59,444 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2022-11-18 20:08:59,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:08:59,448 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 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-18 20:08:59,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:08:59,449 INFO L225 Difference]: With dead ends: 144 [2022-11-18 20:08:59,450 INFO L226 Difference]: Without dead ends: 144 [2022-11-18 20:08:59,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:08:59,451 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 28 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-18 20:08:59,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 752 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-18 20:08:59,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-18 20:08:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-11-18 20:08:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 84 states have (on average 1.8214285714285714) internal successors, (153), 143 states have internal predecessors, (153), 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-18 20:08:59,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2022-11-18 20:08:59,455 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 18 [2022-11-18 20:08:59,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:08:59,455 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2022-11-18 20:08:59,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 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-18 20:08:59,456 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2022-11-18 20:08:59,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-18 20:08:59,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:08:59,456 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-18 20:08:59,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 20:08:59,457 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:08:59,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:08:59,458 INFO L85 PathProgramCache]: Analyzing trace with hash -598729443, now seen corresponding path program 1 times [2022-11-18 20:08:59,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:08:59,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82104896] [2022-11-18 20:08:59,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:08:59,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:08:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:00,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:00,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82104896] [2022-11-18 20:09:00,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82104896] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:00,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:00,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 20:09:00,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666537241] [2022-11-18 20:09:00,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:00,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 20:09:00,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:00,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 20:09:00,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-11-18 20:09:00,023 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 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-18 20:09:00,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:00,617 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2022-11-18 20:09:00,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 20:09:00,618 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 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-18 20:09:00,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:00,619 INFO L225 Difference]: With dead ends: 143 [2022-11-18 20:09:00,619 INFO L226 Difference]: Without dead ends: 143 [2022-11-18 20:09:00,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:09:00,620 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 24 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:00,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 937 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:09:00,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-18 20:09:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-11-18 20:09:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 84 states have (on average 1.8095238095238095) internal successors, (152), 142 states have internal predecessors, (152), 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-18 20:09:00,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2022-11-18 20:09:00,623 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 18 [2022-11-18 20:09:00,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:00,623 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2022-11-18 20:09:00,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 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-18 20:09:00,624 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2022-11-18 20:09:00,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 20:09:00,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:00,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:00,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:09:00,625 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:00,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:00,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1380743565, now seen corresponding path program 1 times [2022-11-18 20:09:00,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:00,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595763570] [2022-11-18 20:09:00,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:00,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:00,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:00,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:00,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595763570] [2022-11-18 20:09:00,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595763570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:00,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:00,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:09:00,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475551457] [2022-11-18 20:09:00,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:00,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:09:00,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:00,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:09:00,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:09:00,702 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:09:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:00,850 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2022-11-18 20:09:00,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 20:09:00,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-18 20:09:00,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:00,852 INFO L225 Difference]: With dead ends: 142 [2022-11-18 20:09:00,852 INFO L226 Difference]: Without dead ends: 142 [2022-11-18 20:09:00,852 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-18 20:09:00,853 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 12 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:00,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 469 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:09:00,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-11-18 20:09:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-11-18 20:09:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 84 states have (on average 1.7976190476190477) internal successors, (151), 141 states have internal predecessors, (151), 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-18 20:09:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2022-11-18 20:09:00,856 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 19 [2022-11-18 20:09:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:00,856 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2022-11-18 20:09:00,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:09:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2022-11-18 20:09:00,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-18 20:09:00,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:00,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 20:09:00,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 20:09:00,858 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:00,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:00,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1380743564, now seen corresponding path program 1 times [2022-11-18 20:09:00,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:00,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507092404] [2022-11-18 20:09:00,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:00,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:01,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:01,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507092404] [2022-11-18 20:09:01,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507092404] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:01,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:01,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-18 20:09:01,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769404616] [2022-11-18 20:09:01,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:01,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:09:01,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:01,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:09:01,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:09:01,537 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:09:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:01,898 INFO L93 Difference]: Finished difference Result 141 states and 150 transitions. [2022-11-18 20:09:01,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:09:01,898 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-18 20:09:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:01,899 INFO L225 Difference]: With dead ends: 141 [2022-11-18 20:09:01,899 INFO L226 Difference]: Without dead ends: 141 [2022-11-18 20:09:01,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:09:01,900 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 35 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:01,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 611 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:09:01,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-18 20:09:01,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-11-18 20:09:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 84 states have (on average 1.7857142857142858) internal successors, (150), 140 states have internal predecessors, (150), 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-18 20:09:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 150 transitions. [2022-11-18 20:09:01,903 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 150 transitions. Word has length 19 [2022-11-18 20:09:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:01,904 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 150 transitions. [2022-11-18 20:09:01,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:09:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 150 transitions. [2022-11-18 20:09:01,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 20:09:01,904 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:01,904 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-18 20:09:01,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 20:09:01,905 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:01,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:01,906 INFO L85 PathProgramCache]: Analyzing trace with hash 146622463, now seen corresponding path program 1 times [2022-11-18 20:09:01,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:01,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058330527] [2022-11-18 20:09:01,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:01,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:01,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:01,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058330527] [2022-11-18 20:09:01,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058330527] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:01,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:01,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 20:09:01,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840725750] [2022-11-18 20:09:01,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:01,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 20:09:01,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:01,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 20:09:01,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-18 20:09:01,983 INFO L87 Difference]: Start difference. First operand 141 states and 150 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-18 20:09:02,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:02,116 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2022-11-18 20:09:02,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:09:02,117 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-18 20:09:02,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:02,117 INFO L225 Difference]: With dead ends: 140 [2022-11-18 20:09:02,117 INFO L226 Difference]: Without dead ends: 140 [2022-11-18 20:09:02,118 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-18 20:09:02,118 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 7 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:02,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 465 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:09:02,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-18 20:09:02,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-11-18 20:09:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 139 states have internal predecessors, (149), 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-18 20:09:02,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2022-11-18 20:09:02,121 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 20 [2022-11-18 20:09:02,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:02,121 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2022-11-18 20:09:02,122 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-18 20:09:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2022-11-18 20:09:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-18 20:09:02,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:02,122 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-18 20:09:02,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 20:09:02,123 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:02,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:02,123 INFO L85 PathProgramCache]: Analyzing trace with hash 146622464, now seen corresponding path program 1 times [2022-11-18 20:09:02,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:02,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975487549] [2022-11-18 20:09:02,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:02,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:02,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:02,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975487549] [2022-11-18 20:09:02,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975487549] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:02,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:02,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-18 20:09:02,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231955435] [2022-11-18 20:09:02,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:02,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 20:09:02,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:02,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 20:09:02,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-18 20:09:02,772 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 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-18 20:09:03,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:03,263 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2022-11-18 20:09:03,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:09:03,264 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 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-18 20:09:03,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:03,265 INFO L225 Difference]: With dead ends: 139 [2022-11-18 20:09:03,265 INFO L226 Difference]: Without dead ends: 139 [2022-11-18 20:09:03,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:09:03,266 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 32 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:03,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 841 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:09:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-18 20:09:03,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-11-18 20:09:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 84 states have (on average 1.7619047619047619) internal successors, (148), 138 states have internal predecessors, (148), 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-18 20:09:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 148 transitions. [2022-11-18 20:09:03,269 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 148 transitions. Word has length 20 [2022-11-18 20:09:03,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:03,269 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 148 transitions. [2022-11-18 20:09:03,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 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-18 20:09:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 148 transitions. [2022-11-18 20:09:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:09:03,270 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:03,270 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-18 20:09:03,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-18 20:09:03,273 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:03,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1043484996, now seen corresponding path program 1 times [2022-11-18 20:09:03,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:03,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711152698] [2022-11-18 20:09:03,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:03,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:03,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:03,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711152698] [2022-11-18 20:09:03,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711152698] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:03,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:03,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:09:03,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340041589] [2022-11-18 20:09:03,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:03,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:09:03,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:03,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:09:03,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:09:03,398 INFO L87 Difference]: Start difference. First operand 139 states and 148 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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-18 20:09:03,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:03,635 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2022-11-18 20:09:03,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:09:03,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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-18 20:09:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:03,637 INFO L225 Difference]: With dead ends: 200 [2022-11-18 20:09:03,637 INFO L226 Difference]: Without dead ends: 200 [2022-11-18 20:09:03,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:09:03,638 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 478 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:03,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 172 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:09:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-18 20:09:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 137. [2022-11-18 20:09:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.7380952380952381) internal successors, (146), 136 states have internal predecessors, (146), 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-18 20:09:03,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 146 transitions. [2022-11-18 20:09:03,641 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 146 transitions. Word has length 25 [2022-11-18 20:09:03,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:03,642 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 146 transitions. [2022-11-18 20:09:03,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 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-18 20:09:03,642 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2022-11-18 20:09:03,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 20:09:03,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:03,642 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-18 20:09:03,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-18 20:09:03,643 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:03,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1043484995, now seen corresponding path program 1 times [2022-11-18 20:09:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:03,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431863142] [2022-11-18 20:09:03,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:03,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:03,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:03,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:03,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431863142] [2022-11-18 20:09:03,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431863142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:03,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:03,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:09:03,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581688768] [2022-11-18 20:09:03,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:03,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:09:03,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:03,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:09:03,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:09:03,834 INFO L87 Difference]: Start difference. First operand 137 states and 146 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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-18 20:09:04,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:04,066 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2022-11-18 20:09:04,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:09:04,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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-18 20:09:04,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:04,067 INFO L225 Difference]: With dead ends: 171 [2022-11-18 20:09:04,067 INFO L226 Difference]: Without dead ends: 171 [2022-11-18 20:09:04,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:09:04,068 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 626 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:04,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 134 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:09:04,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-18 20:09:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 135. [2022-11-18 20:09:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 84 states have (on average 1.7142857142857142) internal successors, (144), 134 states have internal predecessors, (144), 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-18 20:09:04,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 144 transitions. [2022-11-18 20:09:04,071 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 144 transitions. Word has length 25 [2022-11-18 20:09:04,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:04,072 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 144 transitions. [2022-11-18 20:09:04,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 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-18 20:09:04,072 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 144 transitions. [2022-11-18 20:09:04,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:09:04,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:04,073 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-18 20:09:04,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-18 20:09:04,073 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:04,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:04,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2011706153, now seen corresponding path program 1 times [2022-11-18 20:09:04,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:04,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473703751] [2022-11-18 20:09:04,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:04,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:04,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:04,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:04,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473703751] [2022-11-18 20:09:04,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473703751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:04,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:04,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:09:04,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067203523] [2022-11-18 20:09:04,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:04,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:09:04,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:04,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:09:04,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:09:04,167 INFO L87 Difference]: Start difference. First operand 135 states and 144 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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-18 20:09:04,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:04,392 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2022-11-18 20:09:04,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 20:09:04,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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-18 20:09:04,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:04,394 INFO L225 Difference]: With dead ends: 156 [2022-11-18 20:09:04,394 INFO L226 Difference]: Without dead ends: 156 [2022-11-18 20:09:04,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:09:04,395 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 384 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:04,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 164 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:09:04,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-18 20:09:04,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 132. [2022-11-18 20:09:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 85 states have (on average 1.6705882352941177) internal successors, (142), 131 states have internal predecessors, (142), 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-18 20:09:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2022-11-18 20:09:04,399 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 26 [2022-11-18 20:09:04,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:04,400 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2022-11-18 20:09:04,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 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-18 20:09:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2022-11-18 20:09:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-18 20:09:04,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:04,401 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-18 20:09:04,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 20:09:04,401 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:04,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:04,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2011706154, now seen corresponding path program 1 times [2022-11-18 20:09:04,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:04,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481185013] [2022-11-18 20:09:04,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:04,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:04,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:04,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481185013] [2022-11-18 20:09:04,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481185013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:04,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:04,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 20:09:04,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087220512] [2022-11-18 20:09:04,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:04,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 20:09:04,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:04,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 20:09:04,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 20:09:04,574 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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-18 20:09:04,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:04,788 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-11-18 20:09:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:09:04,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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-18 20:09:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:04,789 INFO L225 Difference]: With dead ends: 127 [2022-11-18 20:09:04,789 INFO L226 Difference]: Without dead ends: 127 [2022-11-18 20:09:04,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:09:04,790 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 378 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:04,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 124 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 20:09:04,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-18 20:09:04,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-18 20:09:04,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 85 states have (on average 1.6) internal successors, (136), 126 states have internal predecessors, (136), 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-18 20:09:04,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 136 transitions. [2022-11-18 20:09:04,793 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 136 transitions. Word has length 26 [2022-11-18 20:09:04,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:04,793 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 136 transitions. [2022-11-18 20:09:04,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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-18 20:09:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 136 transitions. [2022-11-18 20:09:04,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-18 20:09:04,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:04,794 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-18 20:09:04,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-18 20:09:04,794 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:04,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:04,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2061699999, now seen corresponding path program 1 times [2022-11-18 20:09:04,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:04,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641108824] [2022-11-18 20:09:04,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:04,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:05,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:05,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641108824] [2022-11-18 20:09:05,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641108824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:05,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:05,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-11-18 20:09:05,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076482985] [2022-11-18 20:09:05,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:05,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 20:09:05,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:05,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 20:09:05,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:09:05,585 INFO L87 Difference]: Start difference. First operand 127 states and 136 transitions. Second operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 21 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-18 20:09:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:06,793 INFO L93 Difference]: Finished difference Result 209 states and 226 transitions. [2022-11-18 20:09:06,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 20:09:06,799 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 21 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-18 20:09:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:06,800 INFO L225 Difference]: With dead ends: 209 [2022-11-18 20:09:06,800 INFO L226 Difference]: Without dead ends: 209 [2022-11-18 20:09:06,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2022-11-18 20:09:06,801 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 574 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:06,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 1076 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:09:06,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-11-18 20:09:06,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 128. [2022-11-18 20:09:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 127 states have internal predecessors, (139), 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-18 20:09:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2022-11-18 20:09:06,805 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 27 [2022-11-18 20:09:06,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:06,805 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2022-11-18 20:09:06,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 21 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-18 20:09:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2022-11-18 20:09:06,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-18 20:09:06,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:06,806 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-18 20:09:06,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-18 20:09:06,806 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:06,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:06,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2061699998, now seen corresponding path program 1 times [2022-11-18 20:09:06,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:06,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77656631] [2022-11-18 20:09:06,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:06,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:07,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:07,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:07,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77656631] [2022-11-18 20:09:07,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77656631] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:07,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:07,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-11-18 20:09:07,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712190154] [2022-11-18 20:09:07,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:07,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-18 20:09:07,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:07,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-18 20:09:07,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2022-11-18 20:09:07,976 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 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-18 20:09:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:09,577 INFO L93 Difference]: Finished difference Result 281 states and 306 transitions. [2022-11-18 20:09:09,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 20:09:09,577 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 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-18 20:09:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:09,579 INFO L225 Difference]: With dead ends: 281 [2022-11-18 20:09:09,579 INFO L226 Difference]: Without dead ends: 281 [2022-11-18 20:09:09,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2022-11-18 20:09:09,580 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 905 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:09,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1105 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-18 20:09:09,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-11-18 20:09:09,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 166. [2022-11-18 20:09:09,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 128 states have (on average 1.625) internal successors, (208), 165 states have internal predecessors, (208), 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-18 20:09:09,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2022-11-18 20:09:09,585 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 208 transitions. Word has length 27 [2022-11-18 20:09:09,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:09,586 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 208 transitions. [2022-11-18 20:09:09,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 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-18 20:09:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 208 transitions. [2022-11-18 20:09:09,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-18 20:09:09,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:09,587 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] [2022-11-18 20:09:09,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-18 20:09:09,587 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:09,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1235458799, now seen corresponding path program 1 times [2022-11-18 20:09:09,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:09,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57830832] [2022-11-18 20:09:09,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:09,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:09,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:09,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57830832] [2022-11-18 20:09:09,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57830832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:09,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:09,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-18 20:09:09,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885866681] [2022-11-18 20:09:09,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:09,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 20:09:09,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:09,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 20:09:09,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 20:09:09,690 INFO L87 Difference]: Start difference. First operand 166 states and 208 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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-18 20:09:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:09,772 INFO L93 Difference]: Finished difference Result 165 states and 207 transitions. [2022-11-18 20:09:09,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 20:09:09,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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 29 [2022-11-18 20:09:09,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:09,775 INFO L225 Difference]: With dead ends: 165 [2022-11-18 20:09:09,775 INFO L226 Difference]: Without dead ends: 165 [2022-11-18 20:09:09,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-18 20:09:09,777 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 345 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:09,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 212 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:09:09,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-18 20:09:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-11-18 20:09:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 128 states have (on average 1.6171875) internal successors, (207), 164 states have internal predecessors, (207), 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-18 20:09:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 207 transitions. [2022-11-18 20:09:09,782 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 207 transitions. Word has length 29 [2022-11-18 20:09:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:09,782 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 207 transitions. [2022-11-18 20:09:09,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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-18 20:09:09,783 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 207 transitions. [2022-11-18 20:09:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-18 20:09:09,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:09,785 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] [2022-11-18 20:09:09,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-18 20:09:09,785 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:09,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:09,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1863814087, now seen corresponding path program 1 times [2022-11-18 20:09:09,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:09,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658497641] [2022-11-18 20:09:09,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:09,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:10,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:10,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658497641] [2022-11-18 20:09:10,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658497641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:10,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:10,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-18 20:09:10,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519060670] [2022-11-18 20:09:10,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:10,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-18 20:09:10,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:10,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-18 20:09:10,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2022-11-18 20:09:10,537 INFO L87 Difference]: Start difference. First operand 165 states and 207 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 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-18 20:09:11,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:11,440 INFO L93 Difference]: Finished difference Result 224 states and 272 transitions. [2022-11-18 20:09:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:09:11,441 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-18 20:09:11,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:11,444 INFO L225 Difference]: With dead ends: 224 [2022-11-18 20:09:11,444 INFO L226 Difference]: Without dead ends: 224 [2022-11-18 20:09:11,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2022-11-18 20:09:11,450 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 431 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:11,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 904 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-18 20:09:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-18 20:09:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 172. [2022-11-18 20:09:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.6) internal successors, (216), 171 states have internal predecessors, (216), 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-18 20:09:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 216 transitions. [2022-11-18 20:09:11,455 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 216 transitions. Word has length 31 [2022-11-18 20:09:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:11,456 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 216 transitions. [2022-11-18 20:09:11,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 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-18 20:09:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 216 transitions. [2022-11-18 20:09:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-18 20:09:11,457 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:11,457 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] [2022-11-18 20:09:11,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-18 20:09:11,458 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:11,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:11,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1863814086, now seen corresponding path program 1 times [2022-11-18 20:09:11,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:11,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747210945] [2022-11-18 20:09:11,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:11,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:12,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:12,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:12,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747210945] [2022-11-18 20:09:12,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747210945] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:12,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:12,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-11-18 20:09:12,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198328680] [2022-11-18 20:09:12,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:12,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-18 20:09:12,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:12,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-18 20:09:12,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-11-18 20:09:12,686 INFO L87 Difference]: Start difference. First operand 172 states and 216 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 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-18 20:09:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:14,044 INFO L93 Difference]: Finished difference Result 224 states and 272 transitions. [2022-11-18 20:09:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:09:14,044 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-18 20:09:14,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:14,046 INFO L225 Difference]: With dead ends: 224 [2022-11-18 20:09:14,046 INFO L226 Difference]: Without dead ends: 224 [2022-11-18 20:09:14,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2022-11-18 20:09:14,048 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 375 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:14,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 936 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:09:14,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-11-18 20:09:14,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 172. [2022-11-18 20:09:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.5925925925925926) internal successors, (215), 171 states have internal predecessors, (215), 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-18 20:09:14,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 215 transitions. [2022-11-18 20:09:14,060 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 215 transitions. Word has length 31 [2022-11-18 20:09:14,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:14,061 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 215 transitions. [2022-11-18 20:09:14,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 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-18 20:09:14,061 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 215 transitions. [2022-11-18 20:09:14,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-18 20:09:14,066 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:14,067 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-18 20:09:14,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-18 20:09:14,067 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1978046457, now seen corresponding path program 1 times [2022-11-18 20:09:14,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:14,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054193990] [2022-11-18 20:09:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:14,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:14,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:14,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:14,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054193990] [2022-11-18 20:09:14,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054193990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:14,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:14,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-18 20:09:14,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173533867] [2022-11-18 20:09:14,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:14,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-18 20:09:14,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:14,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-18 20:09:14,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2022-11-18 20:09:14,839 INFO L87 Difference]: Start difference. First operand 172 states and 215 transitions. Second operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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-18 20:09:15,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:15,770 INFO L93 Difference]: Finished difference Result 217 states and 265 transitions. [2022-11-18 20:09:15,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-18 20:09:15,770 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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-18 20:09:15,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:15,771 INFO L225 Difference]: With dead ends: 217 [2022-11-18 20:09:15,771 INFO L226 Difference]: Without dead ends: 217 [2022-11-18 20:09:15,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2022-11-18 20:09:15,773 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 277 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:15,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1318 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-18 20:09:15,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-18 20:09:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 172. [2022-11-18 20:09:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 135 states have (on average 1.5851851851851853) internal successors, (214), 171 states have internal predecessors, (214), 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-18 20:09:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 214 transitions. [2022-11-18 20:09:15,786 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 214 transitions. Word has length 32 [2022-11-18 20:09:15,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:15,787 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 214 transitions. [2022-11-18 20:09:15,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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-18 20:09:15,787 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 214 transitions. [2022-11-18 20:09:15,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-18 20:09:15,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:15,788 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, 1] [2022-11-18 20:09:15,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-18 20:09:15,788 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:15,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:15,789 INFO L85 PathProgramCache]: Analyzing trace with hash 190378255, now seen corresponding path program 1 times [2022-11-18 20:09:15,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:15,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986948055] [2022-11-18 20:09:15,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:15,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:15,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:15,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986948055] [2022-11-18 20:09:15,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986948055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:15,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:15,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:09:15,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847307903] [2022-11-18 20:09:15,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:15,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 20:09:15,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:15,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 20:09:15,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 20:09:15,876 INFO L87 Difference]: Start difference. First operand 172 states and 214 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:09:16,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:16,017 INFO L93 Difference]: Finished difference Result 189 states and 229 transitions. [2022-11-18 20:09:16,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 20:09:16,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-18 20:09:16,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:16,019 INFO L225 Difference]: With dead ends: 189 [2022-11-18 20:09:16,019 INFO L226 Difference]: Without dead ends: 189 [2022-11-18 20:09:16,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-18 20:09:16,020 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 169 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:16,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 150 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 20:09:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-18 20:09:16,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 170. [2022-11-18 20:09:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 137 states have (on average 1.532846715328467) internal successors, (210), 169 states have internal predecessors, (210), 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-18 20:09:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 210 transitions. [2022-11-18 20:09:16,024 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 210 transitions. Word has length 33 [2022-11-18 20:09:16,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:16,025 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 210 transitions. [2022-11-18 20:09:16,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:09:16,025 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 210 transitions. [2022-11-18 20:09:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-18 20:09:16,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:16,025 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, 1] [2022-11-18 20:09:16,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-18 20:09:16,026 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:16,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:16,026 INFO L85 PathProgramCache]: Analyzing trace with hash 190378256, now seen corresponding path program 1 times [2022-11-18 20:09:16,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:16,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063669854] [2022-11-18 20:09:16,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:16,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:17,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:17,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:17,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063669854] [2022-11-18 20:09:17,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063669854] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:17,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:17,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-11-18 20:09:17,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420929459] [2022-11-18 20:09:17,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:17,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-18 20:09:17,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:17,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-18 20:09:17,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2022-11-18 20:09:17,030 INFO L87 Difference]: Start difference. First operand 170 states and 210 transitions. Second operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:09:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:18,215 INFO L93 Difference]: Finished difference Result 282 states and 313 transitions. [2022-11-18 20:09:18,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:09:18,216 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-18 20:09:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:18,217 INFO L225 Difference]: With dead ends: 282 [2022-11-18 20:09:18,217 INFO L226 Difference]: Without dead ends: 282 [2022-11-18 20:09:18,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=1449, Unknown=0, NotChecked=0, Total=1722 [2022-11-18 20:09:18,219 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1036 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:18,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1026 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-18 20:09:18,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-18 20:09:18,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 183. [2022-11-18 20:09:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 150 states have (on average 1.5333333333333334) internal successors, (230), 182 states have internal predecessors, (230), 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-18 20:09:18,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 230 transitions. [2022-11-18 20:09:18,237 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 230 transitions. Word has length 33 [2022-11-18 20:09:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:18,237 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 230 transitions. [2022-11-18 20:09:18,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 20:09:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 230 transitions. [2022-11-18 20:09:18,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 20:09:18,238 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:18,238 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, 1, 1] [2022-11-18 20:09:18,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-18 20:09:18,238 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:18,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:18,239 INFO L85 PathProgramCache]: Analyzing trace with hash 451934574, now seen corresponding path program 1 times [2022-11-18 20:09:18,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:18,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747606677] [2022-11-18 20:09:18,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:18,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:19,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:19,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747606677] [2022-11-18 20:09:19,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747606677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:19,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:19,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-11-18 20:09:19,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269626872] [2022-11-18 20:09:19,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:19,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-18 20:09:19,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:19,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-18 20:09:19,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2022-11-18 20:09:19,217 INFO L87 Difference]: Start difference. First operand 183 states and 230 transitions. Second operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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-18 20:09:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 20:09:20,003 INFO L93 Difference]: Finished difference Result 238 states and 292 transitions. [2022-11-18 20:09:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 20:09:20,004 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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 34 [2022-11-18 20:09:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 20:09:20,005 INFO L225 Difference]: With dead ends: 238 [2022-11-18 20:09:20,005 INFO L226 Difference]: Without dead ends: 238 [2022-11-18 20:09:20,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2022-11-18 20:09:20,008 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 418 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-18 20:09:20,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 854 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-18 20:09:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-11-18 20:09:20,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 186. [2022-11-18 20:09:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 153 states have (on average 1.522875816993464) internal successors, (233), 185 states have internal predecessors, (233), 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-18 20:09:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 233 transitions. [2022-11-18 20:09:20,014 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 233 transitions. Word has length 34 [2022-11-18 20:09:20,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 20:09:20,014 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 233 transitions. [2022-11-18 20:09:20,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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-18 20:09:20,015 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 233 transitions. [2022-11-18 20:09:20,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 20:09:20,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 20:09:20,015 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, 1, 1] [2022-11-18 20:09:20,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-18 20:09:20,016 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-11-18 20:09:20,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:20,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1606811227, now seen corresponding path program 1 times [2022-11-18 20:09:20,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:20,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708056980] [2022-11-18 20:09:20,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:20,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:22,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:22,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:22,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708056980] [2022-11-18 20:09:22,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708056980] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:22,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584893758] [2022-11-18 20:09:22,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:22,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:22,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:22,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:22,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2583a664-1667-42ec-bca0-f984f451e7ff/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:09:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:22,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-18 20:09:22,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:22,586 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:09:22,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-11-18 20:09:22,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-18 20:09:22,773 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-18 20:09:22,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-11-18 20:09:22,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:22,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-18 20:09:23,476 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:09:23,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 81 [2022-11-18 20:09:23,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-18 20:09:23,635 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 20:09:23,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 76 [2022-11-18 20:09:23,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-18 20:09:23,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:23,808 INFO L321 Elim1Store]: treesize reduction 74, result has 18.7 percent of original size [2022-11-18 20:09:23,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 61 [2022-11-18 20:09:23,817 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 93 treesize of output 89 [2022-11-18 20:09:24,317 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-18 20:09:24,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 119 [2022-11-18 20:09:24,342 INFO L321 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-11-18 20:09:24,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 91 [2022-11-18 20:09:24,407 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-18 20:09:24,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 112 [2022-11-18 20:09:24,428 INFO L321 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-11-18 20:09:24,429 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 95 treesize of output 91 [2022-11-18 20:09:24,480 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-18 20:09:24,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 105 [2022-11-18 20:09:24,499 INFO L321 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-11-18 20:09:24,499 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 95 treesize of output 91 [2022-11-18 20:09:24,888 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 88 treesize of output 68 [2022-11-18 20:09:25,369 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-11-18 20:09:25,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 32 [2022-11-18 20:09:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 20:09:25,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:09:26,013 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))) 1)) is different from false [2022-11-18 20:09:26,026 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1282) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1281) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))) 1)) is different from false [2022-11-18 20:09:26,043 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.base| v_ArrVal_1279) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1282) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem13#1.base| v_ArrVal_1280) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1281) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))) 1)) is different from false [2022-11-18 20:09:26,065 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1279) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1282) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1280) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem12#1.base| v_ArrVal_1281) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) 1)) is different from false [2022-11-18 20:09:26,077 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int)) (v_ArrVal_1281 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1282) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1281) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8)))) 1)) is different from false [2022-11-18 20:09:26,088 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))))) is different from false [2022-11-18 20:09:26,105 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))))) 1)) is different from false [2022-11-18 20:09:26,121 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1275))) (store .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1274) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8))))) 1)) is different from false [2022-11-18 20:09:26,138 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1272) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1275))) (store .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1273) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1274) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))))) 1)) is different from false [2022-11-18 20:09:26,160 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse3 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse1 (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1272) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1275))) (store .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse3))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#1.base| v_ArrVal_1273) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1274) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 8)))))) 1)) is different from false [2022-11-18 20:09:26,184 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse3 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse5 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1272) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1275))) (store .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) (select .cse6 .cse4)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1273) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_1274) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))))))) 1)) is different from false [2022-11-18 20:09:26,204 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1275 (Array Int Int)) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int))) (= (select |c_#valid| (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse3 (select .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1275))) (store .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| (store (select .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base|) (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.offset| 8) (select .cse6 .cse4)))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_1284))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1274) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_1278) .cse2 v_ArrVal_1283) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)))))))) 1)) is different from false [2022-11-18 20:09:26,212 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 644 treesize of output 560 [2022-11-18 20:09:26,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:26,231 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 560 treesize of output 354 [2022-11-18 20:09:26,238 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 170 treesize of output 168 [2022-11-18 20:09:26,244 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 338 treesize of output 334 [2022-11-18 20:09:26,566 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse35 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse0 (select .cse35 .cse4)) (.cse5 (select .cse35 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse10 (= .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (.cse9 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse34 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (let ((.cse32 (select (select .cse34 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (not (= .cse32 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1284 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse33 (store .cse34 .cse32 v_ArrVal_1284))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 v_arrayElimCell_28))) 1)) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) .cse0)))))))) (and (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) .cse0)) (= .cse1 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (forall ((v_arrayElimCell_27 Int) (v_ArrVal_1284 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse2 (store .cse3 .cse1 v_ArrVal_1284))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 v_arrayElimCell_27))) 1)))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (or (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) .cse0)) (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse6 (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (store .cse8 (select (select .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4) v_ArrVal_1284)))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse6 (+ 8 v_arrayElimCell_28))) 1) (forall ((v_arrayElimCell_27 Int)) (= (select |c_#valid| (select .cse6 (+ 8 v_arrayElimCell_27))) 1))))))) .cse9) (not .cse10)) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (let ((.cse12 (+ 8 v_arrayElimCell_26)) (.cse15 (select (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (forall ((v_arrayElimCell_27 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse11 (let ((.cse13 (store .cse14 .cse15 v_ArrVal_1284))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse11 .cse12)) 1) (= (select |c_#valid| (select .cse11 (+ 8 v_arrayElimCell_27))) 1)))) (not (= (select v_arrayElimArr_1 .cse12) .cse0)) (= .cse15 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))))) (or .cse10 (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse16 (+ 8 v_arrayElimCell_26))) (or (not (= (select v_arrayElimArr_1 .cse16) .cse0)) (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse17 (let ((.cse18 (let ((.cse19 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4) v_ArrVal_1284)))) (select .cse18 (select (select .cse18 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse17 (+ 8 v_arrayElimCell_28))) 1) (= (select |c_#valid| (select .cse17 .cse16)) 1))))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse23 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (let ((.cse21 (select (select .cse23 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4)) (.cse20 (+ 8 v_arrayElimCell_26))) (or (not (= (select v_arrayElimArr_1 .cse20) .cse0)) (= .cse21 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (forall ((v_ArrVal_1284 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse22 (store .cse23 .cse21 v_ArrVal_1284))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) .cse20)) 1)))))) .cse9)) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse26 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (let ((.cse27 (select (select .cse26 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4))) (or (forall ((v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse24 (let ((.cse25 (store .cse26 .cse27 v_ArrVal_1284))) (select .cse25 (select (select .cse25 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse24 (+ 8 v_arrayElimCell_28))) 1) (= (select |c_#valid| (select .cse24 (+ 8 v_arrayElimCell_27))) 1)))) (not (= .cse27 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) .cse0)))))) .cse9 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse28 (+ 8 v_arrayElimCell_26))) (or (not (= (select v_arrayElimArr_1 .cse28) .cse0)) (forall ((v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse29 (let ((.cse30 (let ((.cse31 (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_1))) (store .cse31 (select (select .cse31 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse4) v_ArrVal_1284)))) (select .cse30 (select (select .cse30 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse29 (+ 8 v_arrayElimCell_28))) 1) (= (select |c_#valid| (select .cse29 .cse28)) 1) (= (select |c_#valid| (select .cse29 (+ 8 v_arrayElimCell_27))) 1))))))))))) is different from false [2022-11-18 20:09:27,001 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse35 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (store .cse35 .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))) (.cse7 (select .cse35 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse8 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse34 (store .cse6 .cse7 v_arrayElimArr_1))) (let ((.cse32 (select (select .cse34 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (not (= .cse32 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1284 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse33 (store .cse34 .cse32 v_ArrVal_1284))) (select .cse33 (select (select .cse33 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 v_arrayElimCell_28))) 1)) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))))))) (.cse0 (= .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (and (or .cse0 (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse2 (+ 8 v_arrayElimCell_26))) (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store .cse6 .cse7 v_arrayElimArr_1))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5) v_ArrVal_1284)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse1 (+ 8 v_arrayElimCell_28))) 1) (= (select |c_#valid| (select .cse1 .cse2)) 1)))) (not (= (select v_arrayElimArr_1 .cse2) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))))) .cse8 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse11 (store .cse6 .cse7 v_arrayElimArr_1))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5)) (.cse12 (+ 8 v_arrayElimCell_26))) (or (= .cse9 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (forall ((v_ArrVal_1284 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse10 (store .cse11 .cse9 v_ArrVal_1284))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) .cse12)) 1)) (not (= (select v_arrayElimArr_1 .cse12) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse16 (store .cse6 .cse7 v_arrayElimArr_1))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5)) (.cse14 (+ 8 v_arrayElimCell_26))) (or (forall ((v_arrayElimCell_27 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse13 (let ((.cse15 (store .cse16 .cse17 v_ArrVal_1284))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse13 (+ 8 v_arrayElimCell_27))) 1) (= (select |c_#valid| (select .cse13 .cse14)) 1)))) (= .cse17 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (not (= (select v_arrayElimArr_1 .cse14) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse20 (store .cse6 .cse7 v_arrayElimArr_1))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (forall ((v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse18 (let ((.cse19 (store .cse20 .cse21 v_ArrVal_1284))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse18 (+ 8 v_arrayElimCell_28))) 1) (= (select |c_#valid| (select .cse18 (+ 8 v_arrayElimCell_27))) 1)))) (not (= .cse21 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))) .cse8 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse23 (+ 8 v_arrayElimCell_26))) (or (forall ((v_arrayElimCell_28 Int) (v_arrayElimCell_27 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse22 (let ((.cse24 (let ((.cse25 (store .cse6 .cse7 v_arrayElimArr_1))) (store .cse25 (select (select .cse25 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5) v_ArrVal_1284)))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse22 (+ 8 v_arrayElimCell_28))) 1) (= (select |c_#valid| (select .cse22 (+ 8 v_arrayElimCell_27))) 1) (= (select |c_#valid| (select .cse22 .cse23)) 1)))) (not (= (select v_arrayElimArr_1 .cse23) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))))) (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (or (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)) (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1284 (Array Int Int))) (let ((.cse26 (let ((.cse27 (let ((.cse28 (store .cse6 .cse7 v_arrayElimArr_1))) (store .cse28 (select (select .cse28 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5) v_ArrVal_1284)))) (select .cse27 (select (select .cse27 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))))) (or (= (select |c_#valid| (select .cse26 (+ 8 v_arrayElimCell_28))) 1) (forall ((v_arrayElimCell_27 Int)) (= (select |c_#valid| (select .cse26 (+ 8 v_arrayElimCell_27))) 1))))))) .cse8 (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_26 Int)) (let ((.cse30 (store .cse6 .cse7 v_arrayElimArr_1))) (let ((.cse31 (select (select .cse30 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (forall ((v_arrayElimCell_27 Int) (v_ArrVal_1284 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse29 (store .cse30 .cse31 v_ArrVal_1284))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ 8 v_arrayElimCell_27))) 1)) (= .cse31 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (not (= (select v_arrayElimArr_1 (+ 8 v_arrayElimCell_26)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))))))) (not .cse0)))))) is different from false [2022-11-18 20:09:28,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:09:28,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:28,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 87 [2022-11-18 20:09:28,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:28,244 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-11-18 20:09:28,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 347 treesize of output 378 [2022-11-18 20:09:28,294 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:28,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 369 treesize of output 273 [2022-11-18 20:09:28,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:28,316 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 218 treesize of output 202 [2022-11-18 20:09:29,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:09:29,224 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:29,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 88 [2022-11-18 20:09:29,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:29,305 INFO L321 Elim1Store]: treesize reduction 15, result has 79.5 percent of original size [2022-11-18 20:09:29,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 348 treesize of output 379 [2022-11-18 20:09:29,375 INFO L321 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2022-11-18 20:09:29,376 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 385 treesize of output 282 [2022-11-18 20:09:29,400 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:29,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 93 [2022-11-18 20:09:29,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:09:29,528 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:29,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 241 treesize of output 127 [2022-11-18 20:09:29,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:29,794 INFO L321 Elim1Store]: treesize reduction 30, result has 84.3 percent of original size [2022-11-18 20:09:29,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 657 treesize of output 775 [2022-11-18 20:09:29,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:29,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 743 treesize of output 547 [2022-11-18 20:09:29,949 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:29,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 435 treesize of output 411 [2022-11-18 20:10:25,028 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:10:25,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 361 treesize of output 179 [2022-11-18 20:10:25,938 INFO L321 Elim1Store]: treesize reduction 306, result has 54.5 percent of original size [2022-11-18 20:10:25,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 8386 treesize of output 6970 [2022-11-18 20:10:26,491 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:10:26,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 7226 treesize of output 5336 [2022-11-18 20:10:26,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:10:26,680 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 5148 treesize of output 4936 [2022-11-18 20:14:44,809 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:44,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 271 treesize of output 140 [2022-11-18 20:14:45,106 INFO L321 Elim1Store]: treesize reduction 214, result has 37.6 percent of original size [2022-11-18 20:14:45,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 7189 treesize of output 6165 [2022-11-18 20:14:45,436 INFO L321 Elim1Store]: treesize reduction 5, result has 94.1 percent of original size [2022-11-18 20:14:45,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 6119 treesize of output 4290 [2022-11-18 20:14:45,530 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:45,531 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 3 case distinctions, treesize of input 4171 treesize of output 3871 [2022-11-18 20:14:56,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:56,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 88 [2022-11-18 20:14:56,356 INFO L321 Elim1Store]: treesize reduction 66, result has 44.5 percent of original size [2022-11-18 20:14:56,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 2970 treesize of output 2242 [2022-11-18 20:14:56,541 INFO L321 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2022-11-18 20:14:56,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 2436 treesize of output 1679 [2022-11-18 20:14:56,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:56,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1604 treesize of output 1482 [2022-11-18 20:14:57,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:57,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 270 treesize of output 139 [2022-11-18 20:14:58,038 INFO L321 Elim1Store]: treesize reduction 127, result has 63.0 percent of original size [2022-11-18 20:14:58,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 4582 treesize of output 3365 [2022-11-18 20:14:58,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:58,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 3571 treesize of output 2407 [2022-11-18 20:14:58,306 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:14:58,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2277 treesize of output 2097 [2022-11-18 20:15:25,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:15:25,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 241 treesize of output 127 [2022-11-18 20:15:25,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:15:25,442 INFO L321 Elim1Store]: treesize reduction 108, result has 38.3 percent of original size [2022-11-18 20:15:25,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 757 treesize of output 469 [2022-11-18 20:15:25,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:15:25,475 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 524 treesize of output 336 [2022-11-18 20:15:25,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:15:25,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 342 treesize of output 324 [2022-11-18 20:15:26,041 INFO L321 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-18 20:15:26,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 151 treesize of output 1 [2022-11-18 20:15:26,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:15:26,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 87 [2022-11-18 20:15:26,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:15:26,085 INFO L321 Elim1Store]: treesize reduction 41, result has 38.8 percent of original size [2022-11-18 20:15:26,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 391 treesize of output 230 [2022-11-18 20:15:26,100 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 105 treesize of output 69 [2022-11-18 20:15:26,109 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:15:26,109 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 70 treesize of output 68