./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a 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_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc --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 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e --- 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-5e519f3 [2022-11-02 20:56:17,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:56:17,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:56:17,406 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:56:17,406 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:56:17,408 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:56:17,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:56:17,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:56:17,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:56:17,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:56:17,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:56:17,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:56:17,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:56:17,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:56:17,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:56:17,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:56:17,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:56:17,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:56:17,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:56:17,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:56:17,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:56:17,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:56:17,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:56:17,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:56:17,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:56:17,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:56:17,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:56:17,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:56:17,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:56:17,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:56:17,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:56:17,451 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:56:17,452 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:56:17,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:56:17,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:56:17,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:56:17,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:56:17,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:56:17,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:56:17,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:56:17,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:56:17,459 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:56:17,508 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:56:17,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:56:17,509 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:56:17,509 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:56:17,510 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:56:17,510 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:56:17,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:56:17,511 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:56:17,511 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:56:17,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:56:17,512 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:56:17,512 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:56:17,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:56:17,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:56:17,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:56:17,513 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:56:17,513 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:56:17,513 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:56:17,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:56:17,514 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:56:17,514 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:56:17,514 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:56:17,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:56:17,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:56:17,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:56:17,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:56:17,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:56:17,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:56:17,516 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:56:17,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:56:17,517 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_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/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_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc 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 -> 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e [2022-11-02 20:56:17,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:56:17,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:56:17,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:56:17,844 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:56:17,845 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:56:17,846 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2022-11-02 20:56:17,925 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/data/3453e5ac0/123dbee9a0304999a0abb234d1e8078d/FLAG04388d929 [2022-11-02 20:56:18,468 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:56:18,469 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2022-11-02 20:56:18,483 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/data/3453e5ac0/123dbee9a0304999a0abb234d1e8078d/FLAG04388d929 [2022-11-02 20:56:18,782 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/data/3453e5ac0/123dbee9a0304999a0abb234d1e8078d [2022-11-02 20:56:18,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:56:18,786 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:56:18,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:56:18,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:56:18,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:56:18,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:56:18" (1/1) ... [2022-11-02 20:56:18,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35592e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:18, skipping insertion in model container [2022-11-02 20:56:18,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:56:18" (1/1) ... [2022-11-02 20:56:18,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:56:18,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:56:19,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:56:19,325 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:56:19,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:56:19,425 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:56:19,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:19 WrapperNode [2022-11-02 20:56:19,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:56:19,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:56:19,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:56:19,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:56:19,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:19" (1/1) ... [2022-11-02 20:56:19,476 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:19" (1/1) ... [2022-11-02 20:56:19,518 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 138 [2022-11-02 20:56:19,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:56:19,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:56:19,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:56:19,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:56:19,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:19" (1/1) ... [2022-11-02 20:56:19,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:19" (1/1) ... [2022-11-02 20:56:19,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:19" (1/1) ... [2022-11-02 20:56:19,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:19" (1/1) ... [2022-11-02 20:56:19,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:19" (1/1) ... [2022-11-02 20:56:19,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:19" (1/1) ... [2022-11-02 20:56:19,574 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:19" (1/1) ... [2022-11-02 20:56:19,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:19" (1/1) ... [2022-11-02 20:56:19,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:56:19,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:56:19,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:56:19,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:56:19,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:19" (1/1) ... [2022-11-02 20:56:19,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:56:19,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:19,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:56:19,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:56:19,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:56:19,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:56:19,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:56:19,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:56:19,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:56:19,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:56:19,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:56:19,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:56:19,796 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:56:19,798 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:56:20,524 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:56:20,532 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:56:20,534 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-02 20:56:20,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:56:20 BoogieIcfgContainer [2022-11-02 20:56:20,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:56:20,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:56:20,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:56:20,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:56:20,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:56:18" (1/3) ... [2022-11-02 20:56:20,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79667865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:56:20, skipping insertion in model container [2022-11-02 20:56:20,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:56:19" (2/3) ... [2022-11-02 20:56:20,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79667865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:56:20, skipping insertion in model container [2022-11-02 20:56:20,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:56:20" (3/3) ... [2022-11-02 20:56:20,557 INFO L112 eAbstractionObserver]: Analyzing ICFG skiplist_2lvl.i [2022-11-02 20:56:20,577 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:56:20,577 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2022-11-02 20:56:20,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:56:20,640 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;@1bce4c0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:56:20,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-11-02 20:56:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 67 states have (on average 2.1343283582089554) internal successors, (143), 132 states have internal predecessors, (143), 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-02 20:56:20,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:56:20,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:20,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:56:20,653 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:20,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:20,659 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-02 20:56:20,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:20,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837011540] [2022-11-02 20:56:20,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:20,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:20,965 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-02 20:56:20,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:20,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837011540] [2022-11-02 20:56:20,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837011540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:20,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:20,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:20,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786857247] [2022-11-02 20:56:20,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:20,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:20,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:21,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:21,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:21,011 INFO L87 Difference]: Start difference. First operand has 133 states, 67 states have (on average 2.1343283582089554) internal successors, (143), 132 states have internal predecessors, (143), 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-02 20:56:21,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:21,266 INFO L93 Difference]: Finished difference Result 156 states and 163 transitions. [2022-11-02 20:56:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:21,269 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-02 20:56:21,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:21,283 INFO L225 Difference]: With dead ends: 156 [2022-11-02 20:56:21,283 INFO L226 Difference]: Without dead ends: 154 [2022-11-02 20:56:21,286 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-02 20:56:21,291 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 122 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:21,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 86 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:56:21,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-02 20:56:21,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 124. [2022-11-02 20:56:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 66 states have (on average 1.9696969696969697) internal successors, (130), 123 states have internal predecessors, (130), 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-02 20:56:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 130 transitions. [2022-11-02 20:56:21,353 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 130 transitions. Word has length 3 [2022-11-02 20:56:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:21,354 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 130 transitions. [2022-11-02 20:56:21,354 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-02 20:56:21,355 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 130 transitions. [2022-11-02 20:56:21,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:56:21,355 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:21,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:56:21,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:56:21,357 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:21,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:21,358 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-02 20:56:21,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:21,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144315548] [2022-11-02 20:56:21,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:21,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:21,490 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-02 20:56:21,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:21,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144315548] [2022-11-02 20:56:21,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144315548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:21,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:21,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:56:21,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773055485] [2022-11-02 20:56:21,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:21,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:56:21,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:21,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:56:21,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:56:21,509 INFO L87 Difference]: Start difference. First operand 124 states and 130 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-02 20:56:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:21,649 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2022-11-02 20:56:21,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:56:21,649 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-02 20:56:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:21,650 INFO L225 Difference]: With dead ends: 117 [2022-11-02 20:56:21,650 INFO L226 Difference]: Without dead ends: 117 [2022-11-02 20:56:21,651 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-02 20:56:21,652 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:21,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 69 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:56:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-02 20:56:21,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-02 20:56:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 66 states have (on average 1.8636363636363635) internal successors, (123), 116 states have internal predecessors, (123), 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-02 20:56:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 123 transitions. [2022-11-02 20:56:21,659 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 123 transitions. Word has length 3 [2022-11-02 20:56:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:21,660 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 123 transitions. [2022-11-02 20:56:21,660 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-02 20:56:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 123 transitions. [2022-11-02 20:56:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:56:21,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:21,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:21,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:56:21,661 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:21,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:21,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1056606480, now seen corresponding path program 1 times [2022-11-02 20:56:21,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:21,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920644154] [2022-11-02 20:56:21,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:21,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:22,103 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-02 20:56:22,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:22,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920644154] [2022-11-02 20:56:22,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920644154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:22,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:22,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:56:22,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333893277] [2022-11-02 20:56:22,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:22,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:56:22,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:22,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:56:22,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:56:22,107 INFO L87 Difference]: Start difference. First operand 117 states and 123 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:22,377 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2022-11-02 20:56:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:56:22,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:56:22,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:22,379 INFO L225 Difference]: With dead ends: 116 [2022-11-02 20:56:22,380 INFO L226 Difference]: Without dead ends: 116 [2022-11-02 20:56:22,380 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-02 20:56:22,382 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 8 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:22,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 294 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:56:22,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-02 20:56:22,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-11-02 20:56:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 115 states have internal predecessors, (122), 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-02 20:56:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 122 transitions. [2022-11-02 20:56:22,390 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 122 transitions. Word has length 10 [2022-11-02 20:56:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:22,391 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 122 transitions. [2022-11-02 20:56:22,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:22,392 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2022-11-02 20:56:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:56:22,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:22,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:22,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:56:22,393 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:22,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:22,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1056606481, now seen corresponding path program 1 times [2022-11-02 20:56:22,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:22,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993057181] [2022-11-02 20:56:22,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:22,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:22,752 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-02 20:56:22,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:22,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993057181] [2022-11-02 20:56:22,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993057181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:22,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:22,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:56:22,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962018023] [2022-11-02 20:56:22,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:22,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:56:22,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:22,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:56:22,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:56:22,756 INFO L87 Difference]: Start difference. First operand 116 states and 122 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:22,985 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-11-02 20:56:22,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:56:22,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:56:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:22,986 INFO L225 Difference]: With dead ends: 115 [2022-11-02 20:56:22,986 INFO L226 Difference]: Without dead ends: 115 [2022-11-02 20:56:22,986 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-02 20:56:22,997 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 10 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:22,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 283 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:56:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-02 20:56:23,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-02 20:56:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 66 states have (on average 1.8333333333333333) internal successors, (121), 114 states have internal predecessors, (121), 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-02 20:56:23,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2022-11-02 20:56:23,004 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 10 [2022-11-02 20:56:23,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:23,005 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2022-11-02 20:56:23,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:23,005 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2022-11-02 20:56:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:56:23,006 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:23,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:23,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:56:23,006 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:23,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:23,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937495, now seen corresponding path program 1 times [2022-11-02 20:56:23,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:23,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785438031] [2022-11-02 20:56:23,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:23,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:23,094 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-02 20:56:23,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:23,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785438031] [2022-11-02 20:56:23,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785438031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:23,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:23,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:56:23,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433073236] [2022-11-02 20:56:23,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:23,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:56:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:23,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:56:23,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:56:23,098 INFO L87 Difference]: Start difference. First operand 115 states and 121 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-02 20:56:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:23,208 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-11-02 20:56:23,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:56:23,210 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-02 20:56:23,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:23,211 INFO L225 Difference]: With dead ends: 114 [2022-11-02 20:56:23,211 INFO L226 Difference]: Without dead ends: 114 [2022-11-02 20:56:23,211 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-02 20:56:23,216 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 6 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:23,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 374 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:56:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-02 20:56:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-02 20:56:23,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 66 states have (on average 1.8181818181818181) internal successors, (120), 113 states have internal predecessors, (120), 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-02 20:56:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2022-11-02 20:56:23,229 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 11 [2022-11-02 20:56:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:23,230 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2022-11-02 20:56:23,230 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-02 20:56:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2022-11-02 20:56:23,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-02 20:56:23,230 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:23,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:23,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:56:23,231 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:23,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:23,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937494, now seen corresponding path program 1 times [2022-11-02 20:56:23,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:23,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467340408] [2022-11-02 20:56:23,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:23,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:23,810 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-02 20:56:23,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:23,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467340408] [2022-11-02 20:56:23,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467340408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:23,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:23,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:56:23,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488026834] [2022-11-02 20:56:23,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:23,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:56:23,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:23,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:56:23,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:56:23,814 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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-02 20:56:24,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:24,166 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2022-11-02 20:56:24,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:56:24,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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-02 20:56:24,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:24,168 INFO L225 Difference]: With dead ends: 113 [2022-11-02 20:56:24,168 INFO L226 Difference]: Without dead ends: 113 [2022-11-02 20:56:24,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:56:24,169 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 11 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:24,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 410 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:56:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-02 20:56:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-11-02 20:56:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.803030303030303) internal successors, (119), 112 states have internal predecessors, (119), 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-02 20:56:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2022-11-02 20:56:24,182 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 11 [2022-11-02 20:56:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:24,183 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2022-11-02 20:56:24,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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-02 20:56:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-11-02 20:56:24,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:56:24,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:24,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:24,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:56:24,184 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:24,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:24,185 INFO L85 PathProgramCache]: Analyzing trace with hash -266592339, now seen corresponding path program 1 times [2022-11-02 20:56:24,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:24,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710745369] [2022-11-02 20:56:24,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:24,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:24,632 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-02 20:56:24,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:24,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710745369] [2022-11-02 20:56:24,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710745369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:24,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:24,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:56:24,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623374006] [2022-11-02 20:56:24,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:24,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:56:24,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:24,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:56:24,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:56:24,635 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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-02 20:56:24,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:24,978 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2022-11-02 20:56:24,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:56:24,978 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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 15 [2022-11-02 20:56:24,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:24,979 INFO L225 Difference]: With dead ends: 112 [2022-11-02 20:56:24,979 INFO L226 Difference]: Without dead ends: 112 [2022-11-02 20:56:24,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:56:24,980 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 24 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:24,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 578 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:56:24,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-02 20:56:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-02 20:56:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 66 states have (on average 1.7878787878787878) internal successors, (118), 111 states have internal predecessors, (118), 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-02 20:56:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2022-11-02 20:56:24,985 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 15 [2022-11-02 20:56:24,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:24,985 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2022-11-02 20:56:24,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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-02 20:56:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2022-11-02 20:56:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:56:24,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:24,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:24,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:56:24,986 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:24,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:24,987 INFO L85 PathProgramCache]: Analyzing trace with hash -266592338, now seen corresponding path program 1 times [2022-11-02 20:56:24,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:24,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999435004] [2022-11-02 20:56:24,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:24,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:25,467 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-02 20:56:25,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:25,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999435004] [2022-11-02 20:56:25,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999435004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:25,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:25,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:56:25,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334519754] [2022-11-02 20:56:25,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:25,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:56:25,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:25,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:56:25,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:56:25,470 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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-02 20:56:25,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:25,729 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-11-02 20:56:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:56:25,730 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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 15 [2022-11-02 20:56:25,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:25,730 INFO L225 Difference]: With dead ends: 111 [2022-11-02 20:56:25,731 INFO L226 Difference]: Without dead ends: 111 [2022-11-02 20:56:25,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:56:25,732 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 20 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:25,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 479 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:56:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-02 20:56:25,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-02 20:56:25,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 66 states have (on average 1.7727272727272727) internal successors, (117), 110 states have internal predecessors, (117), 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-02 20:56:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2022-11-02 20:56:25,735 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 15 [2022-11-02 20:56:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:25,736 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2022-11-02 20:56:25,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 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-02 20:56:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2022-11-02 20:56:25,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:56:25,737 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:25,737 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:25,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:56:25,737 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:25,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:25,739 INFO L85 PathProgramCache]: Analyzing trace with hash 325572089, now seen corresponding path program 1 times [2022-11-02 20:56:25,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:25,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765384662] [2022-11-02 20:56:25,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:25,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:25,818 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-02 20:56:25,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:25,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765384662] [2022-11-02 20:56:25,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765384662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:25,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:25,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:56:25,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373822695] [2022-11-02 20:56:25,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:25,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:56:25,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:25,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:56:25,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:56:25,821 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-02 20:56:25,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:25,949 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2022-11-02 20:56:25,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:56:25,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2022-11-02 20:56:25,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:25,950 INFO L225 Difference]: With dead ends: 110 [2022-11-02 20:56:25,951 INFO L226 Difference]: Without dead ends: 110 [2022-11-02 20:56:25,951 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-02 20:56:25,952 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 5 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:25,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 363 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:56:25,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-02 20:56:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-11-02 20:56:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 66 states have (on average 1.7575757575757576) internal successors, (116), 109 states have internal predecessors, (116), 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-02 20:56:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2022-11-02 20:56:25,955 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 16 [2022-11-02 20:56:25,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:25,956 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2022-11-02 20:56:25,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-02 20:56:25,956 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2022-11-02 20:56:25,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:56:25,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:25,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:25,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:56:25,957 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:25,958 INFO L85 PathProgramCache]: Analyzing trace with hash 325572090, now seen corresponding path program 1 times [2022-11-02 20:56:25,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:25,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153399614] [2022-11-02 20:56:25,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:25,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:26,456 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-02 20:56:26,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:26,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153399614] [2022-11-02 20:56:26,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153399614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:26,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:26,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:56:26,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955650710] [2022-11-02 20:56:26,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:26,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:56:26,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:26,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:56:26,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:56:26,458 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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-02 20:56:26,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:26,709 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-11-02 20:56:26,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:56:26,710 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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 16 [2022-11-02 20:56:26,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:26,711 INFO L225 Difference]: With dead ends: 109 [2022-11-02 20:56:26,711 INFO L226 Difference]: Without dead ends: 109 [2022-11-02 20:56:26,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:56:26,712 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 15 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:26,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 473 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:56:26,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-02 20:56:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-11-02 20:56:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 108 states have internal predecessors, (115), 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-02 20:56:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2022-11-02 20:56:26,716 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 16 [2022-11-02 20:56:26,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:26,716 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2022-11-02 20:56:26,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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-02 20:56:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-11-02 20:56:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:56:26,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:26,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:26,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:56:26,718 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:26,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:26,719 INFO L85 PathProgramCache]: Analyzing trace with hash 379588598, now seen corresponding path program 1 times [2022-11-02 20:56:26,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:26,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402008200] [2022-11-02 20:56:26,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:26,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:26,827 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-02 20:56:26,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:26,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402008200] [2022-11-02 20:56:26,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402008200] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:26,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:26,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:56:26,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832117786] [2022-11-02 20:56:26,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:26,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:56:26,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:26,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:56:26,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:56:26,830 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:27,055 INFO L93 Difference]: Finished difference Result 170 states and 179 transitions. [2022-11-02 20:56:27,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:56:27,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:56:27,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:27,057 INFO L225 Difference]: With dead ends: 170 [2022-11-02 20:56:27,057 INFO L226 Difference]: Without dead ends: 170 [2022-11-02 20:56:27,058 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-02 20:56:27,058 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 362 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:27,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 155 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:56:27,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-02 20:56:27,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 107. [2022-11-02 20:56:27,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 66 states have (on average 1.7121212121212122) internal successors, (113), 106 states have internal predecessors, (113), 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-02 20:56:27,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2022-11-02 20:56:27,062 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 21 [2022-11-02 20:56:27,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:27,063 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2022-11-02 20:56:27,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:27,063 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2022-11-02 20:56:27,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:56:27,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:27,064 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:27,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:56:27,064 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:27,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:27,065 INFO L85 PathProgramCache]: Analyzing trace with hash 379588599, now seen corresponding path program 1 times [2022-11-02 20:56:27,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:27,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701408920] [2022-11-02 20:56:27,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:27,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:27,288 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-02 20:56:27,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:27,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701408920] [2022-11-02 20:56:27,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701408920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:27,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:27,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:56:27,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282702241] [2022-11-02 20:56:27,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:27,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:56:27,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:27,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:56:27,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:56:27,291 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:27,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:27,471 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2022-11-02 20:56:27,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:56:27,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:56:27,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:27,473 INFO L225 Difference]: With dead ends: 141 [2022-11-02 20:56:27,473 INFO L226 Difference]: Without dead ends: 141 [2022-11-02 20:56:27,473 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-02 20:56:27,474 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 382 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:27,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 117 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:56:27,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-02 20:56:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2022-11-02 20:56:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 104 states have internal predecessors, (111), 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-02 20:56:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2022-11-02 20:56:27,477 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 21 [2022-11-02 20:56:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:27,477 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2022-11-02 20:56:27,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2022-11-02 20:56:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:56:27,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:27,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:27,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:56:27,481 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:27,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:27,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1117654205, now seen corresponding path program 1 times [2022-11-02 20:56:27,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:27,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590600373] [2022-11-02 20:56:27,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:27,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:27,579 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-02 20:56:27,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:27,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590600373] [2022-11-02 20:56:27,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590600373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:27,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:27,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:56:27,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360258335] [2022-11-02 20:56:27,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:27,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:56:27,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:27,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:56:27,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:56:27,582 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:27,788 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2022-11-02 20:56:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:56:27,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:56:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:27,789 INFO L225 Difference]: With dead ends: 126 [2022-11-02 20:56:27,789 INFO L226 Difference]: Without dead ends: 126 [2022-11-02 20:56:27,789 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-02 20:56:27,790 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 297 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:27,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 130 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:56:27,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-02 20:56:27,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 102. [2022-11-02 20:56:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.626865671641791) internal successors, (109), 101 states have internal predecessors, (109), 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-02 20:56:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2022-11-02 20:56:27,794 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 22 [2022-11-02 20:56:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:27,794 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2022-11-02 20:56:27,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:27,794 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-11-02 20:56:27,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:56:27,795 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:27,795 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:27,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:56:27,796 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:27,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:27,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1117654204, now seen corresponding path program 1 times [2022-11-02 20:56:27,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:27,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596246751] [2022-11-02 20:56:27,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:27,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:28,008 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-02 20:56:28,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:28,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596246751] [2022-11-02 20:56:28,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596246751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:28,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:28,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:56:28,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488569343] [2022-11-02 20:56:28,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:28,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:56:28,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:28,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:56:28,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:56:28,011 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:28,211 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-11-02 20:56:28,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:56:28,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:56:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:28,213 INFO L225 Difference]: With dead ends: 97 [2022-11-02 20:56:28,213 INFO L226 Difference]: Without dead ends: 97 [2022-11-02 20:56:28,213 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-02 20:56:28,214 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 372 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:28,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 90 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:56:28,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-02 20:56:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-02 20:56:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.537313432835821) internal successors, (103), 96 states have internal predecessors, (103), 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-02 20:56:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2022-11-02 20:56:28,217 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 22 [2022-11-02 20:56:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:28,217 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2022-11-02 20:56:28,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2022-11-02 20:56:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:56:28,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:28,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:28,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:56:28,219 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:28,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:28,219 INFO L85 PathProgramCache]: Analyzing trace with hash -287576677, now seen corresponding path program 1 times [2022-11-02 20:56:28,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:28,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302608841] [2022-11-02 20:56:28,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:28,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:28,835 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-02 20:56:28,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:28,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302608841] [2022-11-02 20:56:28,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302608841] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:28,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:28,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-02 20:56:28,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106759075] [2022-11-02 20:56:28,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:28,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:56:28,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:28,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:56:28,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:56:28,837 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:29,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:29,878 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2022-11-02 20:56:29,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:56:29,879 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 20:56:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:29,880 INFO L225 Difference]: With dead ends: 165 [2022-11-02 20:56:29,880 INFO L226 Difference]: Without dead ends: 165 [2022-11-02 20:56:29,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2022-11-02 20:56:29,882 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 413 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:29,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 774 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:56:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-02 20:56:29,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 98. [2022-11-02 20:56:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 97 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:29,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2022-11-02 20:56:29,886 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 23 [2022-11-02 20:56:29,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:29,886 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2022-11-02 20:56:29,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:29,886 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2022-11-02 20:56:29,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:56:29,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:29,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:29,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:56:29,888 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:29,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:29,888 INFO L85 PathProgramCache]: Analyzing trace with hash -287576676, now seen corresponding path program 1 times [2022-11-02 20:56:29,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:29,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191840266] [2022-11-02 20:56:29,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:29,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:30,853 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-02 20:56:30,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:30,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191840266] [2022-11-02 20:56:30,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191840266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:30,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:30,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-02 20:56:30,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864633949] [2022-11-02 20:56:30,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:30,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 20:56:30,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:30,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:56:30,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:56:30,856 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:32,140 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2022-11-02 20:56:32,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:56:32,140 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 20:56:32,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:32,141 INFO L225 Difference]: With dead ends: 211 [2022-11-02 20:56:32,142 INFO L226 Difference]: Without dead ends: 211 [2022-11-02 20:56:32,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=993, Unknown=0, NotChecked=0, Total=1190 [2022-11-02 20:56:32,143 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 628 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:32,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 811 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:56:32,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-02 20:56:32,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 122. [2022-11-02 20:56:32,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.5208333333333333) internal successors, (146), 121 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-02 20:56:32,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2022-11-02 20:56:32,147 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 23 [2022-11-02 20:56:32,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:32,147 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2022-11-02 20:56:32,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:32,148 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2022-11-02 20:56:32,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:56:32,148 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:32,148 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-02 20:56:32,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:56:32,149 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:32,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:32,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1449815588, now seen corresponding path program 1 times [2022-11-02 20:56:32,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:32,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935067976] [2022-11-02 20:56:32,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:32,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:32,265 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-02 20:56:32,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:32,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935067976] [2022-11-02 20:56:32,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935067976] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:32,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:32,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:56:32,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543004356] [2022-11-02 20:56:32,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:32,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:56:32,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:32,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:56:32,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:56:32,269 INFO L87 Difference]: Start difference. First operand 122 states and 146 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-02 20:56:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:32,347 INFO L93 Difference]: Finished difference Result 121 states and 145 transitions. [2022-11-02 20:56:32,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:56:32,347 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-02 20:56:32,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:32,350 INFO L225 Difference]: With dead ends: 121 [2022-11-02 20:56:32,350 INFO L226 Difference]: Without dead ends: 121 [2022-11-02 20:56:32,350 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-02 20:56:32,351 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 258 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:32,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 146 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:56:32,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-02 20:56:32,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-11-02 20:56:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.5104166666666667) internal successors, (145), 120 states have internal predecessors, (145), 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-02 20:56:32,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2022-11-02 20:56:32,356 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 25 [2022-11-02 20:56:32,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:32,357 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2022-11-02 20:56:32,357 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-02 20:56:32,357 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2022-11-02 20:56:32,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:56:32,358 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:32,358 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-02 20:56:32,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:56:32,359 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:32,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:32,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1702259996, now seen corresponding path program 1 times [2022-11-02 20:56:32,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:32,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64509966] [2022-11-02 20:56:32,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:32,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:32,993 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-02 20:56:32,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:32,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64509966] [2022-11-02 20:56:32,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64509966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:32,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:32,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-02 20:56:32,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310478834] [2022-11-02 20:56:32,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:32,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 20:56:32,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:32,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:56:32,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:56:32,995 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 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-02 20:56:33,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:33,891 INFO L93 Difference]: Finished difference Result 166 states and 194 transitions. [2022-11-02 20:56:33,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:56:33,891 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 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-02 20:56:33,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:33,892 INFO L225 Difference]: With dead ends: 166 [2022-11-02 20:56:33,892 INFO L226 Difference]: Without dead ends: 166 [2022-11-02 20:56:33,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2022-11-02 20:56:33,894 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 320 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:33,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 705 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:56:33,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-02 20:56:33,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 128. [2022-11-02 20:56:33,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4951456310679612) internal successors, (154), 127 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-02 20:56:33,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 154 transitions. [2022-11-02 20:56:33,898 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 154 transitions. Word has length 27 [2022-11-02 20:56:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:33,898 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 154 transitions. [2022-11-02 20:56:33,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 17 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-02 20:56:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 154 transitions. [2022-11-02 20:56:33,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:56:33,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:33,900 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-02 20:56:33,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:56:33,900 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:33,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:33,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1702259995, now seen corresponding path program 1 times [2022-11-02 20:56:33,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:33,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255346452] [2022-11-02 20:56:33,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:33,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:34,815 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-02 20:56:34,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:34,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255346452] [2022-11-02 20:56:34,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255346452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:34,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:34,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-02 20:56:34,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106438403] [2022-11-02 20:56:34,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:34,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:56:34,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:34,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:56:34,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:56:34,817 INFO L87 Difference]: Start difference. First operand 128 states and 154 transitions. Second operand has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 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-02 20:56:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:35,938 INFO L93 Difference]: Finished difference Result 166 states and 194 transitions. [2022-11-02 20:56:35,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:56:35,938 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 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-02 20:56:35,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:35,939 INFO L225 Difference]: With dead ends: 166 [2022-11-02 20:56:35,939 INFO L226 Difference]: Without dead ends: 166 [2022-11-02 20:56:35,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2022-11-02 20:56:35,941 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 272 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:35,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 629 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:56:35,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-02 20:56:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 128. [2022-11-02 20:56:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4854368932038835) internal successors, (153), 127 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-02 20:56:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 153 transitions. [2022-11-02 20:56:35,944 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 153 transitions. Word has length 27 [2022-11-02 20:56:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:35,945 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 153 transitions. [2022-11-02 20:56:35,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 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-02 20:56:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 153 transitions. [2022-11-02 20:56:35,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:56:35,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:35,946 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:56:35,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:56:35,950 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:35,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1264836991, now seen corresponding path program 1 times [2022-11-02 20:56:35,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:35,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609441987] [2022-11-02 20:56:35,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:35,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:36,610 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-02 20:56:36,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:36,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609441987] [2022-11-02 20:56:36,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609441987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:36,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:36,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-02 20:56:36,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782306026] [2022-11-02 20:56:36,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:36,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:56:36,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:36,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:56:36,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:56:36,612 INFO L87 Difference]: Start difference. First operand 128 states and 153 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:37,316 INFO L93 Difference]: Finished difference Result 159 states and 187 transitions. [2022-11-02 20:56:37,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:56:37,316 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:56:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:37,317 INFO L225 Difference]: With dead ends: 159 [2022-11-02 20:56:37,317 INFO L226 Difference]: Without dead ends: 159 [2022-11-02 20:56:37,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:56:37,319 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 195 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:37,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 774 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:56:37,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-02 20:56:37,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 128. [2022-11-02 20:56:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 127 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-02 20:56:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2022-11-02 20:56:37,322 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 28 [2022-11-02 20:56:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:37,323 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2022-11-02 20:56:37,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:56:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2022-11-02 20:56:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:56:37,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:37,324 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-02 20:56:37,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:56:37,324 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:37,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:37,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2059816375, now seen corresponding path program 1 times [2022-11-02 20:56:37,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:37,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313031552] [2022-11-02 20:56:37,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:37,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:37,385 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-02 20:56:37,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:37,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313031552] [2022-11-02 20:56:37,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313031552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:37,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:37,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:56:37,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870194673] [2022-11-02 20:56:37,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:37,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:56:37,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:37,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:56:37,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:56:37,389 INFO L87 Difference]: Start difference. First operand 128 states and 152 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 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-02 20:56:37,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:37,529 INFO L93 Difference]: Finished difference Result 146 states and 169 transitions. [2022-11-02 20:56:37,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:56:37,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 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-02 20:56:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:37,530 INFO L225 Difference]: With dead ends: 146 [2022-11-02 20:56:37,531 INFO L226 Difference]: Without dead ends: 146 [2022-11-02 20:56:37,531 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-02 20:56:37,532 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 113 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:37,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 131 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:56:37,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-02 20:56:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 127. [2022-11-02 20:56:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 126 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-02 20:56:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 150 transitions. [2022-11-02 20:56:37,537 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 150 transitions. Word has length 29 [2022-11-02 20:56:37,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:37,537 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 150 transitions. [2022-11-02 20:56:37,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 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-02 20:56:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 150 transitions. [2022-11-02 20:56:37,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:56:37,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:37,538 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-02 20:56:37,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:56:37,539 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:37,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:37,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2059816374, now seen corresponding path program 1 times [2022-11-02 20:56:37,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:37,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574252951] [2022-11-02 20:56:37,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:37,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:38,388 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-02 20:56:38,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:38,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574252951] [2022-11-02 20:56:38,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574252951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:38,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:38,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-11-02 20:56:38,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34714143] [2022-11-02 20:56:38,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:38,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-02 20:56:38,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:38,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-02 20:56:38,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:56:38,391 INFO L87 Difference]: Start difference. First operand 127 states and 150 transitions. Second operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 21 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-02 20:56:39,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:39,486 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2022-11-02 20:56:39,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-02 20:56:39,490 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 21 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-02 20:56:39,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:39,490 INFO L225 Difference]: With dead ends: 202 [2022-11-02 20:56:39,491 INFO L226 Difference]: Without dead ends: 202 [2022-11-02 20:56:39,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2022-11-02 20:56:39,492 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 473 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:39,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1196 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:56:39,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-02 20:56:39,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 132. [2022-11-02 20:56:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 110 states have (on average 1.4181818181818182) internal successors, (156), 131 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-02 20:56:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 156 transitions. [2022-11-02 20:56:39,495 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 156 transitions. Word has length 29 [2022-11-02 20:56:39,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:39,496 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 156 transitions. [2022-11-02 20:56:39,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.45) internal successors, (29), 21 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-02 20:56:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 156 transitions. [2022-11-02 20:56:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:56:39,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:39,496 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] [2022-11-02 20:56:39,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:56:39,497 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:39,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:39,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1348537848, now seen corresponding path program 1 times [2022-11-02 20:56:39,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:39,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167154238] [2022-11-02 20:56:39,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:39,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:40,241 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-02 20:56:40,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:40,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167154238] [2022-11-02 20:56:40,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167154238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:56:40,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:56:40,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-02 20:56:40,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020517602] [2022-11-02 20:56:40,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:56:40,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 20:56:40,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:56:40,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:56:40,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:56:40,244 INFO L87 Difference]: Start difference. First operand 132 states and 156 transitions. Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 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-02 20:56:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:56:40,926 INFO L93 Difference]: Finished difference Result 173 states and 202 transitions. [2022-11-02 20:56:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:56:40,927 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 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 30 [2022-11-02 20:56:40,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:56:40,928 INFO L225 Difference]: With dead ends: 173 [2022-11-02 20:56:40,928 INFO L226 Difference]: Without dead ends: 173 [2022-11-02 20:56:40,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2022-11-02 20:56:40,929 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 246 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:56:40,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 747 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:56:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-11-02 20:56:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 135. [2022-11-02 20:56:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.407079646017699) internal successors, (159), 134 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-02 20:56:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 159 transitions. [2022-11-02 20:56:40,933 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 159 transitions. Word has length 30 [2022-11-02 20:56:40,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:56:40,933 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 159 transitions. [2022-11-02 20:56:40,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 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-02 20:56:40,933 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 159 transitions. [2022-11-02 20:56:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:56:40,933 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:56:40,934 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] [2022-11-02 20:56:40,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:56:40,936 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-11-02 20:56:40,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:56:40,937 INFO L85 PathProgramCache]: Analyzing trace with hash 570254421, now seen corresponding path program 1 times [2022-11-02 20:56:40,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:56:40,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007476451] [2022-11-02 20:56:40,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:40,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:56:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:42,367 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-02 20:56:42,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:56:42,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007476451] [2022-11-02 20:56:42,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007476451] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:56:42,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91272873] [2022-11-02 20:56:42,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:56:42,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:56:42,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:56:42,379 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:56:42,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce89524-9e7d-43b8-a38a-8db3363d3649/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:56:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:56:42,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 80 conjunts are in the unsatisfiable core [2022-11-02 20:56:42,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:56:42,677 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:56:42,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:42,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:42,872 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-02 20:56:42,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:42,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:42,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:43,434 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:56:43,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:43,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:43,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:43,612 INFO L356 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2022-11-02 20:56:43,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:43,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:43,994 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:56:43,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:44,018 INFO L356 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-11-02 20:56:44,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:44,081 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:56:44,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:44,099 INFO L356 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-11-02 20:56:44,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:44,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:44,913 INFO L356 Elim1Store]: treesize reduction 26, result has 3.7 percent of original size [2022-11-02 20:56:44,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:45,118 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-02 20:56:45,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:56:45,476 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_902))) (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 |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_903) |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))) 1)) is different from false [2022-11-02 20:56:45,487 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_900 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_903 (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~mem11#1.base| v_ArrVal_901) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_902))) (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~mem11#1.base| v_ArrVal_900) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_903) |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))) 1)) is different from false [2022-11-02 20:56:45,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_900 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_901 (Array Int Int)) (v_ArrVal_903 (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_901) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_902))) (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|))) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_900) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_903) |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-02 20:56:45,508 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (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 |c_#memory_$Pointer$.base| .cse1 v_ArrVal_902))) (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 |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_903) |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)))) 1)) is different from false [2022-11-02 20:56:45,526 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (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| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#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_902))) (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_898) .cse2 v_ArrVal_903) |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))))) 1)) is different from false [2022-11-02 20:56:45,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_896 (Array Int Int)) (v_ArrVal_895 (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_895))) (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| 4) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem9#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_902))) (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|))) (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_896) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_898) .cse2 v_ArrVal_903) |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-02 20:56:45,559 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_896 (Array Int Int)) (v_ArrVal_895 (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 |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem8#1.base| v_ArrVal_895))) (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| 4) (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_902))) (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_896) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_898) .cse2 v_ArrVal_903) |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)))))) 1)) is different from false [2022-11-02 20:56:45,576 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_903 (Array Int Int)) (v_ArrVal_896 (Array Int Int)) (v_ArrVal_895 (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_895))) (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| 4) (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_902))) (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|))) (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_896) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem7#1.base| v_ArrVal_898) .cse2 v_ArrVal_903) |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-02 20:56:45,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:45,595 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:45,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:45,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 340 treesize of output 336 [2022-11-02 20:56:45,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 168 treesize of output 166 [2022-11-02 20:56:45,994 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse42 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse6 (select .cse42 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4))) (let ((.cse1 (select .cse42 .cse5)) (.cse30 (= .cse6 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse0 (+ 4 v_arrayElimCell_21))) (or (not (= (select v_arrayElimArr_1 .cse0) .cse1)) (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5) v_ArrVal_902)))) (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 .cse2 (+ 4 v_arrayElimCell_23))) 1) (= (select |c_#valid| (select .cse2 (+ 4 v_arrayElimCell_22))) 1) (= (select |c_#valid| (select .cse2 .cse0)) 1))))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (let ((.cse8 (+ 4 v_arrayElimCell_21)) (.cse11 (select (select .cse10 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse7 (let ((.cse9 (store .cse10 .cse11 v_ArrVal_902))) (select .cse9 (select (select .cse9 |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 .cse7 (+ 4 v_arrayElimCell_23))) 1) (= (select |c_#valid| (select .cse7 .cse8)) 1)))) (not (= (select v_arrayElimArr_1 .cse8) .cse1)) (= .cse11 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))))) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (let ((.cse12 (select (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (not (= .cse12 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (forall ((v_arrayElimCell_21 Int)) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) .cse1))) (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_22 Int)) (= (select |c_#valid| (select (let ((.cse13 (store .cse14 .cse12 v_ArrVal_902))) (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|))) (+ 4 v_arrayElimCell_22))) 1)))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (let ((.cse15 (select (select .cse18 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (not (= .cse15 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) .cse1)) (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse16 (let ((.cse17 (store .cse18 .cse15 v_ArrVal_902))) (select .cse17 (select (select .cse17 |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 .cse16 (+ 4 v_arrayElimCell_23))) 1) (= (select |c_#valid| (select .cse16 (+ 4 v_arrayElimCell_22))) 1)))))))) (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse19 (+ 4 v_arrayElimCell_21))) (or (not (= (select v_arrayElimArr_1 .cse19) .cse1)) (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse20 (let ((.cse21 (let ((.cse22 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (store .cse22 (select (select .cse22 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5) v_ArrVal_902)))) (select .cse21 (select (select .cse21 |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 .cse20 (+ 4 v_arrayElimCell_22))) 1) (= (select |c_#valid| (select .cse20 .cse19)) 1))))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse24 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (let ((.cse26 (+ 4 v_arrayElimCell_21)) (.cse25 (select (select .cse24 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (forall ((v_ArrVal_902 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse23 (store .cse24 .cse25 v_ArrVal_902))) (select .cse23 (select (select .cse23 |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|))) .cse26)) 1)) (not (= (select v_arrayElimArr_1 .cse26) .cse1)) (= .cse25 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse29 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (let ((.cse27 (select (select .cse29 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (not (= .cse27 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) .cse1)) (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_22 Int)) (= (select |c_#valid| (select (let ((.cse28 (store .cse29 .cse27 v_ArrVal_902))) (select .cse28 (select (select .cse28 |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 v_arrayElimCell_22))) 1))))))) .cse30) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (let ((.cse35 (select (select .cse34 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (forall ((v_arrayElimCell_21 Int)) (let ((.cse31 (+ 4 v_arrayElimCell_21))) (or (not (= (select v_arrayElimArr_1 .cse31) .cse1)) (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse32 (let ((.cse33 (store .cse34 .cse35 v_ArrVal_902))) (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|))))) (or (= (select |c_#valid| (select .cse32 (+ 4 v_arrayElimCell_22))) 1) (= (select |c_#valid| (select .cse32 .cse31)) 1))))))) (not (= .cse35 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)))))) (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse37 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (let ((.cse38 (select (select .cse37 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_23 Int)) (= (select |c_#valid| (select (let ((.cse36 (store .cse37 .cse38 v_ArrVal_902))) (select .cse36 (select (select .cse36 |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 v_arrayElimCell_23))) 1)) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) .cse1)) (= .cse38 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (or (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) .cse1)) (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse39 (let ((.cse40 (let ((.cse41 (store |c_#memory_$Pointer$.base| .cse6 v_arrayElimArr_1))) (store .cse41 (select (select .cse41 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5) v_ArrVal_902)))) (select .cse40 (select (select .cse40 |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 .cse39 (+ 4 v_arrayElimCell_23))) 1) (forall ((v_arrayElimCell_22 Int)) (= (select |c_#valid| (select .cse39 (+ 4 v_arrayElimCell_22))) 1)))))))) (not .cse30)))))) is different from false [2022-11-02 20:56:46,512 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse42 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (let ((.cse5 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) (.cse7 (select .cse42 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (let ((.cse21 (= .cse7 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base| (store .cse42 .cse5 |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse4 (store .cse6 .cse7 v_arrayElimArr_1))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5)) (.cse2 (+ 4 v_arrayElimCell_21))) (or (= .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse1 (let ((.cse3 (store .cse4 .cse0 v_ArrVal_902))) (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 .cse2)) 1) (= (select |c_#valid| (select .cse1 (+ 4 v_arrayElimCell_23))) 1)))) (not (= (select v_arrayElimArr_1 .cse2) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse10 (store .cse6 .cse7 v_arrayElimArr_1))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (not (= .cse8 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (forall ((v_arrayElimCell_21 Int)) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))) (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_22 Int)) (= (select |c_#valid| (select (let ((.cse9 (store .cse10 .cse8 v_ArrVal_902))) (select .cse9 (select (select .cse9 |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 v_arrayElimCell_22))) 1)))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse12 (+ 4 v_arrayElimCell_21))) (or (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse11 (let ((.cse13 (let ((.cse14 (store .cse6 .cse7 v_arrayElimArr_1))) (store .cse14 (select (select .cse14 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5) v_ArrVal_902)))) (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 (+ 4 v_arrayElimCell_22))) 1) (= (select |c_#valid| (select .cse11 .cse12)) 1) (= (select |c_#valid| (select .cse11 (+ 4 v_arrayElimCell_23))) 1)))) (not (= (select v_arrayElimArr_1 .cse12) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))))) (or (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (or (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse15 (let ((.cse16 (let ((.cse17 (store .cse6 .cse7 v_arrayElimArr_1))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5) v_ArrVal_902)))) (select .cse16 (select (select .cse16 |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 (forall ((v_arrayElimCell_22 Int)) (= (select |c_#valid| (select .cse15 (+ 4 v_arrayElimCell_22))) 1)) (= (select |c_#valid| (select .cse15 (+ 4 v_arrayElimCell_23))) 1)))) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse20 (store .cse6 .cse7 v_arrayElimArr_1))) (let ((.cse18 (select (select .cse20 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (= .cse18 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_23 Int)) (= (select |c_#valid| (select (let ((.cse19 (store .cse20 .cse18 v_ArrVal_902))) (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|))) (+ 4 v_arrayElimCell_23))) 1)) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))))))) (not .cse21)) (or .cse21 (and (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse23 (+ 4 v_arrayElimCell_21))) (or (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_22 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_902)))) (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 (+ 4 v_arrayElimCell_22))) 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|))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse28 (store .cse6 .cse7 v_arrayElimArr_1))) (let ((.cse26 (select (select .cse28 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (not (= .cse26 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_22 Int)) (= (select |c_#valid| (select (let ((.cse27 (store .cse28 .cse26 v_ArrVal_902))) (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|))) (+ 4 v_arrayElimCell_22))) 1)) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse31 (store .cse6 .cse7 v_arrayElimArr_1))) (let ((.cse29 (select (select .cse31 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5)) (.cse32 (+ 4 v_arrayElimCell_21))) (or (= .cse29 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) (forall ((v_ArrVal_902 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse30 (store .cse31 .cse29 v_ArrVal_902))) (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|))) .cse32)) 1)) (not (= (select v_arrayElimArr_1 .cse32) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))))) (forall ((v_arrayElimArr_1 (Array Int Int)) (v_arrayElimCell_21 Int)) (let ((.cse36 (store .cse6 .cse7 v_arrayElimArr_1))) (let ((.cse33 (select (select .cse36 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (not (= .cse33 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)) (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_23 Int) (v_arrayElimCell_22 Int)) (let ((.cse34 (let ((.cse35 (store .cse36 .cse33 v_ArrVal_902))) (select .cse35 (select (select .cse35 |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 .cse34 (+ 4 v_arrayElimCell_22))) 1) (= (select |c_#valid| (select .cse34 (+ 4 v_arrayElimCell_23))) 1)))) (not (= (select v_arrayElimArr_1 (+ 4 v_arrayElimCell_21)) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|)))))) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse40 (store .cse6 .cse7 v_arrayElimArr_1))) (let ((.cse41 (select (select .cse40 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) .cse5))) (or (forall ((v_arrayElimCell_21 Int)) (let ((.cse38 (+ 4 v_arrayElimCell_21))) (or (forall ((v_ArrVal_902 (Array Int Int)) (v_arrayElimCell_22 Int)) (let ((.cse37 (let ((.cse39 (store .cse40 .cse41 v_ArrVal_902))) (select .cse39 (select (select .cse39 |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 .cse37 (+ 4 v_arrayElimCell_22))) 1) (= (select |c_#valid| (select .cse37 .cse38)) 1)))) (not (= (select v_arrayElimArr_1 .cse38) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~malloc6#1.base|))))) (not (= .cse41 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|)))))))))) is different from false [2022-11-02 20:56:48,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:48,339 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:48,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:48,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:48,417 INFO L356 Elim1Store]: treesize reduction 15, result has 78.3 percent of original size [2022-11-02 20:56:48,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 374 [2022-11-02 20:56:48,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:48,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 365 treesize of output 265 [2022-11-02 20:56:48,503 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:48,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 216 treesize of output 200 [2022-11-02 20:56:49,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:49,606 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:49,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:49,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:56:49,841 INFO L356 Elim1Store]: treesize reduction 30, result has 83.6 percent of original size [2022-11-02 20:56:49,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1381 treesize of output 1459 [2022-11-02 20:56:49,989 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:49,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1427 treesize of output 969 [2022-11-02 20:56:50,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:50,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 867 treesize of output 795 [2022-11-02 20:56:55,042 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:55,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:55,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:55,086 INFO L356 Elim1Store]: treesize reduction 39, result has 38.1 percent of original size [2022-11-02 20:56:55,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 795 treesize of output 450 [2022-11-02 20:56:55,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 456 treesize of output 288 [2022-11-02 20:56:55,126 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:55,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 289 treesize of output 255 [2022-11-02 20:56:55,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:55,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:55,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:56:55,334 INFO L356 Elim1Store]: treesize reduction 104, result has 37.7 percent of original size [2022-11-02 20:56:55,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 465 [2022-11-02 20:56:55,382 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:55,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 520 treesize of output 332 [2022-11-02 20:56:55,419 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:55,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 338 treesize of output 320 [2022-11-02 20:56:56,142 INFO L356 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-11-02 20:56:56,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:56,154 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:56,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:56:56,515 INFO L356 Elim1Store]: treesize reduction 206, result has 37.8 percent of original size [2022-11-02 20:56:56,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6161 [2022-11-02 20:56:56,932 INFO L356 Elim1Store]: treesize reduction 5, result has 93.7 percent of original size [2022-11-02 20:56:56,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6115 treesize of output 4280 [2022-11-02 20:56:57,034 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:56:57,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:07,341 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:07,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:07,433 INFO L356 Elim1Store]: treesize reduction 62, result has 45.1 percent of original size [2022-11-02 20:57:07,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2344 treesize of output 1672 [2022-11-02 20:57:07,573 INFO L356 Elim1Store]: treesize reduction 5, result has 88.9 percent of original size [2022-11-02 20:57:07,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1876 treesize of output 1271 [2022-11-02 20:57:07,621 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:07,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1202 treesize of output 1104 [2022-11-02 20:57:07,836 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:07,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:08,174 INFO L356 Elim1Store]: treesize reduction 214, result has 35.3 percent of original size [2022-11-02 20:57:08,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11385 treesize of output 9169 [2022-11-02 20:57:08,859 INFO L356 Elim1Store]: treesize reduction 5, result has 88.9 percent of original size [2022-11-02 20:57:08,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9530 treesize of output 7009 [2022-11-02 20:57:08,976 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:08,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6942 treesize of output 6626 [2022-11-02 20:57:13,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:13,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:57:14,211 INFO L356 Elim1Store]: treesize reduction 127, result has 61.6 percent of original size [2022-11-02 20:57:14,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 11794 treesize of output 9265 [2022-11-02 20:57:14,743 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:14,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 9319 treesize of output 6545 [2022-11-02 20:57:14,870 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:57:14,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 6427 treesize of output 5963