./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e486f0f9d7d5faf0af2c33128bdcb8eeb95bb04afff03e23e86c60ceb8da8466 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:23:35,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:23:35,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:23:35,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:23:35,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:23:35,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:23:35,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:23:35,360 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:23:35,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:23:35,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:23:35,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:23:35,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:23:35,374 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:23:35,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:23:35,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:23:35,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:23:35,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:23:35,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:23:35,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:23:35,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:23:35,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:23:35,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:23:35,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:23:35,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:23:35,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:23:35,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:23:35,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:23:35,435 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:23:35,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:23:35,436 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:23:35,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:23:35,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:23:35,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:23:35,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:23:35,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:23:35,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:23:35,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:23:35,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:23:35,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:23:35,470 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:23:35,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:23:35,472 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:23:35,511 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:23:35,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:23:35,512 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:23:35,512 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:23:35,513 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:23:35,513 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:23:35,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:23:35,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:23:35,515 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:23:35,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:23:35,515 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:23:35,516 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:23:35,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:23:35,516 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:23:35,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:23:35,516 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:23:35,517 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:23:35,517 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:23:35,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:23:35,517 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:23:35,518 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:23:35,518 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:23:35,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:23:35,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:23:35,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:23:35,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:23:35,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:23:35,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:23:35,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:23:35,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:23:35,523 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:23:35,523 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:23:35,524 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:23:35,524 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e486f0f9d7d5faf0af2c33128bdcb8eeb95bb04afff03e23e86c60ceb8da8466 [2022-11-25 17:23:35,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:23:35,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:23:35,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:23:35,910 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:23:35,911 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:23:35,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c [2022-11-25 17:23:39,093 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:23:39,386 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:23:39,387 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c [2022-11-25 17:23:39,400 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R/data/85cc858df/b72f16d61e824060b724940ce1678960/FLAG472a04851 [2022-11-25 17:23:39,427 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R/data/85cc858df/b72f16d61e824060b724940ce1678960 [2022-11-25 17:23:39,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:23:39,431 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:23:39,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:23:39,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:23:39,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:23:39,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:23:39" (1/1) ... [2022-11-25 17:23:39,446 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe29ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:39, skipping insertion in model container [2022-11-25 17:23:39,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:23:39" (1/1) ... [2022-11-25 17:23:39,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:23:39,554 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:23:39,998 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c[38357,38370] [2022-11-25 17:23:40,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:23:40,044 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:23:40,259 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+nlh-reducer.c[38357,38370] [2022-11-25 17:23:40,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:23:40,323 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:23:40,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:40 WrapperNode [2022-11-25 17:23:40,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:23:40,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:23:40,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:23:40,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:23:40,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:40" (1/1) ... [2022-11-25 17:23:40,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:40" (1/1) ... [2022-11-25 17:23:40,519 INFO L138 Inliner]: procedures = 17, calls = 620, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2158 [2022-11-25 17:23:40,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:23:40,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:23:40,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:23:40,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:23:40,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:40" (1/1) ... [2022-11-25 17:23:40,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:40" (1/1) ... [2022-11-25 17:23:40,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:40" (1/1) ... [2022-11-25 17:23:40,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:40" (1/1) ... [2022-11-25 17:23:40,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:40" (1/1) ... [2022-11-25 17:23:40,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:40" (1/1) ... [2022-11-25 17:23:40,654 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:40" (1/1) ... [2022-11-25 17:23:40,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:40" (1/1) ... [2022-11-25 17:23:40,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:23:40,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:23:40,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:23:40,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:23:40,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:40" (1/1) ... [2022-11-25 17:23:40,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:23:40,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:23:40,718 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:23:40,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:23:40,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 17:23:40,760 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2022-11-25 17:23:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:23:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:23:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:23:40,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:23:40,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:23:40,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 17:23:40,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:23:41,016 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:23:41,018 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:23:42,661 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:23:42,673 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:23:42,673 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:23:42,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:23:42 BoogieIcfgContainer [2022-11-25 17:23:42,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:23:42,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:23:42,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:23:42,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:23:42,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:23:39" (1/3) ... [2022-11-25 17:23:42,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df978d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:23:42, skipping insertion in model container [2022-11-25 17:23:42,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:40" (2/3) ... [2022-11-25 17:23:42,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df978d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:23:42, skipping insertion in model container [2022-11-25 17:23:42,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:23:42" (3/3) ... [2022-11-25 17:23:42,685 INFO L112 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+nlh-reducer.c [2022-11-25 17:23:42,705 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:23:42,705 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 168 error locations. [2022-11-25 17:23:42,785 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:23:42,792 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d70cbc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:23:42,792 INFO L358 AbstractCegarLoop]: Starting to check reachability of 168 error locations. [2022-11-25 17:23:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 470 states, 301 states have (on average 2.129568106312292) internal successors, (641), 469 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:42,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 17:23:42,805 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:42,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 17:23:42,806 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:42,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:42,812 INFO L85 PathProgramCache]: Analyzing trace with hash 926754, now seen corresponding path program 1 times [2022-11-25 17:23:42,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:42,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73556948] [2022-11-25 17:23:42,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:42,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:43,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:43,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:43,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73556948] [2022-11-25 17:23:43,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73556948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:43,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:43,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:23:43,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894585431] [2022-11-25 17:23:43,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:43,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:23:43,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:43,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:23:43,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:23:43,267 INFO L87 Difference]: Start difference. First operand has 470 states, 301 states have (on average 2.129568106312292) internal successors, (641), 469 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:44,181 INFO L93 Difference]: Finished difference Result 471 states and 598 transitions. [2022-11-25 17:23:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:23:44,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 17:23:44,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:44,202 INFO L225 Difference]: With dead ends: 471 [2022-11-25 17:23:44,203 INFO L226 Difference]: Without dead ends: 468 [2022-11-25 17:23:44,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:23:44,208 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 166 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:44,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1021 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 17:23:44,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-11-25 17:23:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2022-11-25 17:23:44,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 300 states have (on average 1.98) internal successors, (594), 467 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:44,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 594 transitions. [2022-11-25 17:23:44,301 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 594 transitions. Word has length 4 [2022-11-25 17:23:44,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:44,301 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 594 transitions. [2022-11-25 17:23:44,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 594 transitions. [2022-11-25 17:23:44,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 17:23:44,302 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:44,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 17:23:44,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:23:44,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:44,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:44,304 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-11-25 17:23:44,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:44,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609010257] [2022-11-25 17:23:44,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:44,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:44,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:44,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609010257] [2022-11-25 17:23:44,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609010257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:44,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:44,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:23:44,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853300177] [2022-11-25 17:23:44,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:44,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:23:44,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:44,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:23:44,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:23:44,414 INFO L87 Difference]: Start difference. First operand 468 states and 594 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:45,053 INFO L93 Difference]: Finished difference Result 427 states and 553 transitions. [2022-11-25 17:23:45,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:23:45,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 17:23:45,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:45,056 INFO L225 Difference]: With dead ends: 427 [2022-11-25 17:23:45,056 INFO L226 Difference]: Without dead ends: 427 [2022-11-25 17:23:45,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:45,063 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 841 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:45,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 257 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:23:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-11-25 17:23:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2022-11-25 17:23:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 300 states have (on average 1.8433333333333333) internal successors, (553), 426 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 553 transitions. [2022-11-25 17:23:45,095 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 553 transitions. Word has length 4 [2022-11-25 17:23:45,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:45,096 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 553 transitions. [2022-11-25 17:23:45,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:45,098 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 553 transitions. [2022-11-25 17:23:45,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 17:23:45,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:45,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 17:23:45,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:23:45,101 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:45,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:45,103 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-11-25 17:23:45,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:45,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138082897] [2022-11-25 17:23:45,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:45,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:45,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:45,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138082897] [2022-11-25 17:23:45,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138082897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:45,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:45,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:23:45,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300075778] [2022-11-25 17:23:45,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:45,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:23:45,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:45,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:23:45,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:23:45,383 INFO L87 Difference]: Start difference. First operand 427 states and 553 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:45,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:45,945 INFO L93 Difference]: Finished difference Result 386 states and 512 transitions. [2022-11-25 17:23:45,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:23:45,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 17:23:45,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:45,948 INFO L225 Difference]: With dead ends: 386 [2022-11-25 17:23:45,948 INFO L226 Difference]: Without dead ends: 386 [2022-11-25 17:23:45,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:45,949 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 888 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:45,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 258 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:23:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-11-25 17:23:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2022-11-25 17:23:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 300 states have (on average 1.7066666666666668) internal successors, (512), 385 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 512 transitions. [2022-11-25 17:23:45,970 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 512 transitions. Word has length 4 [2022-11-25 17:23:45,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:45,970 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 512 transitions. [2022-11-25 17:23:45,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 512 transitions. [2022-11-25 17:23:45,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-25 17:23:45,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:45,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:45,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:23:45,974 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:45,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:45,975 INFO L85 PathProgramCache]: Analyzing trace with hash 619918515, now seen corresponding path program 1 times [2022-11-25 17:23:45,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:45,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486904751] [2022-11-25 17:23:45,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:45,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:46,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:46,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:46,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486904751] [2022-11-25 17:23:46,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486904751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:46,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:46,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:23:46,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661651236] [2022-11-25 17:23:46,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:46,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:23:46,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:46,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:23:46,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:23:46,383 INFO L87 Difference]: Start difference. First operand 386 states and 512 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:46,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:46,641 INFO L93 Difference]: Finished difference Result 388 states and 512 transitions. [2022-11-25 17:23:46,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:23:46,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-11-25 17:23:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:46,649 INFO L225 Difference]: With dead ends: 388 [2022-11-25 17:23:46,649 INFO L226 Difference]: Without dead ends: 388 [2022-11-25 17:23:46,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:23:46,651 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 91 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:46,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 760 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:23:46,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2022-11-25 17:23:46,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2022-11-25 17:23:46,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 300 states have (on average 1.7033333333333334) internal successors, (511), 385 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 511 transitions. [2022-11-25 17:23:46,664 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 511 transitions. Word has length 88 [2022-11-25 17:23:46,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:46,665 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 511 transitions. [2022-11-25 17:23:46,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 511 transitions. [2022-11-25 17:23:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-25 17:23:46,669 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:46,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:46,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:23:46,671 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:46,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:46,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2036638706, now seen corresponding path program 1 times [2022-11-25 17:23:46,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:46,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878562474] [2022-11-25 17:23:46,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:46,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:46,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:46,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878562474] [2022-11-25 17:23:46,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878562474] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:46,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:46,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:23:46,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576710197] [2022-11-25 17:23:46,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:46,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:23:46,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:46,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:23:46,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:23:46,998 INFO L87 Difference]: Start difference. First operand 386 states and 511 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:47,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:47,011 INFO L93 Difference]: Finished difference Result 386 states and 510 transitions. [2022-11-25 17:23:47,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:23:47,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-11-25 17:23:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:47,016 INFO L225 Difference]: With dead ends: 386 [2022-11-25 17:23:47,016 INFO L226 Difference]: Without dead ends: 386 [2022-11-25 17:23:47,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:23:47,022 INFO L413 NwaCegarLoop]: 509 mSDtfsCounter, 423 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:47,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 594 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:23:47,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-11-25 17:23:47,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2022-11-25 17:23:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 300 states have (on average 1.7) internal successors, (510), 385 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 510 transitions. [2022-11-25 17:23:47,037 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 510 transitions. Word has length 89 [2022-11-25 17:23:47,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:47,038 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 510 transitions. [2022-11-25 17:23:47,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:47,039 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 510 transitions. [2022-11-25 17:23:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-25 17:23:47,045 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:47,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:47,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:23:47,050 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:47,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:47,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2036637796, now seen corresponding path program 1 times [2022-11-25 17:23:47,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:47,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582353198] [2022-11-25 17:23:47,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:47,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:47,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:47,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582353198] [2022-11-25 17:23:47,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582353198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:47,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:47,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:23:47,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533840040] [2022-11-25 17:23:47,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:47,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:23:47,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:47,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:23:47,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:23:47,384 INFO L87 Difference]: Start difference. First operand 386 states and 510 transitions. Second operand has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:47,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:47,959 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2022-11-25 17:23:47,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:23:47,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-11-25 17:23:47,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:47,961 INFO L225 Difference]: With dead ends: 385 [2022-11-25 17:23:47,961 INFO L226 Difference]: Without dead ends: 385 [2022-11-25 17:23:47,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:47,962 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 589 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:47,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 341 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:23:47,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2022-11-25 17:23:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2022-11-25 17:23:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 300 states have (on average 1.6966666666666668) internal successors, (509), 384 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:47,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 509 transitions. [2022-11-25 17:23:47,979 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 509 transitions. Word has length 89 [2022-11-25 17:23:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:47,981 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 509 transitions. [2022-11-25 17:23:47,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.666666666666668) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 509 transitions. [2022-11-25 17:23:47,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-25 17:23:47,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:47,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:47,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:23:47,985 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:47,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:47,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2036637797, now seen corresponding path program 1 times [2022-11-25 17:23:47,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:47,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53721156] [2022-11-25 17:23:47,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:47,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:48,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:48,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53721156] [2022-11-25 17:23:48,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53721156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:48,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:48,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:23:48,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077956008] [2022-11-25 17:23:48,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:48,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:23:48,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:48,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:23:48,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:48,598 INFO L87 Difference]: Start difference. First operand 385 states and 509 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:49,616 INFO L93 Difference]: Finished difference Result 384 states and 508 transitions. [2022-11-25 17:23:49,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:23:49,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-11-25 17:23:49,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:49,620 INFO L225 Difference]: With dead ends: 384 [2022-11-25 17:23:49,620 INFO L226 Difference]: Without dead ends: 384 [2022-11-25 17:23:49,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:23:49,621 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 882 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:49,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 426 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 17:23:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-11-25 17:23:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2022-11-25 17:23:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 300 states have (on average 1.6933333333333334) internal successors, (508), 383 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 508 transitions. [2022-11-25 17:23:49,635 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 508 transitions. Word has length 89 [2022-11-25 17:23:49,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:49,635 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 508 transitions. [2022-11-25 17:23:49,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 508 transitions. [2022-11-25 17:23:49,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-25 17:23:49,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:49,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:49,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:23:49,644 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:49,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:49,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1296129175, now seen corresponding path program 1 times [2022-11-25 17:23:49,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:49,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219943633] [2022-11-25 17:23:49,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:49,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:50,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:50,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:50,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219943633] [2022-11-25 17:23:50,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219943633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:50,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:50,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:23:50,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765006412] [2022-11-25 17:23:50,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:50,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 17:23:50,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:50,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 17:23:50,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:23:50,504 INFO L87 Difference]: Start difference. First operand 384 states and 508 transitions. Second operand has 9 states, 8 states have (on average 11.375) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:51,459 INFO L93 Difference]: Finished difference Result 383 states and 507 transitions. [2022-11-25 17:23:51,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:23:51,459 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2022-11-25 17:23:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:51,461 INFO L225 Difference]: With dead ends: 383 [2022-11-25 17:23:51,461 INFO L226 Difference]: Without dead ends: 382 [2022-11-25 17:23:51,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-25 17:23:51,462 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 294 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:51,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 675 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 17:23:51,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-11-25 17:23:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2022-11-25 17:23:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 299 states have (on average 1.274247491638796) internal successors, (381), 381 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:51,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 381 transitions. [2022-11-25 17:23:51,470 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 381 transitions. Word has length 91 [2022-11-25 17:23:51,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:51,471 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 381 transitions. [2022-11-25 17:23:51,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:51,471 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 381 transitions. [2022-11-25 17:23:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-25 17:23:51,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:51,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:51,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:23:51,473 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:51,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:51,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2145244098, now seen corresponding path program 1 times [2022-11-25 17:23:51,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:51,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533213195] [2022-11-25 17:23:51,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:51,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:51,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:51,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533213195] [2022-11-25 17:23:51,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533213195] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:51,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:51,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:23:51,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105871427] [2022-11-25 17:23:51,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:51,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:23:51,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:51,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:23:51,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:51,725 INFO L87 Difference]: Start difference. First operand 382 states and 381 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:51,992 INFO L93 Difference]: Finished difference Result 381 states and 380 transitions. [2022-11-25 17:23:51,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:23:51,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2022-11-25 17:23:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:51,994 INFO L225 Difference]: With dead ends: 381 [2022-11-25 17:23:51,994 INFO L226 Difference]: Without dead ends: 381 [2022-11-25 17:23:51,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:23:51,995 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 870 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:51,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 426 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:23:51,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-11-25 17:23:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-11-25 17:23:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 299 states have (on average 1.2709030100334449) internal successors, (380), 380 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:52,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 380 transitions. [2022-11-25 17:23:52,002 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 380 transitions. Word has length 94 [2022-11-25 17:23:52,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:52,003 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 380 transitions. [2022-11-25 17:23:52,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:52,003 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 380 transitions. [2022-11-25 17:23:52,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-25 17:23:52,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:52,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:52,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:23:52,005 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:52,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:52,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2145244097, now seen corresponding path program 1 times [2022-11-25 17:23:52,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:52,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323052045] [2022-11-25 17:23:52,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:52,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:52,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:52,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:52,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323052045] [2022-11-25 17:23:52,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323052045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:52,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:52,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:23:52,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689076815] [2022-11-25 17:23:52,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:52,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:23:52,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:52,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:23:52,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:52,522 INFO L87 Difference]: Start difference. First operand 381 states and 380 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:53,083 INFO L93 Difference]: Finished difference Result 380 states and 379 transitions. [2022-11-25 17:23:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:23:53,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2022-11-25 17:23:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:53,085 INFO L225 Difference]: With dead ends: 380 [2022-11-25 17:23:53,086 INFO L226 Difference]: Without dead ends: 380 [2022-11-25 17:23:53,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:23:53,086 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 740 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:53,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 424 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:23:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-11-25 17:23:53,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2022-11-25 17:23:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 299 states have (on average 1.2675585284280937) internal successors, (379), 379 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 379 transitions. [2022-11-25 17:23:53,094 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 379 transitions. Word has length 94 [2022-11-25 17:23:53,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:53,094 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 379 transitions. [2022-11-25 17:23:53,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:53,094 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 379 transitions. [2022-11-25 17:23:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-25 17:23:53,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:53,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:53,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:23:53,096 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:53,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:53,096 INFO L85 PathProgramCache]: Analyzing trace with hash -837057419, now seen corresponding path program 1 times [2022-11-25 17:23:53,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:53,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082396558] [2022-11-25 17:23:53,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:53,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:53,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:53,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082396558] [2022-11-25 17:23:53,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082396558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:53,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:53,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:23:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914173754] [2022-11-25 17:23:53,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:53,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:23:53,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:53,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:23:53,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:53,322 INFO L87 Difference]: Start difference. First operand 380 states and 379 transitions. Second operand has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:53,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:53,607 INFO L93 Difference]: Finished difference Result 379 states and 378 transitions. [2022-11-25 17:23:53,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:23:53,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-11-25 17:23:53,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:53,609 INFO L225 Difference]: With dead ends: 379 [2022-11-25 17:23:53,609 INFO L226 Difference]: Without dead ends: 379 [2022-11-25 17:23:53,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:23:53,610 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 854 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:53,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 428 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:23:53,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-11-25 17:23:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2022-11-25 17:23:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 299 states have (on average 1.2642140468227425) internal successors, (378), 378 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 378 transitions. [2022-11-25 17:23:53,617 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 378 transitions. Word has length 99 [2022-11-25 17:23:53,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:53,617 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 378 transitions. [2022-11-25 17:23:53,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.75) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 378 transitions. [2022-11-25 17:23:53,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-25 17:23:53,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:53,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:53,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:23:53,619 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:53,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:53,620 INFO L85 PathProgramCache]: Analyzing trace with hash -837057418, now seen corresponding path program 1 times [2022-11-25 17:23:53,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:53,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661906420] [2022-11-25 17:23:53,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:53,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:54,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:54,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661906420] [2022-11-25 17:23:54,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661906420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:54,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:54,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:23:54,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821957915] [2022-11-25 17:23:54,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:54,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:23:54,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:54,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:23:54,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:23:54,215 INFO L87 Difference]: Start difference. First operand 379 states and 378 transitions. Second operand has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:54,861 INFO L93 Difference]: Finished difference Result 378 states and 377 transitions. [2022-11-25 17:23:54,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:23:54,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2022-11-25 17:23:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:54,863 INFO L225 Difference]: With dead ends: 378 [2022-11-25 17:23:54,863 INFO L226 Difference]: Without dead ends: 378 [2022-11-25 17:23:54,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:23:54,864 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 1008 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:54,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 429 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:23:54,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-11-25 17:23:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2022-11-25 17:23:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 299 states have (on average 1.2608695652173914) internal successors, (377), 377 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 377 transitions. [2022-11-25 17:23:54,871 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 377 transitions. Word has length 99 [2022-11-25 17:23:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:54,871 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 377 transitions. [2022-11-25 17:23:54,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 377 transitions. [2022-11-25 17:23:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-25 17:23:54,873 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:54,873 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:54,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:23:54,874 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:54,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:54,874 INFO L85 PathProgramCache]: Analyzing trace with hash -586464657, now seen corresponding path program 1 times [2022-11-25 17:23:54,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:54,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172197415] [2022-11-25 17:23:54,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:54,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:55,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:55,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172197415] [2022-11-25 17:23:55,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172197415] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:55,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:55,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:23:55,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304850664] [2022-11-25 17:23:55,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:55,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:23:55,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:55,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:23:55,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:55,111 INFO L87 Difference]: Start difference. First operand 378 states and 377 transitions. Second operand has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:55,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:55,390 INFO L93 Difference]: Finished difference Result 377 states and 376 transitions. [2022-11-25 17:23:55,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:23:55,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-11-25 17:23:55,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:55,393 INFO L225 Difference]: With dead ends: 377 [2022-11-25 17:23:55,393 INFO L226 Difference]: Without dead ends: 377 [2022-11-25 17:23:55,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:23:55,393 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 838 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:55,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 430 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:23:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-25 17:23:55,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2022-11-25 17:23:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 299 states have (on average 1.2575250836120402) internal successors, (376), 376 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 376 transitions. [2022-11-25 17:23:55,402 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 376 transitions. Word has length 104 [2022-11-25 17:23:55,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:55,402 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 376 transitions. [2022-11-25 17:23:55,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 26.0) internal successors, (104), 5 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:55,403 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 376 transitions. [2022-11-25 17:23:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-25 17:23:55,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:55,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:55,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:23:55,405 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:55,405 INFO L85 PathProgramCache]: Analyzing trace with hash -586464656, now seen corresponding path program 1 times [2022-11-25 17:23:55,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:55,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337583482] [2022-11-25 17:23:55,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:55,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:56,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:56,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337583482] [2022-11-25 17:23:56,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337583482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:56,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:56,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:23:56,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580735170] [2022-11-25 17:23:56,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:56,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:23:56,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:56,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:23:56,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:23:56,077 INFO L87 Difference]: Start difference. First operand 377 states and 376 transitions. Second operand has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:56,777 INFO L93 Difference]: Finished difference Result 376 states and 375 transitions. [2022-11-25 17:23:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:23:56,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-11-25 17:23:56,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:56,779 INFO L225 Difference]: With dead ends: 376 [2022-11-25 17:23:56,780 INFO L226 Difference]: Without dead ends: 376 [2022-11-25 17:23:56,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:23:56,780 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 998 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:56,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 472 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:23:56,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-11-25 17:23:56,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2022-11-25 17:23:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 299 states have (on average 1.254180602006689) internal successors, (375), 375 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:56,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 375 transitions. [2022-11-25 17:23:56,789 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 375 transitions. Word has length 104 [2022-11-25 17:23:56,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:56,789 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 375 transitions. [2022-11-25 17:23:56,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.333333333333332) internal successors, (104), 7 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 375 transitions. [2022-11-25 17:23:56,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-25 17:23:56,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:56,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:56,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:23:56,791 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:56,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:56,792 INFO L85 PathProgramCache]: Analyzing trace with hash -84099962, now seen corresponding path program 1 times [2022-11-25 17:23:56,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:56,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454372701] [2022-11-25 17:23:56,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:56,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:57,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:57,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:57,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454372701] [2022-11-25 17:23:57,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454372701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:57,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:57,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:23:57,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132910629] [2022-11-25 17:23:57,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:57,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:23:57,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:57,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:23:57,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:57,036 INFO L87 Difference]: Start difference. First operand 376 states and 375 transitions. Second operand has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 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-25 17:23:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:57,304 INFO L93 Difference]: Finished difference Result 375 states and 374 transitions. [2022-11-25 17:23:57,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:23:57,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 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) Word has length 109 [2022-11-25 17:23:57,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:57,307 INFO L225 Difference]: With dead ends: 375 [2022-11-25 17:23:57,307 INFO L226 Difference]: Without dead ends: 375 [2022-11-25 17:23:57,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:23:57,307 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 822 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:57,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 432 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:23:57,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-11-25 17:23:57,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2022-11-25 17:23:57,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 299 states have (on average 1.2508361204013378) internal successors, (374), 374 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 374 transitions. [2022-11-25 17:23:57,317 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 374 transitions. Word has length 109 [2022-11-25 17:23:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:57,317 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 374 transitions. [2022-11-25 17:23:57,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 27.25) internal successors, (109), 5 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-25 17:23:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 374 transitions. [2022-11-25 17:23:57,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-25 17:23:57,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:57,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:57,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:23:57,320 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:57,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:57,320 INFO L85 PathProgramCache]: Analyzing trace with hash -84099961, now seen corresponding path program 1 times [2022-11-25 17:23:57,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:57,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623202859] [2022-11-25 17:23:57,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:57,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:57,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:57,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623202859] [2022-11-25 17:23:57,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623202859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:57,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:57,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:23:57,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650522012] [2022-11-25 17:23:57,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:57,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:23:57,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:57,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:23:57,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:23:57,921 INFO L87 Difference]: Start difference. First operand 375 states and 374 transitions. Second operand has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 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-25 17:23:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:58,552 INFO L93 Difference]: Finished difference Result 374 states and 373 transitions. [2022-11-25 17:23:58,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:23:58,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 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) Word has length 109 [2022-11-25 17:23:58,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:58,555 INFO L225 Difference]: With dead ends: 374 [2022-11-25 17:23:58,555 INFO L226 Difference]: Without dead ends: 374 [2022-11-25 17:23:58,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:23:58,556 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 1252 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:58,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 433 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:23:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2022-11-25 17:23:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2022-11-25 17:23:58,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 299 states have (on average 1.2474916387959867) internal successors, (373), 373 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 373 transitions. [2022-11-25 17:23:58,565 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 373 transitions. Word has length 109 [2022-11-25 17:23:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:58,565 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 373 transitions. [2022-11-25 17:23:58,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 18.166666666666668) internal successors, (109), 7 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-25 17:23:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 373 transitions. [2022-11-25 17:23:58,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-25 17:23:58,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:58,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:58,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:23:58,572 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:58,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:58,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1126073504, now seen corresponding path program 1 times [2022-11-25 17:23:58,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:58,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112483377] [2022-11-25 17:23:58,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:58,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:58,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:58,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:58,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112483377] [2022-11-25 17:23:58,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112483377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:58,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:58,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:23:58,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22992401] [2022-11-25 17:23:58,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:58,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:23:58,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:58,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:23:58,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:58,834 INFO L87 Difference]: Start difference. First operand 374 states and 373 transitions. Second operand has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:23:59,113 INFO L93 Difference]: Finished difference Result 373 states and 372 transitions. [2022-11-25 17:23:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:23:59,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-11-25 17:23:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:23:59,115 INFO L225 Difference]: With dead ends: 373 [2022-11-25 17:23:59,115 INFO L226 Difference]: Without dead ends: 373 [2022-11-25 17:23:59,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:23:59,116 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 806 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:23:59,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 434 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:23:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-11-25 17:23:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2022-11-25 17:23:59,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 299 states have (on average 1.2441471571906355) internal successors, (372), 372 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 372 transitions. [2022-11-25 17:23:59,124 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 372 transitions. Word has length 114 [2022-11-25 17:23:59,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:23:59,124 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 372 transitions. [2022-11-25 17:23:59,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 28.5) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:59,124 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 372 transitions. [2022-11-25 17:23:59,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-25 17:23:59,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:23:59,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:59,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 17:23:59,126 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:23:59,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:59,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1126073505, now seen corresponding path program 1 times [2022-11-25 17:23:59,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:59,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002700569] [2022-11-25 17:23:59,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:59,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:59,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:59,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:59,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002700569] [2022-11-25 17:23:59,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002700569] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:59,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:59,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:23:59,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949439622] [2022-11-25 17:23:59,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:59,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:23:59,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:59,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:23:59,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:23:59,799 INFO L87 Difference]: Start difference. First operand 373 states and 372 transitions. Second operand has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:00,426 INFO L93 Difference]: Finished difference Result 372 states and 371 transitions. [2022-11-25 17:24:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:00,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-11-25 17:24:00,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:00,428 INFO L225 Difference]: With dead ends: 372 [2022-11-25 17:24:00,428 INFO L226 Difference]: Without dead ends: 372 [2022-11-25 17:24:00,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:00,429 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 694 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:00,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 476 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-11-25 17:24:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2022-11-25 17:24:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 299 states have (on average 1.2408026755852843) internal successors, (371), 371 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 371 transitions. [2022-11-25 17:24:00,437 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 371 transitions. Word has length 114 [2022-11-25 17:24:00,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:00,437 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 371 transitions. [2022-11-25 17:24:00,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:00,438 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 371 transitions. [2022-11-25 17:24:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-25 17:24:00,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:00,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:00,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 17:24:00,440 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:00,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1580157079, now seen corresponding path program 1 times [2022-11-25 17:24:00,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:00,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327443411] [2022-11-25 17:24:00,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:00,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:00,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:00,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327443411] [2022-11-25 17:24:00,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327443411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:00,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:00,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:24:00,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829389399] [2022-11-25 17:24:00,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:00,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:24:00,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:00,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:24:00,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:00,695 INFO L87 Difference]: Start difference. First operand 372 states and 371 transitions. Second operand has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 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-25 17:24:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:00,974 INFO L93 Difference]: Finished difference Result 371 states and 370 transitions. [2022-11-25 17:24:00,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:24:00,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 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) Word has length 119 [2022-11-25 17:24:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:00,977 INFO L225 Difference]: With dead ends: 371 [2022-11-25 17:24:00,977 INFO L226 Difference]: Without dead ends: 371 [2022-11-25 17:24:00,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:24:00,978 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 790 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:00,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 436 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:00,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-11-25 17:24:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2022-11-25 17:24:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 299 states have (on average 1.2374581939799332) internal successors, (370), 370 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 370 transitions. [2022-11-25 17:24:00,986 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 370 transitions. Word has length 119 [2022-11-25 17:24:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:00,986 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 370 transitions. [2022-11-25 17:24:00,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 29.75) internal successors, (119), 5 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-25 17:24:00,987 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 370 transitions. [2022-11-25 17:24:00,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-25 17:24:00,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:00,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:00,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 17:24:00,988 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:00,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:00,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1580157080, now seen corresponding path program 1 times [2022-11-25 17:24:00,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:00,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907935866] [2022-11-25 17:24:00,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:00,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:01,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:01,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907935866] [2022-11-25 17:24:01,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907935866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:01,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:01,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:01,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770088620] [2022-11-25 17:24:01,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:01,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:01,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:01,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:01,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:01,573 INFO L87 Difference]: Start difference. First operand 371 states and 370 transitions. Second operand has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 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-25 17:24:02,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:02,225 INFO L93 Difference]: Finished difference Result 370 states and 369 transitions. [2022-11-25 17:24:02,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:02,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 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) Word has length 119 [2022-11-25 17:24:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:02,227 INFO L225 Difference]: With dead ends: 370 [2022-11-25 17:24:02,227 INFO L226 Difference]: Without dead ends: 370 [2022-11-25 17:24:02,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:02,228 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 936 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:02,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 437 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:02,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-11-25 17:24:02,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2022-11-25 17:24:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 299 states have (on average 1.234113712374582) internal successors, (369), 369 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 369 transitions. [2022-11-25 17:24:02,235 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 369 transitions. Word has length 119 [2022-11-25 17:24:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:02,236 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 369 transitions. [2022-11-25 17:24:02,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.8) internal successors, (119), 6 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-25 17:24:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 369 transitions. [2022-11-25 17:24:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-25 17:24:02,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:02,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:02,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 17:24:02,238 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:02,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:02,239 INFO L85 PathProgramCache]: Analyzing trace with hash 345305810, now seen corresponding path program 1 times [2022-11-25 17:24:02,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:02,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919078473] [2022-11-25 17:24:02,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:02,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:02,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:02,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919078473] [2022-11-25 17:24:02,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919078473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:02,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:02,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:02,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701574469] [2022-11-25 17:24:02,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:02,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:02,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:02,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:02,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:02,934 INFO L87 Difference]: Start difference. First operand 370 states and 369 transitions. Second operand has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:03,578 INFO L93 Difference]: Finished difference Result 369 states and 368 transitions. [2022-11-25 17:24:03,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:03,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2022-11-25 17:24:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:03,580 INFO L225 Difference]: With dead ends: 369 [2022-11-25 17:24:03,580 INFO L226 Difference]: Without dead ends: 369 [2022-11-25 17:24:03,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:03,581 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 675 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:03,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 480 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:03,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-11-25 17:24:03,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2022-11-25 17:24:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 299 states have (on average 1.2307692307692308) internal successors, (368), 368 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 368 transitions. [2022-11-25 17:24:03,589 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 368 transitions. Word has length 124 [2022-11-25 17:24:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:03,590 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 368 transitions. [2022-11-25 17:24:03,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 368 transitions. [2022-11-25 17:24:03,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-25 17:24:03,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:03,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:03,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 17:24:03,592 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:03,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:03,593 INFO L85 PathProgramCache]: Analyzing trace with hash 345305809, now seen corresponding path program 1 times [2022-11-25 17:24:03,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:03,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429581665] [2022-11-25 17:24:03,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:03,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:03,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:03,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429581665] [2022-11-25 17:24:03,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429581665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:03,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:03,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:24:03,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869435310] [2022-11-25 17:24:03,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:03,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:24:03,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:03,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:24:03,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:03,831 INFO L87 Difference]: Start difference. First operand 369 states and 368 transitions. Second operand has 5 states, 4 states have (on average 31.0) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:04,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:04,101 INFO L93 Difference]: Finished difference Result 368 states and 367 transitions. [2022-11-25 17:24:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:24:04,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 31.0) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2022-11-25 17:24:04,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:04,104 INFO L225 Difference]: With dead ends: 368 [2022-11-25 17:24:04,104 INFO L226 Difference]: Without dead ends: 368 [2022-11-25 17:24:04,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:24:04,105 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 771 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:04,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 438 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:04,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-11-25 17:24:04,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2022-11-25 17:24:04,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 299 states have (on average 1.2274247491638797) internal successors, (367), 367 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 367 transitions. [2022-11-25 17:24:04,112 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 367 transitions. Word has length 124 [2022-11-25 17:24:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:04,112 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 367 transitions. [2022-11-25 17:24:04,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 31.0) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 367 transitions. [2022-11-25 17:24:04,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-25 17:24:04,114 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:04,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:04,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 17:24:04,114 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:04,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:04,115 INFO L85 PathProgramCache]: Analyzing trace with hash 286927016, now seen corresponding path program 1 times [2022-11-25 17:24:04,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:04,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143894756] [2022-11-25 17:24:04,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:04,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:04,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:04,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:04,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143894756] [2022-11-25 17:24:04,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143894756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:04,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:04,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:04,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383219985] [2022-11-25 17:24:04,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:04,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:04,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:04,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:04,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:04,374 INFO L87 Difference]: Start difference. First operand 368 states and 367 transitions. Second operand has 4 states, 3 states have (on average 43.0) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:04,620 INFO L93 Difference]: Finished difference Result 367 states and 366 transitions. [2022-11-25 17:24:04,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:04,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 43.0) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2022-11-25 17:24:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:04,622 INFO L225 Difference]: With dead ends: 367 [2022-11-25 17:24:04,622 INFO L226 Difference]: Without dead ends: 367 [2022-11-25 17:24:04,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:04,623 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 477 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:04,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 355 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-11-25 17:24:04,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2022-11-25 17:24:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 299 states have (on average 1.2240802675585285) internal successors, (366), 366 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 366 transitions. [2022-11-25 17:24:04,630 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 366 transitions. Word has length 129 [2022-11-25 17:24:04,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:04,630 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 366 transitions. [2022-11-25 17:24:04,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 43.0) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 366 transitions. [2022-11-25 17:24:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-11-25 17:24:04,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:04,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:04,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 17:24:04,632 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:04,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:04,633 INFO L85 PathProgramCache]: Analyzing trace with hash 286927017, now seen corresponding path program 1 times [2022-11-25 17:24:04,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:04,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792351049] [2022-11-25 17:24:04,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:04,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:05,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:05,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792351049] [2022-11-25 17:24:05,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792351049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:05,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:05,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:24:05,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148709758] [2022-11-25 17:24:05,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:05,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:24:05,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:05,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:24:05,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:24:05,309 INFO L87 Difference]: Start difference. First operand 367 states and 366 transitions. Second operand has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:05,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:05,982 INFO L93 Difference]: Finished difference Result 366 states and 365 transitions. [2022-11-25 17:24:05,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:05,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2022-11-25 17:24:05,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:05,984 INFO L225 Difference]: With dead ends: 366 [2022-11-25 17:24:05,984 INFO L226 Difference]: Without dead ends: 366 [2022-11-25 17:24:05,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:24:05,985 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 661 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:05,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 482 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:05,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-11-25 17:24:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2022-11-25 17:24:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 299 states have (on average 1.2207357859531773) internal successors, (365), 365 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 365 transitions. [2022-11-25 17:24:05,994 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 365 transitions. Word has length 129 [2022-11-25 17:24:05,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:05,995 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 365 transitions. [2022-11-25 17:24:05,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.5) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 365 transitions. [2022-11-25 17:24:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-25 17:24:05,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:05,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:05,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 17:24:05,998 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:05,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:05,998 INFO L85 PathProgramCache]: Analyzing trace with hash 6786306, now seen corresponding path program 1 times [2022-11-25 17:24:05,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:05,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796487778] [2022-11-25 17:24:05,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:05,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:06,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:06,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796487778] [2022-11-25 17:24:06,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796487778] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:06,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:06,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:06,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898977495] [2022-11-25 17:24:06,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:06,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:06,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:06,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:06,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:06,273 INFO L87 Difference]: Start difference. First operand 366 states and 365 transitions. Second operand has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:06,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:06,531 INFO L93 Difference]: Finished difference Result 365 states and 364 transitions. [2022-11-25 17:24:06,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:06,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2022-11-25 17:24:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:06,533 INFO L225 Difference]: With dead ends: 365 [2022-11-25 17:24:06,533 INFO L226 Difference]: Without dead ends: 365 [2022-11-25 17:24:06,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:06,534 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 463 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:06,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 357 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:06,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-11-25 17:24:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-11-25 17:24:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 299 states have (on average 1.2173913043478262) internal successors, (364), 364 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 364 transitions. [2022-11-25 17:24:06,541 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 364 transitions. Word has length 134 [2022-11-25 17:24:06,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:06,541 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 364 transitions. [2022-11-25 17:24:06,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:06,541 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 364 transitions. [2022-11-25 17:24:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-25 17:24:06,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:06,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:06,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 17:24:06,548 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:06,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:06,549 INFO L85 PathProgramCache]: Analyzing trace with hash 6786307, now seen corresponding path program 1 times [2022-11-25 17:24:06,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:06,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182090240] [2022-11-25 17:24:06,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:06,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:07,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:07,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182090240] [2022-11-25 17:24:07,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182090240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:07,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:07,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:24:07,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954919689] [2022-11-25 17:24:07,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:07,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:24:07,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:07,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:24:07,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:24:07,216 INFO L87 Difference]: Start difference. First operand 365 states and 364 transitions. Second operand has 7 states, 6 states have (on average 22.333333333333332) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:07,851 INFO L93 Difference]: Finished difference Result 364 states and 363 transitions. [2022-11-25 17:24:07,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:07,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 22.333333333333332) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2022-11-25 17:24:07,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:07,854 INFO L225 Difference]: With dead ends: 364 [2022-11-25 17:24:07,854 INFO L226 Difference]: Without dead ends: 364 [2022-11-25 17:24:07,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:24:07,855 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 920 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:07,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 484 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-11-25 17:24:07,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2022-11-25 17:24:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 299 states have (on average 1.214046822742475) internal successors, (363), 363 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 363 transitions. [2022-11-25 17:24:07,862 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 363 transitions. Word has length 134 [2022-11-25 17:24:07,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:07,862 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 363 transitions. [2022-11-25 17:24:07,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 22.333333333333332) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:07,862 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 363 transitions. [2022-11-25 17:24:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-25 17:24:07,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:07,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:07,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 17:24:07,864 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:07,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:07,865 INFO L85 PathProgramCache]: Analyzing trace with hash -664511303, now seen corresponding path program 1 times [2022-11-25 17:24:07,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:07,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125013730] [2022-11-25 17:24:07,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:07,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:08,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:08,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125013730] [2022-11-25 17:24:08,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125013730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:08,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:08,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:08,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479503251] [2022-11-25 17:24:08,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:08,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:08,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:08,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:08,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:08,113 INFO L87 Difference]: Start difference. First operand 364 states and 363 transitions. Second operand has 4 states, 3 states have (on average 46.333333333333336) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:08,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:08,390 INFO L93 Difference]: Finished difference Result 363 states and 362 transitions. [2022-11-25 17:24:08,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:08,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 46.333333333333336) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2022-11-25 17:24:08,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:08,392 INFO L225 Difference]: With dead ends: 363 [2022-11-25 17:24:08,392 INFO L226 Difference]: Without dead ends: 363 [2022-11-25 17:24:08,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:08,392 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 449 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:08,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 359 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:24:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-11-25 17:24:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2022-11-25 17:24:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 299 states have (on average 1.2107023411371238) internal successors, (362), 362 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 362 transitions. [2022-11-25 17:24:08,399 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 362 transitions. Word has length 139 [2022-11-25 17:24:08,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:08,400 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 362 transitions. [2022-11-25 17:24:08,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 46.333333333333336) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 362 transitions. [2022-11-25 17:24:08,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-25 17:24:08,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:08,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:08,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 17:24:08,402 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:08,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:08,403 INFO L85 PathProgramCache]: Analyzing trace with hash -664511302, now seen corresponding path program 1 times [2022-11-25 17:24:08,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:08,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155394842] [2022-11-25 17:24:08,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:08,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:09,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:09,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155394842] [2022-11-25 17:24:09,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155394842] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:09,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:09,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:09,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350878785] [2022-11-25 17:24:09,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:09,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:09,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:09,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:09,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:09,033 INFO L87 Difference]: Start difference. First operand 363 states and 362 transitions. Second operand has 6 states, 5 states have (on average 27.8) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:09,662 INFO L93 Difference]: Finished difference Result 362 states and 361 transitions. [2022-11-25 17:24:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:09,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 27.8) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2022-11-25 17:24:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:09,665 INFO L225 Difference]: With dead ends: 362 [2022-11-25 17:24:09,665 INFO L226 Difference]: Without dead ends: 362 [2022-11-25 17:24:09,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:09,665 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 639 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:09,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 486 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:09,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-11-25 17:24:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2022-11-25 17:24:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 299 states have (on average 1.2073578595317727) internal successors, (361), 361 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 361 transitions. [2022-11-25 17:24:09,673 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 361 transitions. Word has length 139 [2022-11-25 17:24:09,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:09,674 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 361 transitions. [2022-11-25 17:24:09,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 27.8) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:09,674 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 361 transitions. [2022-11-25 17:24:09,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-25 17:24:09,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:09,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:09,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 17:24:09,676 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:09,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:09,677 INFO L85 PathProgramCache]: Analyzing trace with hash 307188531, now seen corresponding path program 1 times [2022-11-25 17:24:09,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:09,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999723347] [2022-11-25 17:24:09,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:09,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:09,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:09,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999723347] [2022-11-25 17:24:09,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999723347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:09,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:09,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:09,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648601573] [2022-11-25 17:24:09,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:09,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:09,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:09,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:09,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:09,932 INFO L87 Difference]: Start difference. First operand 362 states and 361 transitions. Second operand has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:10,170 INFO L93 Difference]: Finished difference Result 361 states and 360 transitions. [2022-11-25 17:24:10,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:10,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2022-11-25 17:24:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:10,172 INFO L225 Difference]: With dead ends: 361 [2022-11-25 17:24:10,172 INFO L226 Difference]: Without dead ends: 361 [2022-11-25 17:24:10,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:10,173 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 435 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:10,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 361 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-11-25 17:24:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2022-11-25 17:24:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 299 states have (on average 1.2040133779264215) internal successors, (360), 360 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 360 transitions. [2022-11-25 17:24:10,179 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 360 transitions. Word has length 144 [2022-11-25 17:24:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:10,179 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 360 transitions. [2022-11-25 17:24:10,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 48.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 360 transitions. [2022-11-25 17:24:10,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-11-25 17:24:10,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:10,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:10,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 17:24:10,181 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:10,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:10,182 INFO L85 PathProgramCache]: Analyzing trace with hash 307188532, now seen corresponding path program 1 times [2022-11-25 17:24:10,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:10,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998087014] [2022-11-25 17:24:10,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:10,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:10,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:10,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998087014] [2022-11-25 17:24:10,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998087014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:10,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:10,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:24:10,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458175263] [2022-11-25 17:24:10,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:10,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:24:10,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:10,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:24:10,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:24:10,859 INFO L87 Difference]: Start difference. First operand 361 states and 360 transitions. Second operand has 7 states, 6 states have (on average 24.0) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:11,519 INFO L93 Difference]: Finished difference Result 360 states and 359 transitions. [2022-11-25 17:24:11,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:11,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 24.0) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2022-11-25 17:24:11,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:11,528 INFO L225 Difference]: With dead ends: 360 [2022-11-25 17:24:11,528 INFO L226 Difference]: Without dead ends: 360 [2022-11-25 17:24:11,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:24:11,529 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 894 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:11,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 488 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:11,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-11-25 17:24:11,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2022-11-25 17:24:11,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 299 states have (on average 1.2006688963210703) internal successors, (359), 359 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 359 transitions. [2022-11-25 17:24:11,537 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 359 transitions. Word has length 144 [2022-11-25 17:24:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:11,537 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 359 transitions. [2022-11-25 17:24:11,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 24.0) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:11,538 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 359 transitions. [2022-11-25 17:24:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-25 17:24:11,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:11,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:11,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-25 17:24:11,540 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:11,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:11,540 INFO L85 PathProgramCache]: Analyzing trace with hash 334816458, now seen corresponding path program 1 times [2022-11-25 17:24:11,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:11,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724449715] [2022-11-25 17:24:11,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:11,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:11,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:11,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724449715] [2022-11-25 17:24:11,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724449715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:11,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:11,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:11,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189818547] [2022-11-25 17:24:11,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:11,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:11,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:11,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:11,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:11,805 INFO L87 Difference]: Start difference. First operand 360 states and 359 transitions. Second operand has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:12,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:12,050 INFO L93 Difference]: Finished difference Result 359 states and 358 transitions. [2022-11-25 17:24:12,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:12,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2022-11-25 17:24:12,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:12,052 INFO L225 Difference]: With dead ends: 359 [2022-11-25 17:24:12,052 INFO L226 Difference]: Without dead ends: 359 [2022-11-25 17:24:12,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:12,053 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 421 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:12,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 363 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:12,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-11-25 17:24:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2022-11-25 17:24:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 299 states have (on average 1.1973244147157192) internal successors, (358), 358 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 358 transitions. [2022-11-25 17:24:12,059 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 358 transitions. Word has length 149 [2022-11-25 17:24:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:12,060 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 358 transitions. [2022-11-25 17:24:12,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 358 transitions. [2022-11-25 17:24:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-25 17:24:12,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:12,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:12,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-25 17:24:12,062 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:12,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:12,063 INFO L85 PathProgramCache]: Analyzing trace with hash 334816459, now seen corresponding path program 1 times [2022-11-25 17:24:12,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:12,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413233713] [2022-11-25 17:24:12,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:12,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:12,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:12,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:12,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413233713] [2022-11-25 17:24:12,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413233713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:12,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:12,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:24:12,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472082565] [2022-11-25 17:24:12,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:12,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:24:12,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:12,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:24:12,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:24:12,802 INFO L87 Difference]: Start difference. First operand 359 states and 358 transitions. Second operand has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:13,402 INFO L93 Difference]: Finished difference Result 358 states and 357 transitions. [2022-11-25 17:24:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:13,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2022-11-25 17:24:13,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:13,404 INFO L225 Difference]: With dead ends: 358 [2022-11-25 17:24:13,404 INFO L226 Difference]: Without dead ends: 358 [2022-11-25 17:24:13,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:24:13,405 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 828 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:13,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 449 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2022-11-25 17:24:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2022-11-25 17:24:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 299 states have (on average 1.193979933110368) internal successors, (357), 357 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:13,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 357 transitions. [2022-11-25 17:24:13,413 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 357 transitions. Word has length 149 [2022-11-25 17:24:13,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:13,413 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 357 transitions. [2022-11-25 17:24:13,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 24.833333333333332) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:13,413 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 357 transitions. [2022-11-25 17:24:13,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-25 17:24:13,415 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:13,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:13,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-25 17:24:13,415 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:13,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:13,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1027259036, now seen corresponding path program 1 times [2022-11-25 17:24:13,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:13,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201270585] [2022-11-25 17:24:13,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:13,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:13,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:13,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201270585] [2022-11-25 17:24:13,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201270585] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:13,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:13,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:13,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337942088] [2022-11-25 17:24:13,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:13,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:13,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:13,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:13,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:13,709 INFO L87 Difference]: Start difference. First operand 358 states and 357 transitions. Second operand has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 4 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-25 17:24:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:13,950 INFO L93 Difference]: Finished difference Result 357 states and 356 transitions. [2022-11-25 17:24:13,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:13,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 4 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) Word has length 154 [2022-11-25 17:24:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:13,952 INFO L225 Difference]: With dead ends: 357 [2022-11-25 17:24:13,952 INFO L226 Difference]: Without dead ends: 357 [2022-11-25 17:24:13,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:13,953 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 407 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:13,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 365 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-11-25 17:24:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2022-11-25 17:24:13,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 299 states have (on average 1.1906354515050168) internal successors, (356), 356 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:13,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 356 transitions. [2022-11-25 17:24:13,960 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 356 transitions. Word has length 154 [2022-11-25 17:24:13,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:13,960 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 356 transitions. [2022-11-25 17:24:13,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 4 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-25 17:24:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 356 transitions. [2022-11-25 17:24:13,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-25 17:24:13,962 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:13,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:13,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-25 17:24:13,963 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:13,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:13,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1027259035, now seen corresponding path program 1 times [2022-11-25 17:24:13,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:13,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047276795] [2022-11-25 17:24:13,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:13,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:14,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:14,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047276795] [2022-11-25 17:24:14,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047276795] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:14,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:14,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:14,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507386521] [2022-11-25 17:24:14,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:14,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:14,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:14,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:14,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:14,591 INFO L87 Difference]: Start difference. First operand 357 states and 356 transitions. Second operand has 6 states, 5 states have (on average 30.8) internal successors, (154), 6 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-25 17:24:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:15,188 INFO L93 Difference]: Finished difference Result 356 states and 355 transitions. [2022-11-25 17:24:15,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:15,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 30.8) internal successors, (154), 6 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) Word has length 154 [2022-11-25 17:24:15,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:15,190 INFO L225 Difference]: With dead ends: 356 [2022-11-25 17:24:15,190 INFO L226 Difference]: Without dead ends: 356 [2022-11-25 17:24:15,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:15,191 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 606 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:15,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [606 Valid, 492 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-11-25 17:24:15,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2022-11-25 17:24:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 299 states have (on average 1.1872909698996656) internal successors, (355), 355 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 355 transitions. [2022-11-25 17:24:15,197 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 355 transitions. Word has length 154 [2022-11-25 17:24:15,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:15,198 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 355 transitions. [2022-11-25 17:24:15,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.8) internal successors, (154), 6 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-25 17:24:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 355 transitions. [2022-11-25 17:24:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-25 17:24:15,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:15,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:15,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-25 17:24:15,201 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:15,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:15,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1359822629, now seen corresponding path program 1 times [2022-11-25 17:24:15,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:15,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207444584] [2022-11-25 17:24:15,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:15,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:15,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:15,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207444584] [2022-11-25 17:24:15,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207444584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:15,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:15,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:15,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797032668] [2022-11-25 17:24:15,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:15,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:15,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:15,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:15,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:15,462 INFO L87 Difference]: Start difference. First operand 356 states and 355 transitions. Second operand has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 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-25 17:24:15,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:15,697 INFO L93 Difference]: Finished difference Result 355 states and 354 transitions. [2022-11-25 17:24:15,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:15,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 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) Word has length 159 [2022-11-25 17:24:15,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:15,699 INFO L225 Difference]: With dead ends: 355 [2022-11-25 17:24:15,699 INFO L226 Difference]: Without dead ends: 355 [2022-11-25 17:24:15,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:15,700 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 393 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:15,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 367 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:15,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-11-25 17:24:15,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2022-11-25 17:24:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 299 states have (on average 1.1839464882943145) internal successors, (354), 354 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:15,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 354 transitions. [2022-11-25 17:24:15,707 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 354 transitions. Word has length 159 [2022-11-25 17:24:15,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:15,707 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 354 transitions. [2022-11-25 17:24:15,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 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-25 17:24:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 354 transitions. [2022-11-25 17:24:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-25 17:24:15,709 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:15,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:15,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-25 17:24:15,710 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:15,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:15,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1359822628, now seen corresponding path program 1 times [2022-11-25 17:24:15,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:15,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334538223] [2022-11-25 17:24:15,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:15,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:16,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:16,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334538223] [2022-11-25 17:24:16,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334538223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:16,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:16,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:24:16,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369629988] [2022-11-25 17:24:16,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:16,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:24:16,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:16,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:24:16,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:24:16,385 INFO L87 Difference]: Start difference. First operand 355 states and 354 transitions. Second operand has 7 states, 6 states have (on average 26.5) internal successors, (159), 7 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-25 17:24:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:16,972 INFO L93 Difference]: Finished difference Result 354 states and 353 transitions. [2022-11-25 17:24:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:16,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 26.5) internal successors, (159), 7 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) Word has length 159 [2022-11-25 17:24:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:16,974 INFO L225 Difference]: With dead ends: 354 [2022-11-25 17:24:16,974 INFO L226 Difference]: Without dead ends: 354 [2022-11-25 17:24:16,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:24:16,975 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 792 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:16,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 453 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-11-25 17:24:16,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2022-11-25 17:24:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 299 states have (on average 1.1806020066889633) internal successors, (353), 353 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 353 transitions. [2022-11-25 17:24:16,982 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 353 transitions. Word has length 159 [2022-11-25 17:24:16,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:16,982 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 353 transitions. [2022-11-25 17:24:16,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 26.5) internal successors, (159), 7 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-25 17:24:16,983 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 353 transitions. [2022-11-25 17:24:16,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-25 17:24:16,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:16,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:16,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-25 17:24:16,984 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:16,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:16,985 INFO L85 PathProgramCache]: Analyzing trace with hash 117597077, now seen corresponding path program 1 times [2022-11-25 17:24:16,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:16,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867946981] [2022-11-25 17:24:16,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:16,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:17,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:17,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867946981] [2022-11-25 17:24:17,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867946981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:17,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:17,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:17,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609099513] [2022-11-25 17:24:17,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:17,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:17,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:17,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:17,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:17,263 INFO L87 Difference]: Start difference. First operand 354 states and 353 transitions. Second operand has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:17,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:17,505 INFO L93 Difference]: Finished difference Result 353 states and 352 transitions. [2022-11-25 17:24:17,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:17,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2022-11-25 17:24:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:17,507 INFO L225 Difference]: With dead ends: 353 [2022-11-25 17:24:17,507 INFO L226 Difference]: Without dead ends: 353 [2022-11-25 17:24:17,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:17,508 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 379 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:17,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 369 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:17,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-11-25 17:24:17,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2022-11-25 17:24:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 299 states have (on average 1.1772575250836121) internal successors, (352), 352 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 352 transitions. [2022-11-25 17:24:17,514 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 352 transitions. Word has length 164 [2022-11-25 17:24:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:17,514 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 352 transitions. [2022-11-25 17:24:17,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.666666666666664) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:17,515 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 352 transitions. [2022-11-25 17:24:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-25 17:24:17,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:17,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:17,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-25 17:24:17,516 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:17,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:17,517 INFO L85 PathProgramCache]: Analyzing trace with hash 117597078, now seen corresponding path program 1 times [2022-11-25 17:24:17,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:17,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225676551] [2022-11-25 17:24:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:17,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:18,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:18,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225676551] [2022-11-25 17:24:18,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225676551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:18,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:18,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:18,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572978485] [2022-11-25 17:24:18,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:18,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:18,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:18,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:18,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:18,207 INFO L87 Difference]: Start difference. First operand 353 states and 352 transitions. Second operand has 6 states, 5 states have (on average 32.8) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:18,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:18,777 INFO L93 Difference]: Finished difference Result 352 states and 351 transitions. [2022-11-25 17:24:18,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:18,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.8) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2022-11-25 17:24:18,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:18,779 INFO L225 Difference]: With dead ends: 352 [2022-11-25 17:24:18,779 INFO L226 Difference]: Without dead ends: 352 [2022-11-25 17:24:18,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:18,780 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 774 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:18,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 455 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:18,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-11-25 17:24:18,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2022-11-25 17:24:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 299 states have (on average 1.173913043478261) internal successors, (351), 351 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 351 transitions. [2022-11-25 17:24:18,786 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 351 transitions. Word has length 164 [2022-11-25 17:24:18,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:18,786 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 351 transitions. [2022-11-25 17:24:18,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.8) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:18,787 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 351 transitions. [2022-11-25 17:24:18,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-25 17:24:18,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:18,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:18,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-25 17:24:18,788 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:18,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:18,789 INFO L85 PathProgramCache]: Analyzing trace with hash 264564972, now seen corresponding path program 1 times [2022-11-25 17:24:18,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:18,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078685764] [2022-11-25 17:24:18,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:18,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:19,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:19,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:19,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078685764] [2022-11-25 17:24:19,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078685764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:19,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:19,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:19,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980057921] [2022-11-25 17:24:19,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:19,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:19,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:19,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:19,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:19,095 INFO L87 Difference]: Start difference. First operand 352 states and 351 transitions. Second operand has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:19,340 INFO L93 Difference]: Finished difference Result 351 states and 350 transitions. [2022-11-25 17:24:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:19,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2022-11-25 17:24:19,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:19,342 INFO L225 Difference]: With dead ends: 351 [2022-11-25 17:24:19,343 INFO L226 Difference]: Without dead ends: 351 [2022-11-25 17:24:19,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:19,343 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 365 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:19,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 371 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-25 17:24:19,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2022-11-25 17:24:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 299 states have (on average 1.1705685618729098) internal successors, (350), 350 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:19,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 350 transitions. [2022-11-25 17:24:19,351 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 350 transitions. Word has length 169 [2022-11-25 17:24:19,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:19,351 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 350 transitions. [2022-11-25 17:24:19,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 56.333333333333336) internal successors, (169), 4 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 350 transitions. [2022-11-25 17:24:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-25 17:24:19,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:19,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:19,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-25 17:24:19,354 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:19,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:19,354 INFO L85 PathProgramCache]: Analyzing trace with hash 264564973, now seen corresponding path program 1 times [2022-11-25 17:24:19,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:19,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078436551] [2022-11-25 17:24:19,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:19,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:20,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:20,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:20,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078436551] [2022-11-25 17:24:20,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078436551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:20,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:20,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030263318] [2022-11-25 17:24:20,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:20,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:20,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:20,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:20,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:20,076 INFO L87 Difference]: Start difference. First operand 351 states and 350 transitions. Second operand has 6 states, 5 states have (on average 33.8) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:20,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:20,670 INFO L93 Difference]: Finished difference Result 350 states and 349 transitions. [2022-11-25 17:24:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:20,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 33.8) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2022-11-25 17:24:20,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:20,672 INFO L225 Difference]: With dead ends: 350 [2022-11-25 17:24:20,672 INFO L226 Difference]: Without dead ends: 350 [2022-11-25 17:24:20,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:20,673 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 573 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:20,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 498 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:20,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-11-25 17:24:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2022-11-25 17:24:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 299 states have (on average 1.1672240802675586) internal successors, (349), 349 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 349 transitions. [2022-11-25 17:24:20,679 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 349 transitions. Word has length 169 [2022-11-25 17:24:20,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:20,680 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 349 transitions. [2022-11-25 17:24:20,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.8) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 349 transitions. [2022-11-25 17:24:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-11-25 17:24:20,681 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:20,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:20,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-25 17:24:20,682 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:20,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:20,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1627368902, now seen corresponding path program 1 times [2022-11-25 17:24:20,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:20,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431690672] [2022-11-25 17:24:20,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:20,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:21,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431690672] [2022-11-25 17:24:21,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431690672] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:21,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:21,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:21,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824180963] [2022-11-25 17:24:21,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:21,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:21,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:21,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:21,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:21,017 INFO L87 Difference]: Start difference. First operand 350 states and 349 transitions. Second operand has 4 states, 3 states have (on average 58.0) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:21,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:21,264 INFO L93 Difference]: Finished difference Result 349 states and 348 transitions. [2022-11-25 17:24:21,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:21,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 58.0) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2022-11-25 17:24:21,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:21,266 INFO L225 Difference]: With dead ends: 349 [2022-11-25 17:24:21,266 INFO L226 Difference]: Without dead ends: 349 [2022-11-25 17:24:21,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:21,267 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 351 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:21,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 373 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:21,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2022-11-25 17:24:21,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2022-11-25 17:24:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 299 states have (on average 1.1638795986622072) internal successors, (348), 348 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:21,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 348 transitions. [2022-11-25 17:24:21,272 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 348 transitions. Word has length 174 [2022-11-25 17:24:21,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:21,272 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 348 transitions. [2022-11-25 17:24:21,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 58.0) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 348 transitions. [2022-11-25 17:24:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-11-25 17:24:21,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:21,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:21,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-25 17:24:21,274 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:21,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:21,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1627368903, now seen corresponding path program 1 times [2022-11-25 17:24:21,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:21,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056881091] [2022-11-25 17:24:21,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:21,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:21,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:21,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056881091] [2022-11-25 17:24:21,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056881091] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:21,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:21,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:21,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231719943] [2022-11-25 17:24:21,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:21,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:21,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:21,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:21,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:21,947 INFO L87 Difference]: Start difference. First operand 349 states and 348 transitions. Second operand has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:22,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:22,509 INFO L93 Difference]: Finished difference Result 348 states and 347 transitions. [2022-11-25 17:24:22,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:22,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 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 174 [2022-11-25 17:24:22,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:22,511 INFO L225 Difference]: With dead ends: 348 [2022-11-25 17:24:22,511 INFO L226 Difference]: Without dead ends: 348 [2022-11-25 17:24:22,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:22,511 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 738 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:22,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 459 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:22,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-11-25 17:24:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2022-11-25 17:24:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 299 states have (on average 1.160535117056856) internal successors, (347), 347 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 347 transitions. [2022-11-25 17:24:22,517 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 347 transitions. Word has length 174 [2022-11-25 17:24:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:22,518 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 347 transitions. [2022-11-25 17:24:22,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 34.8) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 347 transitions. [2022-11-25 17:24:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-25 17:24:22,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:22,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:22,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-25 17:24:22,520 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:22,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:22,520 INFO L85 PathProgramCache]: Analyzing trace with hash 135427325, now seen corresponding path program 1 times [2022-11-25 17:24:22,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:22,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447845654] [2022-11-25 17:24:22,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:22,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:22,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:22,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447845654] [2022-11-25 17:24:22,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447845654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:22,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:22,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:22,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098890698] [2022-11-25 17:24:22,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:22,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:22,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:22,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:22,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:22,780 INFO L87 Difference]: Start difference. First operand 348 states and 347 transitions. Second operand has 4 states, 3 states have (on average 59.666666666666664) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:23,002 INFO L93 Difference]: Finished difference Result 347 states and 346 transitions. [2022-11-25 17:24:23,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:23,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 59.666666666666664) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2022-11-25 17:24:23,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:23,004 INFO L225 Difference]: With dead ends: 347 [2022-11-25 17:24:23,004 INFO L226 Difference]: Without dead ends: 347 [2022-11-25 17:24:23,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:23,005 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 337 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:23,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 375 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:23,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-11-25 17:24:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2022-11-25 17:24:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 299 states have (on average 1.157190635451505) internal successors, (346), 346 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:23,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 346 transitions. [2022-11-25 17:24:23,011 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 346 transitions. Word has length 179 [2022-11-25 17:24:23,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:23,012 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 346 transitions. [2022-11-25 17:24:23,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 59.666666666666664) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:23,012 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 346 transitions. [2022-11-25 17:24:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-11-25 17:24:23,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:23,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:23,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-25 17:24:23,014 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:23,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:23,014 INFO L85 PathProgramCache]: Analyzing trace with hash 135427326, now seen corresponding path program 1 times [2022-11-25 17:24:23,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:23,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638930080] [2022-11-25 17:24:23,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:23,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:23,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:23,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638930080] [2022-11-25 17:24:23,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638930080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:23,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:23,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:23,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401348576] [2022-11-25 17:24:23,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:23,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:23,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:23,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:23,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:23,681 INFO L87 Difference]: Start difference. First operand 347 states and 346 transitions. Second operand has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:24,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:24,261 INFO L93 Difference]: Finished difference Result 346 states and 345 transitions. [2022-11-25 17:24:24,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:24,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 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 179 [2022-11-25 17:24:24,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:24,267 INFO L225 Difference]: With dead ends: 346 [2022-11-25 17:24:24,267 INFO L226 Difference]: Without dead ends: 346 [2022-11-25 17:24:24,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:24,268 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 551 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:24,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 502 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:24,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-11-25 17:24:24,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-11-25 17:24:24,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 299 states have (on average 1.1538461538461537) internal successors, (345), 345 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 345 transitions. [2022-11-25 17:24:24,274 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 345 transitions. Word has length 179 [2022-11-25 17:24:24,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:24,274 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 345 transitions. [2022-11-25 17:24:24,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 35.8) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:24,275 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 345 transitions. [2022-11-25 17:24:24,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-25 17:24:24,276 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:24,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:24,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-25 17:24:24,277 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:24,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:24,278 INFO L85 PathProgramCache]: Analyzing trace with hash -277470217, now seen corresponding path program 1 times [2022-11-25 17:24:24,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:24,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952612066] [2022-11-25 17:24:24,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:24,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:24,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:24,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952612066] [2022-11-25 17:24:24,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952612066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:24,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:24,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:24,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607343786] [2022-11-25 17:24:24,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:24,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:24,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:24,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:24,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:24,550 INFO L87 Difference]: Start difference. First operand 346 states and 345 transitions. Second operand has 4 states, 3 states have (on average 61.333333333333336) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:24,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:24,775 INFO L93 Difference]: Finished difference Result 345 states and 344 transitions. [2022-11-25 17:24:24,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:24,783 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 61.333333333333336) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2022-11-25 17:24:24,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:24,784 INFO L225 Difference]: With dead ends: 345 [2022-11-25 17:24:24,785 INFO L226 Difference]: Without dead ends: 345 [2022-11-25 17:24:24,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:24,785 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 323 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:24,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 377 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:24,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-11-25 17:24:24,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2022-11-25 17:24:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 299 states have (on average 1.1505016722408026) internal successors, (344), 344 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:24,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 344 transitions. [2022-11-25 17:24:24,792 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 344 transitions. Word has length 184 [2022-11-25 17:24:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:24,792 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 344 transitions. [2022-11-25 17:24:24,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 61.333333333333336) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 344 transitions. [2022-11-25 17:24:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2022-11-25 17:24:24,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:24,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:24,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-25 17:24:24,794 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr121REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:24,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:24,795 INFO L85 PathProgramCache]: Analyzing trace with hash -277470216, now seen corresponding path program 1 times [2022-11-25 17:24:24,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:24,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57261417] [2022-11-25 17:24:24,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:24,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:25,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:25,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57261417] [2022-11-25 17:24:25,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57261417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:25,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:25,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:25,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303878940] [2022-11-25 17:24:25,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:25,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:25,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:25,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:25,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:25,434 INFO L87 Difference]: Start difference. First operand 345 states and 344 transitions. Second operand has 6 states, 5 states have (on average 36.8) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:26,036 INFO L93 Difference]: Finished difference Result 344 states and 343 transitions. [2022-11-25 17:24:26,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:26,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 36.8) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2022-11-25 17:24:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:26,038 INFO L225 Difference]: With dead ends: 344 [2022-11-25 17:24:26,038 INFO L226 Difference]: Without dead ends: 344 [2022-11-25 17:24:26,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:26,039 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 540 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:26,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 504 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:26,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-11-25 17:24:26,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2022-11-25 17:24:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 299 states have (on average 1.1471571906354514) internal successors, (343), 343 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 343 transitions. [2022-11-25 17:24:26,045 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 343 transitions. Word has length 184 [2022-11-25 17:24:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:26,045 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 343 transitions. [2022-11-25 17:24:26,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.8) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 343 transitions. [2022-11-25 17:24:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-25 17:24:26,047 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:26,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:26,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-25 17:24:26,047 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr122REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:26,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash -993899250, now seen corresponding path program 1 times [2022-11-25 17:24:26,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:26,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3083967] [2022-11-25 17:24:26,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:26,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:26,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:26,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3083967] [2022-11-25 17:24:26,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3083967] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:26,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:26,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:26,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037962227] [2022-11-25 17:24:26,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:26,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:26,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:26,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:26,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:26,340 INFO L87 Difference]: Start difference. First operand 344 states and 343 transitions. Second operand has 4 states, 3 states have (on average 63.0) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:26,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:26,565 INFO L93 Difference]: Finished difference Result 343 states and 342 transitions. [2022-11-25 17:24:26,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:26,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 63.0) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2022-11-25 17:24:26,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:26,566 INFO L225 Difference]: With dead ends: 343 [2022-11-25 17:24:26,567 INFO L226 Difference]: Without dead ends: 343 [2022-11-25 17:24:26,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:26,567 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 309 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:26,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 379 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:26,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2022-11-25 17:24:26,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2022-11-25 17:24:26,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 299 states have (on average 1.1438127090301002) internal successors, (342), 342 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 342 transitions. [2022-11-25 17:24:26,573 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 342 transitions. Word has length 189 [2022-11-25 17:24:26,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:26,573 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 342 transitions. [2022-11-25 17:24:26,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 63.0) internal successors, (189), 4 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 342 transitions. [2022-11-25 17:24:26,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-25 17:24:26,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:26,575 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:26,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-25 17:24:26,575 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:26,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:26,576 INFO L85 PathProgramCache]: Analyzing trace with hash -993899249, now seen corresponding path program 1 times [2022-11-25 17:24:26,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:26,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36641488] [2022-11-25 17:24:26,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:26,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:27,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:27,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36641488] [2022-11-25 17:24:27,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36641488] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:27,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:27,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:24:27,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240800682] [2022-11-25 17:24:27,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:27,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:24:27,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:27,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:24:27,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:24:27,313 INFO L87 Difference]: Start difference. First operand 343 states and 342 transitions. Second operand has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:27,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:27,926 INFO L93 Difference]: Finished difference Result 342 states and 341 transitions. [2022-11-25 17:24:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:27,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 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 189 [2022-11-25 17:24:27,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:27,927 INFO L225 Difference]: With dead ends: 342 [2022-11-25 17:24:27,927 INFO L226 Difference]: Without dead ends: 342 [2022-11-25 17:24:27,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:24:27,928 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 529 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:27,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 547 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-11-25 17:24:27,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2022-11-25 17:24:27,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 299 states have (on average 1.140468227424749) internal successors, (341), 341 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 341 transitions. [2022-11-25 17:24:27,933 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 341 transitions. Word has length 189 [2022-11-25 17:24:27,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:27,933 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 341 transitions. [2022-11-25 17:24:27,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 31.5) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:27,934 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 341 transitions. [2022-11-25 17:24:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-25 17:24:27,935 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:27,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:27,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-25 17:24:27,936 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr124REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:27,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:27,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2111751720, now seen corresponding path program 1 times [2022-11-25 17:24:27,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:27,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679129259] [2022-11-25 17:24:27,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:27,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:28,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:28,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:28,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679129259] [2022-11-25 17:24:28,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679129259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:28,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:28,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:28,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889333896] [2022-11-25 17:24:28,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:28,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:28,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:28,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:28,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:28,207 INFO L87 Difference]: Start difference. First operand 342 states and 341 transitions. Second operand has 4 states, 3 states have (on average 64.66666666666667) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:28,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:28,424 INFO L93 Difference]: Finished difference Result 341 states and 340 transitions. [2022-11-25 17:24:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:28,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 64.66666666666667) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 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 194 [2022-11-25 17:24:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:28,426 INFO L225 Difference]: With dead ends: 341 [2022-11-25 17:24:28,426 INFO L226 Difference]: Without dead ends: 341 [2022-11-25 17:24:28,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:28,427 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 295 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:28,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 381 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:28,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-11-25 17:24:28,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-11-25 17:24:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 299 states have (on average 1.137123745819398) internal successors, (340), 340 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 340 transitions. [2022-11-25 17:24:28,433 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 340 transitions. Word has length 194 [2022-11-25 17:24:28,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:28,433 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 340 transitions. [2022-11-25 17:24:28,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 64.66666666666667) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 340 transitions. [2022-11-25 17:24:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-11-25 17:24:28,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:28,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:28,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-25 17:24:28,435 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr125REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:28,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:28,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2111751721, now seen corresponding path program 1 times [2022-11-25 17:24:28,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:28,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939206591] [2022-11-25 17:24:28,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:28,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:29,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:29,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939206591] [2022-11-25 17:24:29,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939206591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:29,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:29,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:24:29,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155676911] [2022-11-25 17:24:29,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:29,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:24:29,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:29,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:24:29,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:24:29,069 INFO L87 Difference]: Start difference. First operand 341 states and 340 transitions. Second operand has 7 states, 6 states have (on average 32.333333333333336) internal successors, (194), 7 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:29,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:29,662 INFO L93 Difference]: Finished difference Result 340 states and 339 transitions. [2022-11-25 17:24:29,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:29,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 32.333333333333336) internal successors, (194), 7 states have internal predecessors, (194), 0 states have call successors, (0), 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 194 [2022-11-25 17:24:29,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:29,664 INFO L225 Difference]: With dead ends: 340 [2022-11-25 17:24:29,664 INFO L226 Difference]: Without dead ends: 340 [2022-11-25 17:24:29,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:24:29,665 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 764 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:29,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 508 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:29,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-11-25 17:24:29,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2022-11-25 17:24:29,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 299 states have (on average 1.1337792642140467) internal successors, (339), 339 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:29,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 339 transitions. [2022-11-25 17:24:29,671 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 339 transitions. Word has length 194 [2022-11-25 17:24:29,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:29,671 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 339 transitions. [2022-11-25 17:24:29,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 32.333333333333336) internal successors, (194), 7 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:29,671 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 339 transitions. [2022-11-25 17:24:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-11-25 17:24:29,672 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:29,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:29,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-25 17:24:29,673 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr126REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:29,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:29,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1107592929, now seen corresponding path program 1 times [2022-11-25 17:24:29,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:29,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608296567] [2022-11-25 17:24:29,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:29,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:29,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:29,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608296567] [2022-11-25 17:24:29,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608296567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:29,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:29,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:29,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962892543] [2022-11-25 17:24:29,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:29,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:29,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:29,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:29,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:29,896 INFO L87 Difference]: Start difference. First operand 340 states and 339 transitions. Second operand has 4 states, 3 states have (on average 66.33333333333333) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:30,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:30,123 INFO L93 Difference]: Finished difference Result 339 states and 338 transitions. [2022-11-25 17:24:30,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:30,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 66.33333333333333) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2022-11-25 17:24:30,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:30,126 INFO L225 Difference]: With dead ends: 339 [2022-11-25 17:24:30,126 INFO L226 Difference]: Without dead ends: 339 [2022-11-25 17:24:30,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:30,126 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 281 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:30,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 383 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-11-25 17:24:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2022-11-25 17:24:30,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 299 states have (on average 1.1304347826086956) internal successors, (338), 338 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:30,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 338 transitions. [2022-11-25 17:24:30,132 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 338 transitions. Word has length 199 [2022-11-25 17:24:30,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:30,132 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 338 transitions. [2022-11-25 17:24:30,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 66.33333333333333) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:30,133 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 338 transitions. [2022-11-25 17:24:30,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-11-25 17:24:30,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:30,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:30,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-25 17:24:30,135 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr127REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:30,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:30,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1107592928, now seen corresponding path program 1 times [2022-11-25 17:24:30,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:30,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868396178] [2022-11-25 17:24:30,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:30,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:30,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:30,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868396178] [2022-11-25 17:24:30,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868396178] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:30,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:30,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:24:30,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799139474] [2022-11-25 17:24:30,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:30,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:24:30,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:30,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:24:30,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:24:30,838 INFO L87 Difference]: Start difference. First operand 339 states and 338 transitions. Second operand has 7 states, 6 states have (on average 33.166666666666664) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:31,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:31,436 INFO L93 Difference]: Finished difference Result 338 states and 337 transitions. [2022-11-25 17:24:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:31,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 33.166666666666664) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2022-11-25 17:24:31,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:31,438 INFO L225 Difference]: With dead ends: 338 [2022-11-25 17:24:31,438 INFO L226 Difference]: Without dead ends: 338 [2022-11-25 17:24:31,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:24:31,442 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 751 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:31,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 510 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:31,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-11-25 17:24:31,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2022-11-25 17:24:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 299 states have (on average 1.1270903010033444) internal successors, (337), 337 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 337 transitions. [2022-11-25 17:24:31,452 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 337 transitions. Word has length 199 [2022-11-25 17:24:31,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:31,453 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 337 transitions. [2022-11-25 17:24:31,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 33.166666666666664) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:31,453 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 337 transitions. [2022-11-25 17:24:31,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-11-25 17:24:31,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:31,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:31,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-25 17:24:31,455 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr129REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:31,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:31,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1804430246, now seen corresponding path program 1 times [2022-11-25 17:24:31,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:31,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91824441] [2022-11-25 17:24:31,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:31,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:32,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:32,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91824441] [2022-11-25 17:24:32,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91824441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:32,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:32,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:24:32,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931266356] [2022-11-25 17:24:32,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:32,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:24:32,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:32,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:24:32,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:24:32,087 INFO L87 Difference]: Start difference. First operand 338 states and 337 transitions. Second operand has 7 states, 6 states have (on average 34.0) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:32,649 INFO L93 Difference]: Finished difference Result 337 states and 336 transitions. [2022-11-25 17:24:32,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:32,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 34.0) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2022-11-25 17:24:32,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:32,651 INFO L225 Difference]: With dead ends: 337 [2022-11-25 17:24:32,651 INFO L226 Difference]: Without dead ends: 337 [2022-11-25 17:24:32,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:24:32,651 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 742 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:32,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 512 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:32,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-11-25 17:24:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2022-11-25 17:24:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 299 states have (on average 1.1237458193979932) internal successors, (336), 336 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 336 transitions. [2022-11-25 17:24:32,654 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 336 transitions. Word has length 204 [2022-11-25 17:24:32,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:32,655 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 336 transitions. [2022-11-25 17:24:32,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 34.0) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:32,655 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 336 transitions. [2022-11-25 17:24:32,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-11-25 17:24:32,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:32,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:32,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-11-25 17:24:32,656 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr128REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:32,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:32,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1804430247, now seen corresponding path program 1 times [2022-11-25 17:24:32,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:32,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301570272] [2022-11-25 17:24:32,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:32,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:32,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:32,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301570272] [2022-11-25 17:24:32,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301570272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:32,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:32,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:32,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896125023] [2022-11-25 17:24:32,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:32,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:32,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:32,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:32,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:32,882 INFO L87 Difference]: Start difference. First operand 337 states and 336 transitions. Second operand has 4 states, 3 states have (on average 68.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:33,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:33,107 INFO L93 Difference]: Finished difference Result 336 states and 335 transitions. [2022-11-25 17:24:33,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:33,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 68.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 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 204 [2022-11-25 17:24:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:33,110 INFO L225 Difference]: With dead ends: 336 [2022-11-25 17:24:33,110 INFO L226 Difference]: Without dead ends: 336 [2022-11-25 17:24:33,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:33,110 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 265 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:33,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 385 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-11-25 17:24:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2022-11-25 17:24:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 299 states have (on average 1.120401337792642) internal successors, (335), 335 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 335 transitions. [2022-11-25 17:24:33,116 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 335 transitions. Word has length 204 [2022-11-25 17:24:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:33,116 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 335 transitions. [2022-11-25 17:24:33,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 68.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 335 transitions. [2022-11-25 17:24:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-25 17:24:33,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:33,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:33,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-11-25 17:24:33,118 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr130REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:33,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:33,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1490749136, now seen corresponding path program 1 times [2022-11-25 17:24:33,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:33,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152667849] [2022-11-25 17:24:33,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:33,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:33,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:33,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152667849] [2022-11-25 17:24:33,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152667849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:33,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:33,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:33,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181167252] [2022-11-25 17:24:33,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:33,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:33,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:33,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:33,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:33,379 INFO L87 Difference]: Start difference. First operand 336 states and 335 transitions. Second operand has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:33,599 INFO L93 Difference]: Finished difference Result 335 states and 334 transitions. [2022-11-25 17:24:33,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:33,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2022-11-25 17:24:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:33,601 INFO L225 Difference]: With dead ends: 335 [2022-11-25 17:24:33,601 INFO L226 Difference]: Without dead ends: 335 [2022-11-25 17:24:33,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:33,602 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 253 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:33,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 387 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:33,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2022-11-25 17:24:33,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2022-11-25 17:24:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 299 states have (on average 1.117056856187291) internal successors, (334), 334 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 334 transitions. [2022-11-25 17:24:33,605 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 334 transitions. Word has length 209 [2022-11-25 17:24:33,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:33,605 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 334 transitions. [2022-11-25 17:24:33,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 4 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:33,606 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 334 transitions. [2022-11-25 17:24:33,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-25 17:24:33,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:33,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:33,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-11-25 17:24:33,607 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr131REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:33,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:33,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1490749135, now seen corresponding path program 1 times [2022-11-25 17:24:33,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:33,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117211310] [2022-11-25 17:24:33,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:33,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:34,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117211310] [2022-11-25 17:24:34,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117211310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:34,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:34,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:34,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826692834] [2022-11-25 17:24:34,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:34,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:34,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:34,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:34,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:34,360 INFO L87 Difference]: Start difference. First operand 335 states and 334 transitions. Second operand has 6 states, 5 states have (on average 41.8) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:34,893 INFO L93 Difference]: Finished difference Result 334 states and 333 transitions. [2022-11-25 17:24:34,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:34,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 41.8) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2022-11-25 17:24:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:34,895 INFO L225 Difference]: With dead ends: 334 [2022-11-25 17:24:34,895 INFO L226 Difference]: Without dead ends: 334 [2022-11-25 17:24:34,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:34,896 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 612 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:34,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 473 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:24:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-11-25 17:24:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2022-11-25 17:24:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 299 states have (on average 1.1137123745819397) internal successors, (333), 333 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 333 transitions. [2022-11-25 17:24:34,899 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 333 transitions. Word has length 209 [2022-11-25 17:24:34,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:34,899 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 333 transitions. [2022-11-25 17:24:34,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 41.8) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 333 transitions. [2022-11-25 17:24:34,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-11-25 17:24:34,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:34,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:34,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-11-25 17:24:34,901 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr132REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:34,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:34,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2010476918, now seen corresponding path program 1 times [2022-11-25 17:24:34,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:34,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327028615] [2022-11-25 17:24:34,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:34,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:35,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:35,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327028615] [2022-11-25 17:24:35,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327028615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:35,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:35,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:35,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557982513] [2022-11-25 17:24:35,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:35,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:35,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:35,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:35,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:35,214 INFO L87 Difference]: Start difference. First operand 334 states and 333 transitions. Second operand has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:35,474 INFO L93 Difference]: Finished difference Result 333 states and 332 transitions. [2022-11-25 17:24:35,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:35,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2022-11-25 17:24:35,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:35,475 INFO L225 Difference]: With dead ends: 333 [2022-11-25 17:24:35,475 INFO L226 Difference]: Without dead ends: 333 [2022-11-25 17:24:35,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:35,476 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 239 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:35,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 389 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:35,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-11-25 17:24:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2022-11-25 17:24:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 299 states have (on average 1.1103678929765886) internal successors, (332), 332 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 332 transitions. [2022-11-25 17:24:35,482 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 332 transitions. Word has length 214 [2022-11-25 17:24:35,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:35,482 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 332 transitions. [2022-11-25 17:24:35,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 332 transitions. [2022-11-25 17:24:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-11-25 17:24:35,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:35,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:35,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-25 17:24:35,487 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr133REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:35,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:35,487 INFO L85 PathProgramCache]: Analyzing trace with hash -2010476917, now seen corresponding path program 1 times [2022-11-25 17:24:35,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:35,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624271938] [2022-11-25 17:24:35,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:35,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:36,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:36,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624271938] [2022-11-25 17:24:36,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624271938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:36,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:36,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:36,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251651369] [2022-11-25 17:24:36,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:36,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:36,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:36,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:36,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:36,147 INFO L87 Difference]: Start difference. First operand 333 states and 332 transitions. Second operand has 6 states, 5 states have (on average 42.8) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:36,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:36,673 INFO L93 Difference]: Finished difference Result 332 states and 331 transitions. [2022-11-25 17:24:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:36,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 42.8) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2022-11-25 17:24:36,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:36,675 INFO L225 Difference]: With dead ends: 332 [2022-11-25 17:24:36,675 INFO L226 Difference]: Without dead ends: 332 [2022-11-25 17:24:36,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:36,675 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 594 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:36,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 475 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:24:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-11-25 17:24:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2022-11-25 17:24:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 299 states have (on average 1.1070234113712374) internal successors, (331), 331 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 331 transitions. [2022-11-25 17:24:36,678 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 331 transitions. Word has length 214 [2022-11-25 17:24:36,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:36,678 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 331 transitions. [2022-11-25 17:24:36,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 42.8) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 331 transitions. [2022-11-25 17:24:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-11-25 17:24:36,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:36,679 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:36,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-25 17:24:36,680 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr134REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:36,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:36,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1592118593, now seen corresponding path program 1 times [2022-11-25 17:24:36,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:36,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190911733] [2022-11-25 17:24:36,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:36,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:36,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:36,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190911733] [2022-11-25 17:24:36,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190911733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:36,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:36,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:36,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048793401] [2022-11-25 17:24:36,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:36,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:36,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:36,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:36,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:36,966 INFO L87 Difference]: Start difference. First operand 332 states and 331 transitions. Second operand has 4 states, 3 states have (on average 73.0) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:37,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:37,211 INFO L93 Difference]: Finished difference Result 331 states and 330 transitions. [2022-11-25 17:24:37,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:37,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 73.0) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 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 219 [2022-11-25 17:24:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:37,213 INFO L225 Difference]: With dead ends: 331 [2022-11-25 17:24:37,213 INFO L226 Difference]: Without dead ends: 331 [2022-11-25 17:24:37,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:37,214 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 225 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:37,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 391 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:37,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-11-25 17:24:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2022-11-25 17:24:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 299 states have (on average 1.1036789297658862) internal successors, (330), 330 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 330 transitions. [2022-11-25 17:24:37,218 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 330 transitions. Word has length 219 [2022-11-25 17:24:37,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:37,219 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 330 transitions. [2022-11-25 17:24:37,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 73.0) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:37,219 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 330 transitions. [2022-11-25 17:24:37,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-11-25 17:24:37,220 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:37,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:37,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-25 17:24:37,221 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:37,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:37,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1592118594, now seen corresponding path program 1 times [2022-11-25 17:24:37,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:37,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692914490] [2022-11-25 17:24:37,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:37,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:38,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:38,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692914490] [2022-11-25 17:24:38,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692914490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:38,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:38,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:24:38,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009343725] [2022-11-25 17:24:38,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:38,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:24:38,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:38,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:24:38,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:24:38,016 INFO L87 Difference]: Start difference. First operand 331 states and 330 transitions. Second operand has 7 states, 6 states have (on average 36.5) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:38,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:38,572 INFO L93 Difference]: Finished difference Result 330 states and 329 transitions. [2022-11-25 17:24:38,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:38,572 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 36.5) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 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 219 [2022-11-25 17:24:38,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:38,574 INFO L225 Difference]: With dead ends: 330 [2022-11-25 17:24:38,574 INFO L226 Difference]: Without dead ends: 330 [2022-11-25 17:24:38,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:24:38,575 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 812 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:38,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 477 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:38,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-11-25 17:24:38,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2022-11-25 17:24:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 299 states have (on average 1.100334448160535) internal successors, (329), 329 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 329 transitions. [2022-11-25 17:24:38,578 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 329 transitions. Word has length 219 [2022-11-25 17:24:38,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:38,578 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 329 transitions. [2022-11-25 17:24:38,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 36.5) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:38,579 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 329 transitions. [2022-11-25 17:24:38,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-11-25 17:24:38,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:38,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:38,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-25 17:24:38,580 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:38,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:38,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1967147845, now seen corresponding path program 1 times [2022-11-25 17:24:38,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:38,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896997354] [2022-11-25 17:24:38,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:38,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:38,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-25 17:24:38,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:38,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896997354] [2022-11-25 17:24:38,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896997354] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:38,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:38,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:38,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906870736] [2022-11-25 17:24:38,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:38,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:38,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:38,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:38,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:38,829 INFO L87 Difference]: Start difference. First operand 330 states and 329 transitions. Second operand has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:39,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:39,045 INFO L93 Difference]: Finished difference Result 329 states and 328 transitions. [2022-11-25 17:24:39,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:39,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2022-11-25 17:24:39,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:39,047 INFO L225 Difference]: With dead ends: 329 [2022-11-25 17:24:39,047 INFO L226 Difference]: Without dead ends: 329 [2022-11-25 17:24:39,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:39,048 INFO L413 NwaCegarLoop]: 229 mSDtfsCounter, 211 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:39,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 393 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-11-25 17:24:39,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2022-11-25 17:24:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 299 states have (on average 1.0969899665551839) internal successors, (328), 328 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 328 transitions. [2022-11-25 17:24:39,053 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 328 transitions. Word has length 224 [2022-11-25 17:24:39,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:39,054 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 328 transitions. [2022-11-25 17:24:39,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 328 transitions. [2022-11-25 17:24:39,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-11-25 17:24:39,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:39,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:39,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-25 17:24:39,056 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:39,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:39,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1967147844, now seen corresponding path program 1 times [2022-11-25 17:24:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:39,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015386240] [2022-11-25 17:24:39,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:39,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:39,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:39,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:39,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015386240] [2022-11-25 17:24:39,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015386240] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:39,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:39,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:39,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431738551] [2022-11-25 17:24:39,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:39,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:39,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:39,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:39,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:39,698 INFO L87 Difference]: Start difference. First operand 329 states and 328 transitions. Second operand has 6 states, 5 states have (on average 44.8) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:40,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:40,215 INFO L93 Difference]: Finished difference Result 328 states and 327 transitions. [2022-11-25 17:24:40,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:40,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 44.8) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2022-11-25 17:24:40,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:40,217 INFO L225 Difference]: With dead ends: 328 [2022-11-25 17:24:40,217 INFO L226 Difference]: Without dead ends: 328 [2022-11-25 17:24:40,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:40,218 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 558 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:40,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 479 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:24:40,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-11-25 17:24:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2022-11-25 17:24:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 299 states have (on average 1.0936454849498327) internal successors, (327), 327 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:40,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 327 transitions. [2022-11-25 17:24:40,223 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 327 transitions. Word has length 224 [2022-11-25 17:24:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:40,223 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 327 transitions. [2022-11-25 17:24:40,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 44.8) internal successors, (224), 6 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 327 transitions. [2022-11-25 17:24:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-11-25 17:24:40,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:40,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:40,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-25 17:24:40,225 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:40,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:40,225 INFO L85 PathProgramCache]: Analyzing trace with hash -551226030, now seen corresponding path program 1 times [2022-11-25 17:24:40,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:40,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85182856] [2022-11-25 17:24:40,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:40,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:40,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:40,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85182856] [2022-11-25 17:24:40,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85182856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:40,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:40,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:40,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412795554] [2022-11-25 17:24:40,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:40,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:40,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:40,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:40,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:40,546 INFO L87 Difference]: Start difference. First operand 328 states and 327 transitions. Second operand has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:40,758 INFO L93 Difference]: Finished difference Result 327 states and 326 transitions. [2022-11-25 17:24:40,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:40,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2022-11-25 17:24:40,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:40,761 INFO L225 Difference]: With dead ends: 327 [2022-11-25 17:24:40,761 INFO L226 Difference]: Without dead ends: 327 [2022-11-25 17:24:40,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:40,761 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 197 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:40,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 395 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-11-25 17:24:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2022-11-25 17:24:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 299 states have (on average 1.0903010033444815) internal successors, (326), 326 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 326 transitions. [2022-11-25 17:24:40,764 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 326 transitions. Word has length 229 [2022-11-25 17:24:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:40,765 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 326 transitions. [2022-11-25 17:24:40,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 76.33333333333333) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:40,765 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 326 transitions. [2022-11-25 17:24:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-11-25 17:24:40,766 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:40,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:40,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-25 17:24:40,767 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr139REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:40,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:40,767 INFO L85 PathProgramCache]: Analyzing trace with hash -551226029, now seen corresponding path program 1 times [2022-11-25 17:24:40,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:40,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082760251] [2022-11-25 17:24:40,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:40,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:41,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:41,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082760251] [2022-11-25 17:24:41,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082760251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:41,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:41,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:41,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851419044] [2022-11-25 17:24:41,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:41,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:41,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:41,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:41,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:41,443 INFO L87 Difference]: Start difference. First operand 327 states and 326 transitions. Second operand has 6 states, 5 states have (on average 45.8) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:41,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:41,987 INFO L93 Difference]: Finished difference Result 326 states and 325 transitions. [2022-11-25 17:24:41,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:41,988 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 45.8) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2022-11-25 17:24:41,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:41,989 INFO L225 Difference]: With dead ends: 326 [2022-11-25 17:24:41,989 INFO L226 Difference]: Without dead ends: 326 [2022-11-25 17:24:41,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:41,990 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 441 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:41,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 522 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-11-25 17:24:41,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2022-11-25 17:24:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 299 states have (on average 1.0869565217391304) internal successors, (325), 325 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 325 transitions. [2022-11-25 17:24:41,995 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 325 transitions. Word has length 229 [2022-11-25 17:24:41,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:41,995 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 325 transitions. [2022-11-25 17:24:41,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 45.8) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:41,996 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 325 transitions. [2022-11-25 17:24:41,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-11-25 17:24:41,997 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:41,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:41,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-11-25 17:24:41,998 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr140REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:41,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:41,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1163196692, now seen corresponding path program 1 times [2022-11-25 17:24:41,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:41,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872503721] [2022-11-25 17:24:41,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:41,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:42,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:42,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872503721] [2022-11-25 17:24:42,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872503721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:42,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:42,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:42,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128689974] [2022-11-25 17:24:42,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:42,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:42,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:42,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:42,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:42,251 INFO L87 Difference]: Start difference. First operand 326 states and 325 transitions. Second operand has 4 states, 3 states have (on average 78.0) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:42,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:42,470 INFO L93 Difference]: Finished difference Result 325 states and 324 transitions. [2022-11-25 17:24:42,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:42,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 78.0) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 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 234 [2022-11-25 17:24:42,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:42,472 INFO L225 Difference]: With dead ends: 325 [2022-11-25 17:24:42,472 INFO L226 Difference]: Without dead ends: 325 [2022-11-25 17:24:42,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:42,473 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 183 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:42,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 397 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:42,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-11-25 17:24:42,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2022-11-25 17:24:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 299 states have (on average 1.0836120401337792) internal successors, (324), 324 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 324 transitions. [2022-11-25 17:24:42,476 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 324 transitions. Word has length 234 [2022-11-25 17:24:42,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:42,477 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 324 transitions. [2022-11-25 17:24:42,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 78.0) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 324 transitions. [2022-11-25 17:24:42,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-11-25 17:24:42,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:42,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:42,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-25 17:24:42,478 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr141REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:42,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:42,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1163196691, now seen corresponding path program 1 times [2022-11-25 17:24:42,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:42,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431184816] [2022-11-25 17:24:42,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:42,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:43,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:43,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431184816] [2022-11-25 17:24:43,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431184816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:43,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:43,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:43,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143561024] [2022-11-25 17:24:43,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:43,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:43,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:43,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:43,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:43,081 INFO L87 Difference]: Start difference. First operand 325 states and 324 transitions. Second operand has 6 states, 5 states have (on average 46.8) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:43,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:43,630 INFO L93 Difference]: Finished difference Result 324 states and 323 transitions. [2022-11-25 17:24:43,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:43,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 46.8) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 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 234 [2022-11-25 17:24:43,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:43,632 INFO L225 Difference]: With dead ends: 324 [2022-11-25 17:24:43,632 INFO L226 Difference]: Without dead ends: 324 [2022-11-25 17:24:43,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:43,632 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 430 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:43,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 524 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:43,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-11-25 17:24:43,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2022-11-25 17:24:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 299 states have (on average 1.080267558528428) internal successors, (323), 323 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 323 transitions. [2022-11-25 17:24:43,638 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 323 transitions. Word has length 234 [2022-11-25 17:24:43,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:43,638 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 323 transitions. [2022-11-25 17:24:43,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 46.8) internal successors, (234), 6 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:43,639 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 323 transitions. [2022-11-25 17:24:43,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-11-25 17:24:43,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:43,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:43,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-11-25 17:24:43,641 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr142REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:43,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:43,641 INFO L85 PathProgramCache]: Analyzing trace with hash 755593571, now seen corresponding path program 1 times [2022-11-25 17:24:43,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:43,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880932872] [2022-11-25 17:24:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:43,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:44,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:44,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880932872] [2022-11-25 17:24:44,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880932872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:44,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:44,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:44,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713561233] [2022-11-25 17:24:44,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:44,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:44,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:44,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:44,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:44,020 INFO L87 Difference]: Start difference. First operand 324 states and 323 transitions. Second operand has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:44,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:44,247 INFO L93 Difference]: Finished difference Result 323 states and 322 transitions. [2022-11-25 17:24:44,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:44,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2022-11-25 17:24:44,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:44,250 INFO L225 Difference]: With dead ends: 323 [2022-11-25 17:24:44,250 INFO L226 Difference]: Without dead ends: 323 [2022-11-25 17:24:44,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:44,250 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 169 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:44,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 399 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-25 17:24:44,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-11-25 17:24:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 299 states have (on average 1.0769230769230769) internal successors, (322), 322 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:44,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 322 transitions. [2022-11-25 17:24:44,256 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 322 transitions. Word has length 239 [2022-11-25 17:24:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:44,256 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 322 transitions. [2022-11-25 17:24:44,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 4 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 322 transitions. [2022-11-25 17:24:44,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-11-25 17:24:44,258 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:44,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:44,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-11-25 17:24:44,259 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:44,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash 755593572, now seen corresponding path program 1 times [2022-11-25 17:24:44,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:44,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015305399] [2022-11-25 17:24:44,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:44,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:44,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:44,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015305399] [2022-11-25 17:24:44,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015305399] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:44,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:44,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:24:44,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986235307] [2022-11-25 17:24:44,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:44,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:24:44,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:44,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:24:44,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:24:44,914 INFO L87 Difference]: Start difference. First operand 323 states and 322 transitions. Second operand has 7 states, 6 states have (on average 39.833333333333336) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:45,466 INFO L93 Difference]: Finished difference Result 322 states and 321 transitions. [2022-11-25 17:24:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:45,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 39.833333333333336) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2022-11-25 17:24:45,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:45,468 INFO L225 Difference]: With dead ends: 322 [2022-11-25 17:24:45,468 INFO L226 Difference]: Without dead ends: 322 [2022-11-25 17:24:45,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:24:45,468 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 647 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:45,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 526 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:45,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-11-25 17:24:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2022-11-25 17:24:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 299 states have (on average 1.0735785953177257) internal successors, (321), 321 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 321 transitions. [2022-11-25 17:24:45,473 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 321 transitions. Word has length 239 [2022-11-25 17:24:45,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:45,474 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 321 transitions. [2022-11-25 17:24:45,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 39.833333333333336) internal successors, (239), 7 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 321 transitions. [2022-11-25 17:24:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-11-25 17:24:45,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:45,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:45,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-11-25 17:24:45,475 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr144REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:45,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:45,476 INFO L85 PathProgramCache]: Analyzing trace with hash 858096925, now seen corresponding path program 1 times [2022-11-25 17:24:45,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:45,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398396345] [2022-11-25 17:24:45,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:45,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:45,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:45,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398396345] [2022-11-25 17:24:45,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398396345] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:45,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:45,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:45,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161807160] [2022-11-25 17:24:45,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:45,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:45,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:45,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:45,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:45,870 INFO L87 Difference]: Start difference. First operand 322 states and 321 transitions. Second operand has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:46,090 INFO L93 Difference]: Finished difference Result 321 states and 320 transitions. [2022-11-25 17:24:46,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:46,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2022-11-25 17:24:46,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:46,093 INFO L225 Difference]: With dead ends: 321 [2022-11-25 17:24:46,093 INFO L226 Difference]: Without dead ends: 321 [2022-11-25 17:24:46,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:46,093 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 155 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:46,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 401 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:46,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-11-25 17:24:46,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2022-11-25 17:24:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 299 states have (on average 1.0702341137123745) internal successors, (320), 320 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 320 transitions. [2022-11-25 17:24:46,098 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 320 transitions. Word has length 244 [2022-11-25 17:24:46,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:46,098 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 320 transitions. [2022-11-25 17:24:46,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:46,098 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 320 transitions. [2022-11-25 17:24:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-11-25 17:24:46,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:46,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:46,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-11-25 17:24:46,100 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:46,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:46,101 INFO L85 PathProgramCache]: Analyzing trace with hash 858096926, now seen corresponding path program 1 times [2022-11-25 17:24:46,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:46,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941172948] [2022-11-25 17:24:46,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:46,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:46,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:46,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941172948] [2022-11-25 17:24:46,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941172948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:46,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:46,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:24:46,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795518214] [2022-11-25 17:24:46,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:46,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:24:46,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:46,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:24:46,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:24:46,775 INFO L87 Difference]: Start difference. First operand 321 states and 320 transitions. Second operand has 7 states, 6 states have (on average 40.666666666666664) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:47,343 INFO L93 Difference]: Finished difference Result 320 states and 319 transitions. [2022-11-25 17:24:47,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:47,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 40.666666666666664) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2022-11-25 17:24:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:47,345 INFO L225 Difference]: With dead ends: 320 [2022-11-25 17:24:47,346 INFO L226 Difference]: Without dead ends: 320 [2022-11-25 17:24:47,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:24:47,346 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 634 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:47,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 528 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:47,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-11-25 17:24:47,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2022-11-25 17:24:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 299 states have (on average 1.0668896321070234) internal successors, (319), 319 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 319 transitions. [2022-11-25 17:24:47,350 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 319 transitions. Word has length 244 [2022-11-25 17:24:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:47,351 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 319 transitions. [2022-11-25 17:24:47,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 40.666666666666664) internal successors, (244), 7 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 319 transitions. [2022-11-25 17:24:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-11-25 17:24:47,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:47,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:47,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-11-25 17:24:47,353 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:47,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:47,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1224360308, now seen corresponding path program 1 times [2022-11-25 17:24:47,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:47,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044243072] [2022-11-25 17:24:47,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:47,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:47,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:47,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:47,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044243072] [2022-11-25 17:24:47,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044243072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:47,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:47,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:47,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317716810] [2022-11-25 17:24:47,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:47,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:47,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:47,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:47,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:47,611 INFO L87 Difference]: Start difference. First operand 320 states and 319 transitions. Second operand has 4 states, 3 states have (on average 83.0) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:47,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:47,841 INFO L93 Difference]: Finished difference Result 319 states and 318 transitions. [2022-11-25 17:24:47,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:47,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 83.0) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2022-11-25 17:24:47,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:47,842 INFO L225 Difference]: With dead ends: 319 [2022-11-25 17:24:47,842 INFO L226 Difference]: Without dead ends: 319 [2022-11-25 17:24:47,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:47,843 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 141 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:47,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 403 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:47,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-11-25 17:24:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2022-11-25 17:24:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 299 states have (on average 1.0635451505016722) internal successors, (318), 318 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 318 transitions. [2022-11-25 17:24:47,845 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 318 transitions. Word has length 249 [2022-11-25 17:24:47,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:47,846 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 318 transitions. [2022-11-25 17:24:47,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 83.0) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:47,846 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 318 transitions. [2022-11-25 17:24:47,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-11-25 17:24:47,847 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:47,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:47,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-11-25 17:24:47,848 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:47,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:47,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1224360309, now seen corresponding path program 1 times [2022-11-25 17:24:47,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:47,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831061760] [2022-11-25 17:24:47,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:47,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:48,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:48,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:48,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831061760] [2022-11-25 17:24:48,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831061760] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:48,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:48,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:48,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411528318] [2022-11-25 17:24:48,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:48,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:48,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:48,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:48,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:48,566 INFO L87 Difference]: Start difference. First operand 319 states and 318 transitions. Second operand has 6 states, 5 states have (on average 49.8) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:49,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:49,124 INFO L93 Difference]: Finished difference Result 318 states and 317 transitions. [2022-11-25 17:24:49,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:49,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 49.8) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2022-11-25 17:24:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:49,126 INFO L225 Difference]: With dead ends: 318 [2022-11-25 17:24:49,126 INFO L226 Difference]: Without dead ends: 318 [2022-11-25 17:24:49,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:49,127 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 397 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:49,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 530 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:49,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2022-11-25 17:24:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2022-11-25 17:24:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 299 states have (on average 1.060200668896321) internal successors, (317), 317 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 317 transitions. [2022-11-25 17:24:49,132 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 317 transitions. Word has length 249 [2022-11-25 17:24:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:49,132 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 317 transitions. [2022-11-25 17:24:49,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 49.8) internal successors, (249), 6 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 317 transitions. [2022-11-25 17:24:49,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-11-25 17:24:49,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:49,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:49,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-11-25 17:24:49,135 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:49,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:49,135 INFO L85 PathProgramCache]: Analyzing trace with hash 472395598, now seen corresponding path program 1 times [2022-11-25 17:24:49,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:49,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600354939] [2022-11-25 17:24:49,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:49,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:49,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:49,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600354939] [2022-11-25 17:24:49,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600354939] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:49,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:49,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:49,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216639657] [2022-11-25 17:24:49,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:49,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:49,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:49,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:49,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:49,416 INFO L87 Difference]: Start difference. First operand 318 states and 317 transitions. Second operand has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:49,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:49,630 INFO L93 Difference]: Finished difference Result 317 states and 316 transitions. [2022-11-25 17:24:49,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:49,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2022-11-25 17:24:49,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:49,632 INFO L225 Difference]: With dead ends: 317 [2022-11-25 17:24:49,632 INFO L226 Difference]: Without dead ends: 317 [2022-11-25 17:24:49,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:49,633 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 127 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:49,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 405 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:49,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-25 17:24:49,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2022-11-25 17:24:49,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 299 states have (on average 1.0568561872909699) internal successors, (316), 316 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:49,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 316 transitions. [2022-11-25 17:24:49,638 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 316 transitions. Word has length 254 [2022-11-25 17:24:49,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:49,639 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 316 transitions. [2022-11-25 17:24:49,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 84.66666666666667) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:49,639 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 316 transitions. [2022-11-25 17:24:49,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-11-25 17:24:49,640 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:49,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:49,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-11-25 17:24:49,641 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:49,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:49,642 INFO L85 PathProgramCache]: Analyzing trace with hash 472395599, now seen corresponding path program 1 times [2022-11-25 17:24:49,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:49,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268418403] [2022-11-25 17:24:49,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:49,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:50,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:50,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268418403] [2022-11-25 17:24:50,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268418403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:50,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:50,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:50,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244292749] [2022-11-25 17:24:50,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:50,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:50,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:50,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:50,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:50,634 INFO L87 Difference]: Start difference. First operand 317 states and 316 transitions. Second operand has 6 states, 5 states have (on average 50.8) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:51,164 INFO L93 Difference]: Finished difference Result 316 states and 315 transitions. [2022-11-25 17:24:51,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:51,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 50.8) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2022-11-25 17:24:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:51,166 INFO L225 Difference]: With dead ends: 316 [2022-11-25 17:24:51,166 INFO L226 Difference]: Without dead ends: 316 [2022-11-25 17:24:51,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:51,167 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 450 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:51,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 491 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:24:51,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-11-25 17:24:51,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2022-11-25 17:24:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 299 states have (on average 1.0535117056856187) internal successors, (315), 315 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:51,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 315 transitions. [2022-11-25 17:24:51,170 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 315 transitions. Word has length 254 [2022-11-25 17:24:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:51,170 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 315 transitions. [2022-11-25 17:24:51,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 50.8) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 315 transitions. [2022-11-25 17:24:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-11-25 17:24:51,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:51,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:51,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-11-25 17:24:51,173 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr150REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:51,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:51,173 INFO L85 PathProgramCache]: Analyzing trace with hash 513697157, now seen corresponding path program 1 times [2022-11-25 17:24:51,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:51,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194439825] [2022-11-25 17:24:51,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:51,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:51,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:51,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194439825] [2022-11-25 17:24:51,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194439825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:51,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:51,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:51,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706180853] [2022-11-25 17:24:51,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:51,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:51,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:51,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:51,467 INFO L87 Difference]: Start difference. First operand 316 states and 315 transitions. Second operand has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:51,681 INFO L93 Difference]: Finished difference Result 315 states and 314 transitions. [2022-11-25 17:24:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:51,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2022-11-25 17:24:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:51,683 INFO L225 Difference]: With dead ends: 315 [2022-11-25 17:24:51,683 INFO L226 Difference]: Without dead ends: 315 [2022-11-25 17:24:51,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:51,684 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 113 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:51,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 407 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-11-25 17:24:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2022-11-25 17:24:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 299 states have (on average 1.0501672240802675) internal successors, (314), 314 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 314 transitions. [2022-11-25 17:24:51,688 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 314 transitions. Word has length 259 [2022-11-25 17:24:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:51,688 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 314 transitions. [2022-11-25 17:24:51,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 86.33333333333333) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 314 transitions. [2022-11-25 17:24:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-11-25 17:24:51,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:51,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:51,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-11-25 17:24:51,690 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:51,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:51,691 INFO L85 PathProgramCache]: Analyzing trace with hash 513697158, now seen corresponding path program 1 times [2022-11-25 17:24:51,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:51,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716117064] [2022-11-25 17:24:51,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:51,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:51,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:52,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:52,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716117064] [2022-11-25 17:24:52,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716117064] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:52,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:52,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:24:52,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897480873] [2022-11-25 17:24:52,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:52,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:24:52,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:52,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:24:52,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:24:52,461 INFO L87 Difference]: Start difference. First operand 315 states and 314 transitions. Second operand has 7 states, 6 states have (on average 43.166666666666664) internal successors, (259), 7 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:53,005 INFO L93 Difference]: Finished difference Result 314 states and 313 transitions. [2022-11-25 17:24:53,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:53,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 43.166666666666664) internal successors, (259), 7 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2022-11-25 17:24:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:53,007 INFO L225 Difference]: With dead ends: 314 [2022-11-25 17:24:53,007 INFO L226 Difference]: Without dead ends: 314 [2022-11-25 17:24:53,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:24:53,007 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 375 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:53,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 534 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:24:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-11-25 17:24:53,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2022-11-25 17:24:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 299 states have (on average 1.0468227424749164) internal successors, (313), 313 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 313 transitions. [2022-11-25 17:24:53,011 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 313 transitions. Word has length 259 [2022-11-25 17:24:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:53,012 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 313 transitions. [2022-11-25 17:24:53,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 43.166666666666664) internal successors, (259), 7 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 313 transitions. [2022-11-25 17:24:53,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-11-25 17:24:53,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:53,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:53,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-11-25 17:24:53,013 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr152REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:53,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:53,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1167325825, now seen corresponding path program 1 times [2022-11-25 17:24:53,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:53,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520413621] [2022-11-25 17:24:53,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:53,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:53,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:53,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:53,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520413621] [2022-11-25 17:24:53,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520413621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:53,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:53,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:53,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336160096] [2022-11-25 17:24:53,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:53,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:53,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:53,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:53,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:53,284 INFO L87 Difference]: Start difference. First operand 314 states and 313 transitions. Second operand has 4 states, 3 states have (on average 88.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:53,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:53,495 INFO L93 Difference]: Finished difference Result 313 states and 312 transitions. [2022-11-25 17:24:53,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:53,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 88.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2022-11-25 17:24:53,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:53,497 INFO L225 Difference]: With dead ends: 313 [2022-11-25 17:24:53,497 INFO L226 Difference]: Without dead ends: 313 [2022-11-25 17:24:53,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:53,498 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 99 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:53,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 409 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-11-25 17:24:53,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2022-11-25 17:24:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 299 states have (on average 1.0434782608695652) internal successors, (312), 312 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:53,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 312 transitions. [2022-11-25 17:24:53,503 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 312 transitions. Word has length 264 [2022-11-25 17:24:53,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:53,503 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 312 transitions. [2022-11-25 17:24:53,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 88.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:53,503 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 312 transitions. [2022-11-25 17:24:53,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-11-25 17:24:53,505 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:53,505 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:53,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-11-25 17:24:53,505 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr153REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:53,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:53,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1167325824, now seen corresponding path program 1 times [2022-11-25 17:24:53,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:53,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991893221] [2022-11-25 17:24:53,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:53,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:53,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:54,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:54,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991893221] [2022-11-25 17:24:54,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991893221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:54,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:54,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:24:54,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248783790] [2022-11-25 17:24:54,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:54,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:24:54,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:54,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:24:54,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:24:54,203 INFO L87 Difference]: Start difference. First operand 313 states and 312 transitions. Second operand has 7 states, 6 states have (on average 44.0) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:54,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:54,747 INFO L93 Difference]: Finished difference Result 312 states and 311 transitions. [2022-11-25 17:24:54,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:54,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 44.0) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2022-11-25 17:24:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:54,749 INFO L225 Difference]: With dead ends: 312 [2022-11-25 17:24:54,749 INFO L226 Difference]: Without dead ends: 312 [2022-11-25 17:24:54,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:24:54,750 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 582 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:54,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 536 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:24:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-11-25 17:24:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2022-11-25 17:24:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 299 states have (on average 1.040133779264214) internal successors, (311), 311 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 311 transitions. [2022-11-25 17:24:54,753 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 311 transitions. Word has length 264 [2022-11-25 17:24:54,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:54,754 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 311 transitions. [2022-11-25 17:24:54,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 44.0) internal successors, (264), 7 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 311 transitions. [2022-11-25 17:24:54,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-11-25 17:24:54,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:54,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:54,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-11-25 17:24:54,756 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr154REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:54,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:54,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1960631702, now seen corresponding path program 1 times [2022-11-25 17:24:54,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:54,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743746669] [2022-11-25 17:24:54,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:54,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:55,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:55,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:55,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743746669] [2022-11-25 17:24:55,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743746669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:55,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:55,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:55,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461177000] [2022-11-25 17:24:55,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:55,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:55,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:55,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:55,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:55,058 INFO L87 Difference]: Start difference. First operand 312 states and 311 transitions. Second operand has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:55,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:55,269 INFO L93 Difference]: Finished difference Result 311 states and 310 transitions. [2022-11-25 17:24:55,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:55,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 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 269 [2022-11-25 17:24:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:55,270 INFO L225 Difference]: With dead ends: 311 [2022-11-25 17:24:55,271 INFO L226 Difference]: Without dead ends: 311 [2022-11-25 17:24:55,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:55,271 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 85 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:55,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 411 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-11-25 17:24:55,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2022-11-25 17:24:55,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 299 states have (on average 1.0367892976588629) internal successors, (310), 310 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 310 transitions. [2022-11-25 17:24:55,276 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 310 transitions. Word has length 269 [2022-11-25 17:24:55,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:55,276 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 310 transitions. [2022-11-25 17:24:55,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 4 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 310 transitions. [2022-11-25 17:24:55,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-11-25 17:24:55,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:55,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:55,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-11-25 17:24:55,279 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr155REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:55,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:55,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1960631703, now seen corresponding path program 1 times [2022-11-25 17:24:55,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:55,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251645895] [2022-11-25 17:24:55,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:55,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:56,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251645895] [2022-11-25 17:24:56,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251645895] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:56,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:56,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:56,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095611909] [2022-11-25 17:24:56,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:56,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:56,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:56,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:56,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:56,342 INFO L87 Difference]: Start difference. First operand 311 states and 310 transitions. Second operand has 6 states, 5 states have (on average 53.8) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:56,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:56,886 INFO L93 Difference]: Finished difference Result 310 states and 309 transitions. [2022-11-25 17:24:56,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:56,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 53.8) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 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 269 [2022-11-25 17:24:56,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:56,888 INFO L225 Difference]: With dead ends: 310 [2022-11-25 17:24:56,888 INFO L226 Difference]: Without dead ends: 310 [2022-11-25 17:24:56,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:56,888 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 353 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:56,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 538 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:24:56,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-11-25 17:24:56,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2022-11-25 17:24:56,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 299 states have (on average 1.0334448160535117) internal successors, (309), 309 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:56,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 309 transitions. [2022-11-25 17:24:56,891 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 309 transitions. Word has length 269 [2022-11-25 17:24:56,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:56,891 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 309 transitions. [2022-11-25 17:24:56,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 53.8) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 309 transitions. [2022-11-25 17:24:56,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-11-25 17:24:56,892 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:56,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:56,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-11-25 17:24:56,893 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr156REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:56,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:56,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2137655216, now seen corresponding path program 1 times [2022-11-25 17:24:56,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:56,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675074197] [2022-11-25 17:24:56,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:56,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:57,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:57,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675074197] [2022-11-25 17:24:57,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675074197] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:57,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:57,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957457659] [2022-11-25 17:24:57,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:57,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:57,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:57,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:57,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:57,177 INFO L87 Difference]: Start difference. First operand 310 states and 309 transitions. Second operand has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:57,389 INFO L93 Difference]: Finished difference Result 309 states and 308 transitions. [2022-11-25 17:24:57,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:57,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2022-11-25 17:24:57,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:57,391 INFO L225 Difference]: With dead ends: 309 [2022-11-25 17:24:57,391 INFO L226 Difference]: Without dead ends: 309 [2022-11-25 17:24:57,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:57,392 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 71 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:57,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 413 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:57,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-11-25 17:24:57,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2022-11-25 17:24:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 299 states have (on average 1.0301003344481605) internal successors, (308), 308 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 308 transitions. [2022-11-25 17:24:57,396 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 308 transitions. Word has length 274 [2022-11-25 17:24:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:57,396 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 308 transitions. [2022-11-25 17:24:57,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 308 transitions. [2022-11-25 17:24:57,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-11-25 17:24:57,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:57,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:57,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-11-25 17:24:57,398 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr157REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:57,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:57,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2137655217, now seen corresponding path program 1 times [2022-11-25 17:24:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:57,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922830071] [2022-11-25 17:24:57,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:57,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:58,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:58,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:58,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922830071] [2022-11-25 17:24:58,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922830071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:58,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:58,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:58,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208788499] [2022-11-25 17:24:58,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:58,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:58,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:58,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:58,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:58,239 INFO L87 Difference]: Start difference. First operand 309 states and 308 transitions. Second operand has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:58,756 INFO L93 Difference]: Finished difference Result 308 states and 307 transitions. [2022-11-25 17:24:58,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:58,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2022-11-25 17:24:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:58,758 INFO L225 Difference]: With dead ends: 308 [2022-11-25 17:24:58,758 INFO L226 Difference]: Without dead ends: 308 [2022-11-25 17:24:58,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:58,759 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 378 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:58,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 499 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:24:58,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2022-11-25 17:24:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2022-11-25 17:24:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 299 states have (on average 1.0267558528428093) internal successors, (307), 307 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 307 transitions. [2022-11-25 17:24:58,762 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 307 transitions. Word has length 274 [2022-11-25 17:24:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:58,762 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 307 transitions. [2022-11-25 17:24:58,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 54.8) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 307 transitions. [2022-11-25 17:24:58,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-11-25 17:24:58,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:58,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:58,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-11-25 17:24:58,763 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr158REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:58,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:58,764 INFO L85 PathProgramCache]: Analyzing trace with hash -572741209, now seen corresponding path program 1 times [2022-11-25 17:24:58,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:58,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766584258] [2022-11-25 17:24:58,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:58,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:59,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:59,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766584258] [2022-11-25 17:24:59,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766584258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:59,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:59,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:59,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543307387] [2022-11-25 17:24:59,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:59,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:59,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:59,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:59,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:59,055 INFO L87 Difference]: Start difference. First operand 308 states and 307 transitions. Second operand has 4 states, 3 states have (on average 93.0) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:24:59,269 INFO L93 Difference]: Finished difference Result 307 states and 306 transitions. [2022-11-25 17:24:59,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:24:59,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 93.0) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 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 279 [2022-11-25 17:24:59,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:24:59,270 INFO L225 Difference]: With dead ends: 307 [2022-11-25 17:24:59,270 INFO L226 Difference]: Without dead ends: 307 [2022-11-25 17:24:59,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:59,271 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 57 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:24:59,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 415 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:24:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-11-25 17:24:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2022-11-25 17:24:59,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 299 states have (on average 1.0234113712374582) internal successors, (306), 306 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:59,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 306 transitions. [2022-11-25 17:24:59,273 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 306 transitions. Word has length 279 [2022-11-25 17:24:59,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:24:59,273 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 306 transitions. [2022-11-25 17:24:59,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 93.0) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 306 transitions. [2022-11-25 17:24:59,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-11-25 17:24:59,275 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:24:59,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:59,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-11-25 17:24:59,275 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr159REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:24:59,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:59,276 INFO L85 PathProgramCache]: Analyzing trace with hash -572741208, now seen corresponding path program 1 times [2022-11-25 17:24:59,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:59,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344888819] [2022-11-25 17:24:59,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:59,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:25:00,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:25:00,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344888819] [2022-11-25 17:25:00,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344888819] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:25:00,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:25:00,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:25:00,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392408414] [2022-11-25 17:25:00,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:25:00,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:25:00,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:25:00,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:25:00,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:25:00,059 INFO L87 Difference]: Start difference. First operand 307 states and 306 transitions. Second operand has 7 states, 6 states have (on average 46.5) internal successors, (279), 7 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:00,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:25:00,616 INFO L93 Difference]: Finished difference Result 306 states and 305 transitions. [2022-11-25 17:25:00,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:25:00,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 46.5) internal successors, (279), 7 states have internal predecessors, (279), 0 states have call successors, (0), 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 279 [2022-11-25 17:25:00,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:25:00,617 INFO L225 Difference]: With dead ends: 306 [2022-11-25 17:25:00,617 INFO L226 Difference]: Without dead ends: 306 [2022-11-25 17:25:00,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:25:00,617 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 331 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:25:00,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 583 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:25:00,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-25 17:25:00,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2022-11-25 17:25:00,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 299 states have (on average 1.020066889632107) internal successors, (305), 305 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 305 transitions. [2022-11-25 17:25:00,620 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 305 transitions. Word has length 279 [2022-11-25 17:25:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:25:00,620 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 305 transitions. [2022-11-25 17:25:00,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 46.5) internal successors, (279), 7 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:00,621 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 305 transitions. [2022-11-25 17:25:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2022-11-25 17:25:00,622 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:25:00,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:25:00,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-11-25 17:25:00,622 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr161REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:25:00,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:25:00,623 INFO L85 PathProgramCache]: Analyzing trace with hash 425407970, now seen corresponding path program 1 times [2022-11-25 17:25:00,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:25:00,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144315262] [2022-11-25 17:25:00,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:00,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:25:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:25:01,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:25:01,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144315262] [2022-11-25 17:25:01,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144315262] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:25:01,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:25:01,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:25:01,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058644123] [2022-11-25 17:25:01,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:25:01,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:25:01,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:25:01,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:25:01,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:25:01,484 INFO L87 Difference]: Start difference. First operand 306 states and 305 transitions. Second operand has 7 states, 6 states have (on average 47.333333333333336) internal successors, (284), 7 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:02,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:25:02,063 INFO L93 Difference]: Finished difference Result 305 states and 304 transitions. [2022-11-25 17:25:02,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:25:02,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 47.333333333333336) internal successors, (284), 7 states have internal predecessors, (284), 0 states have call successors, (0), 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 284 [2022-11-25 17:25:02,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:25:02,064 INFO L225 Difference]: With dead ends: 305 [2022-11-25 17:25:02,064 INFO L226 Difference]: Without dead ends: 305 [2022-11-25 17:25:02,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:25:02,065 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 323 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:25:02,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 544 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:25:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-11-25 17:25:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2022-11-25 17:25:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 299 states have (on average 1.0167224080267558) internal successors, (304), 304 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 304 transitions. [2022-11-25 17:25:02,069 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 304 transitions. Word has length 284 [2022-11-25 17:25:02,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:25:02,069 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 304 transitions. [2022-11-25 17:25:02,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 47.333333333333336) internal successors, (284), 7 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 304 transitions. [2022-11-25 17:25:02,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2022-11-25 17:25:02,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:25:02,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:25:02,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-11-25 17:25:02,071 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr160REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:25:02,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:25:02,071 INFO L85 PathProgramCache]: Analyzing trace with hash 425407969, now seen corresponding path program 1 times [2022-11-25 17:25:02,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:25:02,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512560135] [2022-11-25 17:25:02,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:02,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:25:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:02,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:25:02,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:25:02,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512560135] [2022-11-25 17:25:02,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512560135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:25:02,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:25:02,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:25:02,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963678004] [2022-11-25 17:25:02,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:25:02,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:25:02,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:25:02,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:25:02,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:25:02,349 INFO L87 Difference]: Start difference. First operand 305 states and 304 transitions. Second operand has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:02,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:25:02,562 INFO L93 Difference]: Finished difference Result 304 states and 303 transitions. [2022-11-25 17:25:02,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:25:02,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 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 284 [2022-11-25 17:25:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:25:02,563 INFO L225 Difference]: With dead ends: 304 [2022-11-25 17:25:02,563 INFO L226 Difference]: Without dead ends: 304 [2022-11-25 17:25:02,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:25:02,564 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 41 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:25:02,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 417 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:25:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-25 17:25:02,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-11-25 17:25:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 299 states have (on average 1.0133779264214047) internal successors, (303), 303 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:02,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 303 transitions. [2022-11-25 17:25:02,569 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 303 transitions. Word has length 284 [2022-11-25 17:25:02,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:25:02,569 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 303 transitions. [2022-11-25 17:25:02,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:02,569 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 303 transitions. [2022-11-25 17:25:02,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2022-11-25 17:25:02,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:25:02,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:25:02,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-11-25 17:25:02,571 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:25:02,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:25:02,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1492858440, now seen corresponding path program 1 times [2022-11-25 17:25:02,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:25:02,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6654775] [2022-11-25 17:25:02,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:02,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:25:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:25:02,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:25:02,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6654775] [2022-11-25 17:25:02,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6654775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:25:02,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:25:02,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:25:02,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493265040] [2022-11-25 17:25:02,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:25:02,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:25:02,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:25:02,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:25:02,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:25:02,940 INFO L87 Difference]: Start difference. First operand 304 states and 303 transitions. Second operand has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:03,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:25:03,152 INFO L93 Difference]: Finished difference Result 303 states and 302 transitions. [2022-11-25 17:25:03,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:25:03,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 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 289 [2022-11-25 17:25:03,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:25:03,154 INFO L225 Difference]: With dead ends: 303 [2022-11-25 17:25:03,154 INFO L226 Difference]: Without dead ends: 303 [2022-11-25 17:25:03,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:25:03,154 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 29 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:25:03,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 419 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:25:03,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-11-25 17:25:03,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2022-11-25 17:25:03,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 299 states have (on average 1.0100334448160535) internal successors, (302), 302 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 302 transitions. [2022-11-25 17:25:03,159 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 302 transitions. Word has length 289 [2022-11-25 17:25:03,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:25:03,159 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 302 transitions. [2022-11-25 17:25:03,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 302 transitions. [2022-11-25 17:25:03,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2022-11-25 17:25:03,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:25:03,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:25:03,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-11-25 17:25:03,162 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr163REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:25:03,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:25:03,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1492858439, now seen corresponding path program 1 times [2022-11-25 17:25:03,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:25:03,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283927956] [2022-11-25 17:25:03,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:03,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:25:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:25:03,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:25:03,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283927956] [2022-11-25 17:25:03,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283927956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:25:03,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:25:03,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:25:03,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466754489] [2022-11-25 17:25:03,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:25:03,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:25:03,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:25:03,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:25:03,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:25:03,965 INFO L87 Difference]: Start difference. First operand 303 states and 302 transitions. Second operand has 7 states, 6 states have (on average 48.166666666666664) internal successors, (289), 7 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:25:04,516 INFO L93 Difference]: Finished difference Result 302 states and 301 transitions. [2022-11-25 17:25:04,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:25:04,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 48.166666666666664) internal successors, (289), 7 states have internal predecessors, (289), 0 states have call successors, (0), 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 289 [2022-11-25 17:25:04,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:25:04,518 INFO L225 Difference]: With dead ends: 302 [2022-11-25 17:25:04,518 INFO L226 Difference]: Without dead ends: 302 [2022-11-25 17:25:04,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:25:04,519 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 517 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:25:04,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 546 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:25:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-11-25 17:25:04,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2022-11-25 17:25:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 299 states have (on average 1.0066889632107023) internal successors, (301), 301 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 301 transitions. [2022-11-25 17:25:04,523 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 301 transitions. Word has length 289 [2022-11-25 17:25:04,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:25:04,524 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 301 transitions. [2022-11-25 17:25:04,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 48.166666666666664) internal successors, (289), 7 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 301 transitions. [2022-11-25 17:25:04,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2022-11-25 17:25:04,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:25:04,526 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:25:04,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-11-25 17:25:04,526 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:25:04,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:25:04,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2093445102, now seen corresponding path program 1 times [2022-11-25 17:25:04,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:25:04,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104858742] [2022-11-25 17:25:04,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:04,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:25:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:25:04,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:25:04,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104858742] [2022-11-25 17:25:04,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104858742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:25:04,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:25:04,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:25:04,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611044714] [2022-11-25 17:25:04,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:25:04,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:25:04,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:25:04,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:25:04,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:25:04,845 INFO L87 Difference]: Start difference. First operand 302 states and 301 transitions. Second operand has 4 states, 3 states have (on average 98.0) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:05,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:25:05,054 INFO L93 Difference]: Finished difference Result 301 states and 300 transitions. [2022-11-25 17:25:05,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:25:05,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 98.0) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 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 294 [2022-11-25 17:25:05,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:25:05,056 INFO L225 Difference]: With dead ends: 301 [2022-11-25 17:25:05,056 INFO L226 Difference]: Without dead ends: 301 [2022-11-25 17:25:05,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:25:05,057 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 15 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:25:05,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 421 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:25:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-11-25 17:25:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2022-11-25 17:25:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 299 states have (on average 1.0033444816053512) internal successors, (300), 300 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 300 transitions. [2022-11-25 17:25:05,061 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 300 transitions. Word has length 294 [2022-11-25 17:25:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:25:05,061 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 300 transitions. [2022-11-25 17:25:05,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 98.0) internal successors, (294), 4 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 300 transitions. [2022-11-25 17:25:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2022-11-25 17:25:05,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:25:05,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:25:05,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-11-25 17:25:05,064 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr165REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:25:05,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:25:05,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2093445101, now seen corresponding path program 1 times [2022-11-25 17:25:05,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:25:05,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378955331] [2022-11-25 17:25:05,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:05,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:25:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:25:05,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:25:05,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378955331] [2022-11-25 17:25:05,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378955331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:25:05,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:25:05,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:25:05,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373077171] [2022-11-25 17:25:05,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:25:05,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:25:05,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:25:05,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:25:05,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:25:05,864 INFO L87 Difference]: Start difference. First operand 301 states and 300 transitions. Second operand has 6 states, 5 states have (on average 58.8) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:25:06,375 INFO L93 Difference]: Finished difference Result 300 states and 299 transitions. [2022-11-25 17:25:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:25:06,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 58.8) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 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 294 [2022-11-25 17:25:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:25:06,377 INFO L225 Difference]: With dead ends: 300 [2022-11-25 17:25:06,377 INFO L226 Difference]: Without dead ends: 300 [2022-11-25 17:25:06,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:25:06,377 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 306 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:25:06,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 507 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:25:06,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-11-25 17:25:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2022-11-25 17:25:06,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.0) internal successors, (299), 299 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 299 transitions. [2022-11-25 17:25:06,380 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 299 transitions. Word has length 294 [2022-11-25 17:25:06,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:25:06,380 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 299 transitions. [2022-11-25 17:25:06,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 58.8) internal successors, (294), 6 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 299 transitions. [2022-11-25 17:25:06,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2022-11-25 17:25:06,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:25:06,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:25:06,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-11-25 17:25:06,382 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr166ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 165 more)] === [2022-11-25 17:25:06,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:25:06,382 INFO L85 PathProgramCache]: Analyzing trace with hash -922991286, now seen corresponding path program 1 times [2022-11-25 17:25:06,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:25:06,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462204777] [2022-11-25 17:25:06,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:25:06,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:25:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:25:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:25:08,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:25:08,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462204777] [2022-11-25 17:25:08,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462204777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:25:08,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:25:08,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:25:08,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408091264] [2022-11-25 17:25:08,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:25:08,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:25:08,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:25:08,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:25:08,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:25:08,474 INFO L87 Difference]: Start difference. First operand 300 states and 299 transitions. Second operand has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:25:09,093 INFO L93 Difference]: Finished difference Result 297 states and 296 transitions. [2022-11-25 17:25:09,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:25:09,093 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 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 299 [2022-11-25 17:25:09,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:25:09,094 INFO L225 Difference]: With dead ends: 297 [2022-11-25 17:25:09,094 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 17:25:09,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:25:09,094 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 219 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:25:09,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 705 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:25:09,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 17:25:09,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 17:25:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 17:25:09,095 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 299 [2022-11-25 17:25:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:25:09,096 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 17:25:09,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:25:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 17:25:09,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 17:25:09,098 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (167 of 168 remaining) [2022-11-25 17:25:09,099 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (166 of 168 remaining) [2022-11-25 17:25:09,099 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (165 of 168 remaining) [2022-11-25 17:25:09,099 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (164 of 168 remaining) [2022-11-25 17:25:09,099 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (163 of 168 remaining) [2022-11-25 17:25:09,099 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (162 of 168 remaining) [2022-11-25 17:25:09,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (161 of 168 remaining) [2022-11-25 17:25:09,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (160 of 168 remaining) [2022-11-25 17:25:09,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (159 of 168 remaining) [2022-11-25 17:25:09,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (158 of 168 remaining) [2022-11-25 17:25:09,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (157 of 168 remaining) [2022-11-25 17:25:09,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (156 of 168 remaining) [2022-11-25 17:25:09,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (155 of 168 remaining) [2022-11-25 17:25:09,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (154 of 168 remaining) [2022-11-25 17:25:09,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (153 of 168 remaining) [2022-11-25 17:25:09,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (152 of 168 remaining) [2022-11-25 17:25:09,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (151 of 168 remaining) [2022-11-25 17:25:09,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (150 of 168 remaining) [2022-11-25 17:25:09,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (149 of 168 remaining) [2022-11-25 17:25:09,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (148 of 168 remaining) [2022-11-25 17:25:09,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (147 of 168 remaining) [2022-11-25 17:25:09,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (146 of 168 remaining) [2022-11-25 17:25:09,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (145 of 168 remaining) [2022-11-25 17:25:09,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (144 of 168 remaining) [2022-11-25 17:25:09,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (143 of 168 remaining) [2022-11-25 17:25:09,101 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (142 of 168 remaining) [2022-11-25 17:25:09,102 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (141 of 168 remaining) [2022-11-25 17:25:09,102 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (140 of 168 remaining) [2022-11-25 17:25:09,102 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (139 of 168 remaining) [2022-11-25 17:25:09,102 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (138 of 168 remaining) [2022-11-25 17:25:09,102 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (137 of 168 remaining) [2022-11-25 17:25:09,102 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (136 of 168 remaining) [2022-11-25 17:25:09,102 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (135 of 168 remaining) [2022-11-25 17:25:09,103 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (134 of 168 remaining) [2022-11-25 17:25:09,103 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (133 of 168 remaining) [2022-11-25 17:25:09,104 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (132 of 168 remaining) [2022-11-25 17:25:09,104 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (131 of 168 remaining) [2022-11-25 17:25:09,104 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (130 of 168 remaining) [2022-11-25 17:25:09,104 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (129 of 168 remaining) [2022-11-25 17:25:09,104 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (128 of 168 remaining) [2022-11-25 17:25:09,104 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (127 of 168 remaining) [2022-11-25 17:25:09,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (126 of 168 remaining) [2022-11-25 17:25:09,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (125 of 168 remaining) [2022-11-25 17:25:09,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (124 of 168 remaining) [2022-11-25 17:25:09,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (123 of 168 remaining) [2022-11-25 17:25:09,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (122 of 168 remaining) [2022-11-25 17:25:09,105 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (121 of 168 remaining) [2022-11-25 17:25:09,106 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (120 of 168 remaining) [2022-11-25 17:25:09,106 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (119 of 168 remaining) [2022-11-25 17:25:09,106 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (118 of 168 remaining) [2022-11-25 17:25:09,106 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (117 of 168 remaining) [2022-11-25 17:25:09,106 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (116 of 168 remaining) [2022-11-25 17:25:09,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (115 of 168 remaining) [2022-11-25 17:25:09,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (114 of 168 remaining) [2022-11-25 17:25:09,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (113 of 168 remaining) [2022-11-25 17:25:09,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (112 of 168 remaining) [2022-11-25 17:25:09,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (111 of 168 remaining) [2022-11-25 17:25:09,107 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (110 of 168 remaining) [2022-11-25 17:25:09,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (109 of 168 remaining) [2022-11-25 17:25:09,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (108 of 168 remaining) [2022-11-25 17:25:09,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (107 of 168 remaining) [2022-11-25 17:25:09,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 168 remaining) [2022-11-25 17:25:09,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 168 remaining) [2022-11-25 17:25:09,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 168 remaining) [2022-11-25 17:25:09,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 168 remaining) [2022-11-25 17:25:09,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 168 remaining) [2022-11-25 17:25:09,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 168 remaining) [2022-11-25 17:25:09,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 168 remaining) [2022-11-25 17:25:09,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 168 remaining) [2022-11-25 17:25:09,109 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 168 remaining) [2022-11-25 17:25:09,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 168 remaining) [2022-11-25 17:25:09,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 168 remaining) [2022-11-25 17:25:09,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 168 remaining) [2022-11-25 17:25:09,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 168 remaining) [2022-11-25 17:25:09,110 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 168 remaining) [2022-11-25 17:25:09,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 168 remaining) [2022-11-25 17:25:09,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 168 remaining) [2022-11-25 17:25:09,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 168 remaining) [2022-11-25 17:25:09,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 168 remaining) [2022-11-25 17:25:09,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 168 remaining) [2022-11-25 17:25:09,111 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 168 remaining) [2022-11-25 17:25:09,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 168 remaining) [2022-11-25 17:25:09,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 168 remaining) [2022-11-25 17:25:09,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 168 remaining) [2022-11-25 17:25:09,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 168 remaining) [2022-11-25 17:25:09,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 168 remaining) [2022-11-25 17:25:09,112 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 168 remaining) [2022-11-25 17:25:09,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 168 remaining) [2022-11-25 17:25:09,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 168 remaining) [2022-11-25 17:25:09,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 168 remaining) [2022-11-25 17:25:09,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 168 remaining) [2022-11-25 17:25:09,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 168 remaining) [2022-11-25 17:25:09,113 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 168 remaining) [2022-11-25 17:25:09,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 168 remaining) [2022-11-25 17:25:09,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 168 remaining) [2022-11-25 17:25:09,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 168 remaining) [2022-11-25 17:25:09,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 168 remaining) [2022-11-25 17:25:09,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 168 remaining) [2022-11-25 17:25:09,114 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 168 remaining) [2022-11-25 17:25:09,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 168 remaining) [2022-11-25 17:25:09,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 168 remaining) [2022-11-25 17:25:09,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 168 remaining) [2022-11-25 17:25:09,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 168 remaining) [2022-11-25 17:25:09,115 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 168 remaining) [2022-11-25 17:25:09,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 168 remaining) [2022-11-25 17:25:09,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 168 remaining) [2022-11-25 17:25:09,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 168 remaining) [2022-11-25 17:25:09,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 168 remaining) [2022-11-25 17:25:09,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 168 remaining) [2022-11-25 17:25:09,116 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 168 remaining) [2022-11-25 17:25:09,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 168 remaining) [2022-11-25 17:25:09,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 168 remaining) [2022-11-25 17:25:09,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 168 remaining) [2022-11-25 17:25:09,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 168 remaining) [2022-11-25 17:25:09,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 168 remaining) [2022-11-25 17:25:09,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 168 remaining) [2022-11-25 17:25:09,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 168 remaining) [2022-11-25 17:25:09,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 168 remaining) [2022-11-25 17:25:09,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 168 remaining) [2022-11-25 17:25:09,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 168 remaining) [2022-11-25 17:25:09,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 168 remaining) [2022-11-25 17:25:09,118 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 168 remaining) [2022-11-25 17:25:09,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 168 remaining) [2022-11-25 17:25:09,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 168 remaining) [2022-11-25 17:25:09,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 168 remaining) [2022-11-25 17:25:09,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 168 remaining) [2022-11-25 17:25:09,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 168 remaining) [2022-11-25 17:25:09,119 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 168 remaining) [2022-11-25 17:25:09,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 168 remaining) [2022-11-25 17:25:09,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 168 remaining) [2022-11-25 17:25:09,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 168 remaining) [2022-11-25 17:25:09,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 168 remaining) [2022-11-25 17:25:09,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 168 remaining) [2022-11-25 17:25:09,120 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 168 remaining) [2022-11-25 17:25:09,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 168 remaining) [2022-11-25 17:25:09,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 168 remaining) [2022-11-25 17:25:09,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 168 remaining) [2022-11-25 17:25:09,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 168 remaining) [2022-11-25 17:25:09,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 168 remaining) [2022-11-25 17:25:09,121 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 168 remaining) [2022-11-25 17:25:09,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr140REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 168 remaining) [2022-11-25 17:25:09,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr141REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 168 remaining) [2022-11-25 17:25:09,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr142REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 168 remaining) [2022-11-25 17:25:09,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr143REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 168 remaining) [2022-11-25 17:25:09,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr144REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 168 remaining) [2022-11-25 17:25:09,122 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr145REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 168 remaining) [2022-11-25 17:25:09,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr146REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 168 remaining) [2022-11-25 17:25:09,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr147REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 168 remaining) [2022-11-25 17:25:09,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr148REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 168 remaining) [2022-11-25 17:25:09,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr149REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 168 remaining) [2022-11-25 17:25:09,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr150REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 168 remaining) [2022-11-25 17:25:09,123 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr151REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 168 remaining) [2022-11-25 17:25:09,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr152REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 168 remaining) [2022-11-25 17:25:09,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr153REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 168 remaining) [2022-11-25 17:25:09,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr154REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 168 remaining) [2022-11-25 17:25:09,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr155REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 168 remaining) [2022-11-25 17:25:09,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr156REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 168 remaining) [2022-11-25 17:25:09,124 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr157REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 168 remaining) [2022-11-25 17:25:09,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr158REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 168 remaining) [2022-11-25 17:25:09,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr159REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 168 remaining) [2022-11-25 17:25:09,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr160REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 168 remaining) [2022-11-25 17:25:09,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr161REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 168 remaining) [2022-11-25 17:25:09,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr162REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 168 remaining) [2022-11-25 17:25:09,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr163REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 168 remaining) [2022-11-25 17:25:09,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr164REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 168 remaining) [2022-11-25 17:25:09,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr165REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 168 remaining) [2022-11-25 17:25:09,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr166ASSERT_VIOLATIONMEMORY_LEAK (1 of 168 remaining) [2022-11-25 17:25:09,126 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr167ASSERT_VIOLATIONMEMORY_LEAK (0 of 168 remaining) [2022-11-25 17:25:09,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-11-25 17:25:09,130 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:25:09,133 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:25:09,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:25:09 BoogieIcfgContainer [2022-11-25 17:25:09,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:25:09,137 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:25:09,137 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:25:09,137 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:25:09,138 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:23:42" (3/4) ... [2022-11-25 17:25:09,141 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 17:25:09,173 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 210 nodes and edges [2022-11-25 17:25:09,176 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-25 17:25:09,178 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-25 17:25:09,181 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-25 17:25:09,184 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 17:25:09,186 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:25:09,189 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:25:09,489 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:25:09,489 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:25:09,490 INFO L158 Benchmark]: Toolchain (without parser) took 90058.68ms. Allocated memory was 155.2MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 111.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 177.3MB. Max. memory is 16.1GB. [2022-11-25 17:25:09,490 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 115.3MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:25:09,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 891.38ms. Allocated memory is still 155.2MB. Free memory was 111.7MB in the beginning and 73.4MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-25 17:25:09,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 194.57ms. Allocated memory is still 155.2MB. Free memory was 73.4MB in the beginning and 121.1MB in the end (delta: -47.7MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2022-11-25 17:25:09,491 INFO L158 Benchmark]: Boogie Preprocessor took 148.79ms. Allocated memory is still 155.2MB. Free memory was 121.1MB in the beginning and 110.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 17:25:09,491 INFO L158 Benchmark]: RCFGBuilder took 2006.33ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 109.4MB in the beginning and 128.6MB in the end (delta: -19.2MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2022-11-25 17:25:09,491 INFO L158 Benchmark]: TraceAbstraction took 86458.58ms. Allocated memory was 186.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 127.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. [2022-11-25 17:25:09,491 INFO L158 Benchmark]: Witness Printer took 352.68ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 39.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-25 17:25:09,495 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 115.3MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 891.38ms. Allocated memory is still 155.2MB. Free memory was 111.7MB in the beginning and 73.4MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 194.57ms. Allocated memory is still 155.2MB. Free memory was 73.4MB in the beginning and 121.1MB in the end (delta: -47.7MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 148.79ms. Allocated memory is still 155.2MB. Free memory was 121.1MB in the beginning and 110.3MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 2006.33ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 109.4MB in the beginning and 128.6MB in the end (delta: -19.2MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. * TraceAbstraction took 86458.58ms. Allocated memory was 186.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 127.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 123.4MB. Max. memory is 16.1GB. * Witness Printer took 352.68ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 39.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1287]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 130]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 470 locations, 168 error locations. Started 1 CEGAR loops. OverallTime: 86.4s, OverallIterations: 91, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 39.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44849 SdHoareTripleChecker+Valid, 33.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44849 mSDsluCounter, 41545 SdHoareTripleChecker+Invalid, 28.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19419 mSDsCounter, 2028 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28887 IncrementalHoareTripleChecker+Invalid, 30915 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2028 mSolverCounterUnsat, 22126 mSDtfsCounter, 28887 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 611 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 516 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=470occurred in iteration=0, InterpolantAutomatonStates: 539, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 91 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 36.5s InterpolantComputationTime, 16665 NumberOfCodeBlocks, 16665 NumberOfCodeBlocksAsserted, 91 NumberOfCheckSat, 16574 ConstructedInterpolants, 0 QuantifiedInterpolants, 83472 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 91 InterpolantComputations, 91 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 168 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-25 17:25:09,544 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b63a0e06-6c4f-4f99-97f5-8d1b190f1886/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE