./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/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_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/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_da1eaff2-457c-4795-83e9-a74d7e851453/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 fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 --- 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 16:42:42,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:42:42,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:42:42,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:42:42,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:42:42,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:42:42,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:42:42,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:42:42,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:42:42,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:42:42,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:42:42,495 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:42:42,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:42:42,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:42:42,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:42:42,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:42:42,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:42:42,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:42:42,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:42:42,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:42:42,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:42:42,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:42:42,512 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:42:42,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:42:42,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:42:42,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:42:42,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:42:42,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:42:42,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:42:42,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:42:42,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:42:42,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:42:42,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:42:42,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:42:42,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:42:42,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:42:42,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:42:42,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:42:42,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:42:42,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:42:42,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:42:42,533 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 16:42:42,560 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:42:42,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:42:42,561 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:42:42,561 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:42:42,562 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:42:42,562 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:42:42,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:42:42,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:42:42,564 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:42:42,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:42:42,564 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:42:42,565 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:42:42,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:42:42,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:42:42,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:42:42,566 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 16:42:42,566 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 16:42:42,567 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 16:42:42,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:42:42,567 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 16:42:42,567 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:42:42,568 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:42:42,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:42:42,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:42:42,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:42:42,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:42:42,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:42:42,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:42:42,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:42:42,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:42:42,571 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:42:42,571 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:42:42,571 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:42:42,572 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_da1eaff2-457c-4795-83e9-a74d7e851453/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_da1eaff2-457c-4795-83e9-a74d7e851453/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 -> fabf091179f48b7141dc193b5040f4974c042bd8a2afb03b99137d693bf63ce7 [2022-11-25 16:42:42,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:42:42,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:42:42,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:42:42,895 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:42:42,895 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:42:42,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2022-11-25 16:42:46,375 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:42:46,836 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:42:46,837 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i [2022-11-25 16:42:46,856 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/data/c6fd00e5c/0b445f630aa044f38a793bca457dc338/FLAGbf107b6d3 [2022-11-25 16:42:46,879 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/data/c6fd00e5c/0b445f630aa044f38a793bca457dc338 [2022-11-25 16:42:46,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:42:46,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:42:46,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:42:46,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:42:46,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:42:46,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:42:46" (1/1) ... [2022-11-25 16:42:46,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4510dfbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:46, skipping insertion in model container [2022-11-25 16:42:46,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:42:46" (1/1) ... [2022-11-25 16:42:46,909 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:42:46,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:42:47,388 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_da1eaff2-457c-4795-83e9-a74d7e851453/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2022-11-25 16:42:47,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:42:47,402 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:42:47,452 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_da1eaff2-457c-4795-83e9-a74d7e851453/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-1.i[24987,25000] [2022-11-25 16:42:47,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:42:47,484 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:42:47,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:47 WrapperNode [2022-11-25 16:42:47,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:42:47,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:42:47,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:42:47,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:42:47,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:47" (1/1) ... [2022-11-25 16:42:47,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:47" (1/1) ... [2022-11-25 16:42:47,585 INFO L138 Inliner]: procedures = 129, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 185 [2022-11-25 16:42:47,587 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:42:47,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:42:47,589 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:42:47,589 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:42:47,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:47" (1/1) ... [2022-11-25 16:42:47,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:47" (1/1) ... [2022-11-25 16:42:47,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:47" (1/1) ... [2022-11-25 16:42:47,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:47" (1/1) ... [2022-11-25 16:42:47,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:47" (1/1) ... [2022-11-25 16:42:47,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:47" (1/1) ... [2022-11-25 16:42:47,633 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:47" (1/1) ... [2022-11-25 16:42:47,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:47" (1/1) ... [2022-11-25 16:42:47,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:42:47,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:42:47,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:42:47,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:42:47,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:47" (1/1) ... [2022-11-25 16:42:47,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:42:47,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:42:47,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:42:47,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:42:47,735 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-25 16:42:47,735 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-25 16:42:47,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 16:42:47,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:42:47,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:42:47,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 16:42:47,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 16:42:47,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:42:47,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 16:42:47,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:42:47,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:42:47,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:42:47,905 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:42:47,908 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:42:47,961 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-25 16:42:48,604 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:42:48,626 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:42:48,626 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-25 16:42:48,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:42:48 BoogieIcfgContainer [2022-11-25 16:42:48,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:42:48,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:42:48,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:42:48,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:42:48,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:42:46" (1/3) ... [2022-11-25 16:42:48,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fa862f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:42:48, skipping insertion in model container [2022-11-25 16:42:48,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:42:47" (2/3) ... [2022-11-25 16:42:48,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51fa862f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:42:48, skipping insertion in model container [2022-11-25 16:42:48,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:42:48" (3/3) ... [2022-11-25 16:42:48,648 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2022-11-25 16:42:48,676 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:42:48,676 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2022-11-25 16:42:48,752 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:42:48,763 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;@1316f988, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:42:48,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2022-11-25 16:42:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 115 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:48,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 16:42:48,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:48,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 16:42:48,804 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:48,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:48,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1083078, now seen corresponding path program 1 times [2022-11-25 16:42:48,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:48,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124781938] [2022-11-25 16:42:48,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:48,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:49,071 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 16:42:49,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:49,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124781938] [2022-11-25 16:42:49,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124781938] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:49,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:49,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:42:49,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212668365] [2022-11-25 16:42:49,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:49,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 16:42:49,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:49,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 16:42:49,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:42:49,155 INFO L87 Difference]: Start difference. First operand has 117 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 115 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 16:42:49,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:42:49,204 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2022-11-25 16:42:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 16:42:49,207 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 16:42:49,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:42:49,218 INFO L225 Difference]: With dead ends: 117 [2022-11-25 16:42:49,219 INFO L226 Difference]: Without dead ends: 111 [2022-11-25 16:42:49,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:42:49,225 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:42:49,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:42:49,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-25 16:42:49,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-11-25 16:42:49,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 110 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 16:42:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2022-11-25 16:42:49,285 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 4 [2022-11-25 16:42:49,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:42:49,287 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2022-11-25 16:42:49,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 16:42:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2022-11-25 16:42:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 16:42:49,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:49,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 16:42:49,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:42:49,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:49,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:49,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1079730, now seen corresponding path program 1 times [2022-11-25 16:42:49,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:49,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100929618] [2022-11-25 16:42:49,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:49,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:49,451 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 16:42:49,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:49,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100929618] [2022-11-25 16:42:49,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100929618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:49,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:49,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:42:49,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900606328] [2022-11-25 16:42:49,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:49,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:42:49,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:49,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:42:49,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:42:49,456 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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 16:42:49,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:42:49,637 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2022-11-25 16:42:49,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:42:49,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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 16:42:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:42:49,641 INFO L225 Difference]: With dead ends: 136 [2022-11-25 16:42:49,643 INFO L226 Difference]: Without dead ends: 136 [2022-11-25 16:42:49,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:42:49,646 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 113 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:42:49,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 99 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:42:49,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-25 16:42:49,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2022-11-25 16:42:49,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 108 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:49,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2022-11-25 16:42:49,664 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 4 [2022-11-25 16:42:49,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:42:49,665 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2022-11-25 16:42:49,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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 16:42:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2022-11-25 16:42:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 16:42:49,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:49,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 16:42:49,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:42:49,668 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:49,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:49,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1079731, now seen corresponding path program 1 times [2022-11-25 16:42:49,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:49,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029909517] [2022-11-25 16:42:49,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:49,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:49,735 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 16:42:49,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:49,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029909517] [2022-11-25 16:42:49,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029909517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:49,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:49,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:42:49,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655711942] [2022-11-25 16:42:49,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:49,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:42:49,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:49,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:42:49,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:42:49,740 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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 16:42:49,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:42:49,781 INFO L93 Difference]: Finished difference Result 157 states and 175 transitions. [2022-11-25 16:42:49,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:42:49,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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 16:42:49,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:42:49,783 INFO L225 Difference]: With dead ends: 157 [2022-11-25 16:42:49,784 INFO L226 Difference]: Without dead ends: 157 [2022-11-25 16:42:49,784 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 16:42:49,786 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 52 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:42:49,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 226 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:42:49,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-25 16:42:49,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2022-11-25 16:42:49,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.7571428571428571) internal successors, (123), 109 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:49,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2022-11-25 16:42:49,798 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 4 [2022-11-25 16:42:49,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:42:49,799 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2022-11-25 16:42:49,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 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 16:42:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2022-11-25 16:42:49,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 16:42:49,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:49,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:49,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:42:49,801 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:49,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:49,802 INFO L85 PathProgramCache]: Analyzing trace with hash -336207078, now seen corresponding path program 1 times [2022-11-25 16:42:49,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:49,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732314979] [2022-11-25 16:42:49,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:49,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:49,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:49,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732314979] [2022-11-25 16:42:49,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732314979] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:42:49,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247439328] [2022-11-25 16:42:49,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:49,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:42:49,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:42:49,904 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:42:49,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 16:42:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:50,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:42:50,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:42:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:50,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:42:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:50,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247439328] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:42:50,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:42:50,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-25 16:42:50,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498489014] [2022-11-25 16:42:50,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:42:50,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:42:50,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:50,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:42:50,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:42:50,243 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:42:50,376 INFO L93 Difference]: Finished difference Result 244 states and 268 transitions. [2022-11-25 16:42:50,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:42:50,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 16:42:50,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:42:50,383 INFO L225 Difference]: With dead ends: 244 [2022-11-25 16:42:50,384 INFO L226 Difference]: Without dead ends: 244 [2022-11-25 16:42:50,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:42:50,393 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 307 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:42:50,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 603 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:42:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-11-25 16:42:50,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 173. [2022-11-25 16:42:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 133 states have (on average 1.7518796992481203) internal successors, (233), 172 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 233 transitions. [2022-11-25 16:42:50,420 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 233 transitions. Word has length 9 [2022-11-25 16:42:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:42:50,420 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 233 transitions. [2022-11-25 16:42:50,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2022-11-25 16:42:50,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 16:42:50,422 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:50,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:50,436 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 16:42:50,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:42:50,630 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:50,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:50,631 INFO L85 PathProgramCache]: Analyzing trace with hash -991177183, now seen corresponding path program 1 times [2022-11-25 16:42:50,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:50,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795056109] [2022-11-25 16:42:50,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:50,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:50,767 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 16:42:50,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:50,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795056109] [2022-11-25 16:42:50,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795056109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:50,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:50,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:42:50,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3402233] [2022-11-25 16:42:50,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:50,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:42:50,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:50,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:42:50,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:42:50,780 INFO L87 Difference]: Start difference. First operand 173 states and 233 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:42:51,029 INFO L93 Difference]: Finished difference Result 329 states and 444 transitions. [2022-11-25 16:42:51,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:42:51,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 16:42:51,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:42:51,031 INFO L225 Difference]: With dead ends: 329 [2022-11-25 16:42:51,031 INFO L226 Difference]: Without dead ends: 329 [2022-11-25 16:42:51,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:42:51,032 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 111 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:42:51,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 270 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:42:51,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-11-25 16:42:51,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 172. [2022-11-25 16:42:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 133 states have (on average 1.7293233082706767) internal successors, (230), 171 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 230 transitions. [2022-11-25 16:42:51,045 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 230 transitions. Word has length 11 [2022-11-25 16:42:51,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:42:51,045 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 230 transitions. [2022-11-25 16:42:51,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 230 transitions. [2022-11-25 16:42:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 16:42:51,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:51,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:51,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:42:51,047 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:51,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:51,051 INFO L85 PathProgramCache]: Analyzing trace with hash -991177182, now seen corresponding path program 1 times [2022-11-25 16:42:51,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:51,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284272490] [2022-11-25 16:42:51,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:51,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:51,237 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 16:42:51,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:51,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284272490] [2022-11-25 16:42:51,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284272490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:51,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:51,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:42:51,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158899328] [2022-11-25 16:42:51,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:51,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:42:51,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:51,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:42:51,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:42:51,240 INFO L87 Difference]: Start difference. First operand 172 states and 230 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:42:51,395 INFO L93 Difference]: Finished difference Result 330 states and 442 transitions. [2022-11-25 16:42:51,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:42:51,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 16:42:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:42:51,398 INFO L225 Difference]: With dead ends: 330 [2022-11-25 16:42:51,398 INFO L226 Difference]: Without dead ends: 330 [2022-11-25 16:42:51,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:42:51,400 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 114 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:42:51,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 278 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:42:51,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-11-25 16:42:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 171. [2022-11-25 16:42:51,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 133 states have (on average 1.7067669172932332) internal successors, (227), 170 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 227 transitions. [2022-11-25 16:42:51,422 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 227 transitions. Word has length 11 [2022-11-25 16:42:51,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:42:51,422 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 227 transitions. [2022-11-25 16:42:51,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 227 transitions. [2022-11-25 16:42:51,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 16:42:51,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:51,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:51,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:42:51,424 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:51,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:51,425 INFO L85 PathProgramCache]: Analyzing trace with hash -661772220, now seen corresponding path program 1 times [2022-11-25 16:42:51,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:51,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492956997] [2022-11-25 16:42:51,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:51,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:51,473 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 16:42:51,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:51,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492956997] [2022-11-25 16:42:51,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492956997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:51,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:51,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:42:51,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297448486] [2022-11-25 16:42:51,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:51,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:42:51,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:51,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:42:51,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:42:51,477 INFO L87 Difference]: Start difference. First operand 171 states and 227 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:51,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:42:51,585 INFO L93 Difference]: Finished difference Result 244 states and 312 transitions. [2022-11-25 16:42:51,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:42:51,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-25 16:42:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:42:51,587 INFO L225 Difference]: With dead ends: 244 [2022-11-25 16:42:51,587 INFO L226 Difference]: Without dead ends: 244 [2022-11-25 16:42:51,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:42:51,588 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 105 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:42:51,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 204 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:42:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-11-25 16:42:51,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 169. [2022-11-25 16:42:51,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.6616541353383458) internal successors, (221), 168 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 221 transitions. [2022-11-25 16:42:51,596 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 221 transitions. Word has length 12 [2022-11-25 16:42:51,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:42:51,596 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 221 transitions. [2022-11-25 16:42:51,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:51,597 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 221 transitions. [2022-11-25 16:42:51,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-25 16:42:51,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:51,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:51,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:42:51,598 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:51,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:51,599 INFO L85 PathProgramCache]: Analyzing trace with hash -661772219, now seen corresponding path program 1 times [2022-11-25 16:42:51,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:51,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129388189] [2022-11-25 16:42:51,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:51,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:51,690 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 16:42:51,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:51,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129388189] [2022-11-25 16:42:51,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129388189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:51,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:51,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:42:51,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901596371] [2022-11-25 16:42:51,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:51,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:42:51,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:51,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:42:51,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:42:51,693 INFO L87 Difference]: Start difference. First operand 169 states and 221 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:42:51,818 INFO L93 Difference]: Finished difference Result 376 states and 459 transitions. [2022-11-25 16:42:51,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:42:51,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-25 16:42:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:42:51,821 INFO L225 Difference]: With dead ends: 376 [2022-11-25 16:42:51,821 INFO L226 Difference]: Without dead ends: 376 [2022-11-25 16:42:51,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 16:42:51,822 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 234 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:42:51,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 812 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:42:51,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-11-25 16:42:51,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 172. [2022-11-25 16:42:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 136 states have (on average 1.6470588235294117) internal successors, (224), 171 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 16:42:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 224 transitions. [2022-11-25 16:42:51,830 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 224 transitions. Word has length 12 [2022-11-25 16:42:51,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:42:51,831 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 224 transitions. [2022-11-25 16:42:51,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 224 transitions. [2022-11-25 16:42:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 16:42:51,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:51,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:51,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:42:51,833 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:51,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:51,834 INFO L85 PathProgramCache]: Analyzing trace with hash -51661170, now seen corresponding path program 1 times [2022-11-25 16:42:51,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:51,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933306820] [2022-11-25 16:42:51,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:51,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:51,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:51,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933306820] [2022-11-25 16:42:51,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933306820] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:42:51,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833401713] [2022-11-25 16:42:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:51,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:42:51,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:42:51,954 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:42:51,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 16:42:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:52,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 16:42:52,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:42:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:52,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:42:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:42:52,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833401713] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:42:52,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:42:52,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2022-11-25 16:42:52,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983907654] [2022-11-25 16:42:52,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:42:52,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:42:52,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:52,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:42:52,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:42:52,279 INFO L87 Difference]: Start difference. First operand 172 states and 224 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:42:52,448 INFO L93 Difference]: Finished difference Result 391 states and 474 transitions. [2022-11-25 16:42:52,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:42:52,449 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 16:42:52,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:42:52,456 INFO L225 Difference]: With dead ends: 391 [2022-11-25 16:42:52,456 INFO L226 Difference]: Without dead ends: 391 [2022-11-25 16:42:52,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-11-25 16:42:52,459 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 485 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:42:52,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 814 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:42:52,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-11-25 16:42:52,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 196. [2022-11-25 16:42:52,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 160 states have (on average 1.55) internal successors, (248), 195 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 248 transitions. [2022-11-25 16:42:52,467 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 248 transitions. Word has length 16 [2022-11-25 16:42:52,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:42:52,467 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 248 transitions. [2022-11-25 16:42:52,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 248 transitions. [2022-11-25 16:42:52,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 16:42:52,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:52,469 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-11-25 16:42:52,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 16:42:52,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:42:52,676 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:52,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:52,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1254577850, now seen corresponding path program 2 times [2022-11-25 16:42:52,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:52,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010085413] [2022-11-25 16:42:52,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:52,758 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 16:42:52,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:52,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010085413] [2022-11-25 16:42:52,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010085413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:52,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:52,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:42:52,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290678326] [2022-11-25 16:42:52,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:52,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:42:52,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:52,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:42:52,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:42:52,761 INFO L87 Difference]: Start difference. First operand 196 states and 248 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:42:52,854 INFO L93 Difference]: Finished difference Result 269 states and 337 transitions. [2022-11-25 16:42:52,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:42:52,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 16:42:52,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:42:52,856 INFO L225 Difference]: With dead ends: 269 [2022-11-25 16:42:52,857 INFO L226 Difference]: Without dead ends: 269 [2022-11-25 16:42:52,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:42:52,858 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 63 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:42:52,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 182 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:42:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-11-25 16:42:52,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 233. [2022-11-25 16:42:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 197 states have (on average 1.5532994923857868) internal successors, (306), 232 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 16:42:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 306 transitions. [2022-11-25 16:42:52,866 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 306 transitions. Word has length 19 [2022-11-25 16:42:52,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:42:52,866 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 306 transitions. [2022-11-25 16:42:52,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:52,868 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 306 transitions. [2022-11-25 16:42:52,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 16:42:52,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:52,876 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:52,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:42:52,877 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:52,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:52,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1435011604, now seen corresponding path program 1 times [2022-11-25 16:42:52,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:52,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170329878] [2022-11-25 16:42:52,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:52,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 16:42:52,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:52,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170329878] [2022-11-25 16:42:52,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170329878] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:52,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:52,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:42:52,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661746378] [2022-11-25 16:42:52,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:52,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:42:52,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:52,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:42:52,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:42:52,973 INFO L87 Difference]: Start difference. First operand 233 states and 306 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:53,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:42:53,065 INFO L93 Difference]: Finished difference Result 260 states and 321 transitions. [2022-11-25 16:42:53,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:42:53,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-25 16:42:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:42:53,067 INFO L225 Difference]: With dead ends: 260 [2022-11-25 16:42:53,067 INFO L226 Difference]: Without dead ends: 260 [2022-11-25 16:42:53,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:42:53,068 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 105 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:42:53,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 380 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:42:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-25 16:42:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 217. [2022-11-25 16:42:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 181 states have (on average 1.5248618784530388) internal successors, (276), 216 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 276 transitions. [2022-11-25 16:42:53,074 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 276 transitions. Word has length 23 [2022-11-25 16:42:53,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:42:53,074 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 276 transitions. [2022-11-25 16:42:53,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:53,074 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 276 transitions. [2022-11-25 16:42:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 16:42:53,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:53,075 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:53,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:42:53,076 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:53,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:53,076 INFO L85 PathProgramCache]: Analyzing trace with hash 877276576, now seen corresponding path program 2 times [2022-11-25 16:42:53,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:53,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193773022] [2022-11-25 16:42:53,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:53,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 16:42:53,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:53,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193773022] [2022-11-25 16:42:53,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193773022] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:42:53,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390542310] [2022-11-25 16:42:53,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:42:53,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:42:53,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:42:53,388 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:42:53,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 16:42:53,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:42:53,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:42:53,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 16:42:53,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:42:53,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 16:42:53,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 16:42:53,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:42:53,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 16:42:53,656 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 16:42:53,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 16:42:53,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:42:53,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 16:42:53,719 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:42:53,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 16:42:53,773 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 16:42:53,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-25 16:42:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 16:42:53,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:42:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:42:54,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390542310] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:42:54,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:42:54,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 9 [2022-11-25 16:42:54,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608343277] [2022-11-25 16:42:54,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:42:54,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 16:42:54,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:54,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 16:42:54,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-11-25 16:42:54,599 INFO L87 Difference]: Start difference. First operand 217 states and 276 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:54,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:42:54,877 INFO L93 Difference]: Finished difference Result 272 states and 330 transitions. [2022-11-25 16:42:54,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:42:54,878 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-25 16:42:54,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:42:54,880 INFO L225 Difference]: With dead ends: 272 [2022-11-25 16:42:54,880 INFO L226 Difference]: Without dead ends: 272 [2022-11-25 16:42:54,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:42:54,881 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 479 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:42:54,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 262 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:42:54,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-25 16:42:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 215. [2022-11-25 16:42:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 181 states have (on average 1.4917127071823204) internal successors, (270), 214 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 270 transitions. [2022-11-25 16:42:54,888 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 270 transitions. Word has length 24 [2022-11-25 16:42:54,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:42:54,888 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 270 transitions. [2022-11-25 16:42:54,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 270 transitions. [2022-11-25 16:42:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 16:42:54,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:54,890 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:54,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 16:42:55,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-25 16:42:55,091 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:55,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:55,091 INFO L85 PathProgramCache]: Analyzing trace with hash 361607171, now seen corresponding path program 1 times [2022-11-25 16:42:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:55,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512236263] [2022-11-25 16:42:55,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:55,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 16:42:55,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:55,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512236263] [2022-11-25 16:42:55,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512236263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:55,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:55,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:42:55,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231111840] [2022-11-25 16:42:55,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:55,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:42:55,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:55,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:42:55,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:42:55,199 INFO L87 Difference]: Start difference. First operand 215 states and 270 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:42:55,311 INFO L93 Difference]: Finished difference Result 233 states and 288 transitions. [2022-11-25 16:42:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:42:55,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-25 16:42:55,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:42:55,313 INFO L225 Difference]: With dead ends: 233 [2022-11-25 16:42:55,313 INFO L226 Difference]: Without dead ends: 233 [2022-11-25 16:42:55,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:42:55,314 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 15 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:42:55,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 407 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:42:55,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-11-25 16:42:55,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 217. [2022-11-25 16:42:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 183 states have (on average 1.4863387978142077) internal successors, (272), 216 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 272 transitions. [2022-11-25 16:42:55,321 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 272 transitions. Word has length 25 [2022-11-25 16:42:55,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:42:55,321 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 272 transitions. [2022-11-25 16:42:55,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 272 transitions. [2022-11-25 16:42:55,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 16:42:55,322 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:55,322 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:55,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:42:55,322 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:55,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:55,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1675080075, now seen corresponding path program 1 times [2022-11-25 16:42:55,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:55,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519712030] [2022-11-25 16:42:55,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:55,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-25 16:42:55,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:55,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519712030] [2022-11-25 16:42:55,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519712030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:55,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:55,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:42:55,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825518745] [2022-11-25 16:42:55,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:55,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:42:55,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:55,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:42:55,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:42:55,462 INFO L87 Difference]: Start difference. First operand 217 states and 272 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:55,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:42:55,559 INFO L93 Difference]: Finished difference Result 219 states and 273 transitions. [2022-11-25 16:42:55,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:42:55,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-25 16:42:55,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:42:55,561 INFO L225 Difference]: With dead ends: 219 [2022-11-25 16:42:55,561 INFO L226 Difference]: Without dead ends: 211 [2022-11-25 16:42:55,562 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 16:42:55,562 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:42:55,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 264 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:42:55,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-25 16:42:55,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2022-11-25 16:42:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 175 states have (on average 1.502857142857143) internal successors, (263), 208 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 263 transitions. [2022-11-25 16:42:55,568 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 263 transitions. Word has length 26 [2022-11-25 16:42:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:42:55,568 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 263 transitions. [2022-11-25 16:42:55,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 263 transitions. [2022-11-25 16:42:55,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 16:42:55,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:55,573 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:55,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 16:42:55,573 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:55,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:55,574 INFO L85 PathProgramCache]: Analyzing trace with hash -981051253, now seen corresponding path program 1 times [2022-11-25 16:42:55,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:55,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051379603] [2022-11-25 16:42:55,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:55,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 16:42:55,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:55,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051379603] [2022-11-25 16:42:55,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051379603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:55,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:55,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:42:55,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345495617] [2022-11-25 16:42:55,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:55,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:42:55,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:55,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:42:55,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:42:55,740 INFO L87 Difference]: Start difference. First operand 209 states and 263 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:42:55,899 INFO L93 Difference]: Finished difference Result 235 states and 289 transitions. [2022-11-25 16:42:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:42:55,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-25 16:42:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:42:55,901 INFO L225 Difference]: With dead ends: 235 [2022-11-25 16:42:55,901 INFO L226 Difference]: Without dead ends: 235 [2022-11-25 16:42:55,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 16:42:55,902 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 293 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:42:55,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 169 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:42:55,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-11-25 16:42:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 208. [2022-11-25 16:42:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 175 states have (on average 1.4857142857142858) internal successors, (260), 207 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 260 transitions. [2022-11-25 16:42:55,908 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 260 transitions. Word has length 29 [2022-11-25 16:42:55,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:42:55,908 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 260 transitions. [2022-11-25 16:42:55,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:55,909 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 260 transitions. [2022-11-25 16:42:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 16:42:55,909 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:55,909 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:55,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 16:42:55,910 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:55,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:55,910 INFO L85 PathProgramCache]: Analyzing trace with hash -981051252, now seen corresponding path program 1 times [2022-11-25 16:42:55,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:55,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721430622] [2022-11-25 16:42:55,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:55,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 16:42:56,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:56,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721430622] [2022-11-25 16:42:56,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721430622] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:42:56,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:42:56,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:42:56,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820975034] [2022-11-25 16:42:56,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:42:56,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:42:56,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:42:56,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:42:56,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:42:56,101 INFO L87 Difference]: Start difference. First operand 208 states and 260 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:56,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:42:56,221 INFO L93 Difference]: Finished difference Result 207 states and 257 transitions. [2022-11-25 16:42:56,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:42:56,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-25 16:42:56,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:42:56,223 INFO L225 Difference]: With dead ends: 207 [2022-11-25 16:42:56,224 INFO L226 Difference]: Without dead ends: 207 [2022-11-25 16:42:56,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 16:42:56,225 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 302 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:42:56,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 126 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:42:56,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-11-25 16:42:56,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-11-25 16:42:56,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 175 states have (on average 1.4685714285714286) internal successors, (257), 206 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 257 transitions. [2022-11-25 16:42:56,230 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 257 transitions. Word has length 29 [2022-11-25 16:42:56,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:42:56,231 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 257 transitions. [2022-11-25 16:42:56,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:42:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 257 transitions. [2022-11-25 16:42:56,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 16:42:56,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:42:56,232 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:42:56,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 16:42:56,232 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:42:56,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:42:56,233 INFO L85 PathProgramCache]: Analyzing trace with hash -347817722, now seen corresponding path program 1 times [2022-11-25 16:42:56,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:42:56,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859714198] [2022-11-25 16:42:56,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:56,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:42:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:42:56,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:42:56,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859714198] [2022-11-25 16:42:56,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859714198] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:42:56,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216906270] [2022-11-25 16:42:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:42:56,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:42:56,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:42:56,783 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:42:56,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 16:42:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:42:56,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-25 16:42:56,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:42:56,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 16:42:56,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:42:56,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 16:42:57,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:42:57,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 16:42:57,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:42:57,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 16:42:57,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:42:57,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 16:42:57,167 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 16:42:57,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:43:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 16:43:07,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216906270] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:43:07,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:43:07,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-11-25 16:43:07,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425748745] [2022-11-25 16:43:07,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:43:07,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 16:43:07,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:07,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 16:43:07,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-11-25 16:43:07,859 INFO L87 Difference]: Start difference. First operand 207 states and 257 transitions. Second operand has 13 states, 12 states have (on average 6.666666666666667) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:08,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:43:08,080 INFO L93 Difference]: Finished difference Result 230 states and 278 transitions. [2022-11-25 16:43:08,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:43:08,081 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 6.666666666666667) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-25 16:43:08,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:43:08,082 INFO L225 Difference]: With dead ends: 230 [2022-11-25 16:43:08,083 INFO L226 Difference]: Without dead ends: 230 [2022-11-25 16:43:08,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:43:08,084 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 773 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:43:08,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 86 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:43:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-11-25 16:43:08,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 203. [2022-11-25 16:43:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 175 states have (on average 1.4228571428571428) internal successors, (249), 202 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 16:43:08,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 249 transitions. [2022-11-25 16:43:08,090 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 249 transitions. Word has length 30 [2022-11-25 16:43:08,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:43:08,090 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 249 transitions. [2022-11-25 16:43:08,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 6.666666666666667) internal successors, (80), 13 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 249 transitions. [2022-11-25 16:43:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 16:43:08,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:43:08,092 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:08,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 16:43:08,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 16:43:08,292 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:43:08,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:08,293 INFO L85 PathProgramCache]: Analyzing trace with hash -347817723, now seen corresponding path program 1 times [2022-11-25 16:43:08,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:08,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784300763] [2022-11-25 16:43:08,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:08,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 16:43:08,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:08,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784300763] [2022-11-25 16:43:08,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784300763] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:43:08,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424449031] [2022-11-25 16:43:08,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:08,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:43:08,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:43:08,752 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:43:08,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 16:43:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:08,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 16:43:08,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:43:08,928 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 16:43:08,966 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 16:43:08,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-25 16:43:09,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:09,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 16:43:09,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:09,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 16:43:09,110 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 16:43:09,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-11-25 16:43:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:43:09,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:43:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:43:09,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424449031] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:43:09,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:43:09,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2022-11-25 16:43:09,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374243279] [2022-11-25 16:43:09,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:43:09,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-25 16:43:09,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:09,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-25 16:43:09,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-11-25 16:43:09,860 INFO L87 Difference]: Start difference. First operand 203 states and 249 transitions. Second operand has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:43:10,085 INFO L93 Difference]: Finished difference Result 228 states and 272 transitions. [2022-11-25 16:43:10,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:43:10,086 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-25 16:43:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:43:10,087 INFO L225 Difference]: With dead ends: 228 [2022-11-25 16:43:10,088 INFO L226 Difference]: Without dead ends: 228 [2022-11-25 16:43:10,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-25 16:43:10,089 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 650 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:43:10,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 225 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:43:10,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-11-25 16:43:10,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 201. [2022-11-25 16:43:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 175 states have (on average 1.3885714285714286) internal successors, (243), 200 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 243 transitions. [2022-11-25 16:43:10,094 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 243 transitions. Word has length 30 [2022-11-25 16:43:10,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:43:10,095 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 243 transitions. [2022-11-25 16:43:10,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.0) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:10,095 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 243 transitions. [2022-11-25 16:43:10,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 16:43:10,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:43:10,096 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:10,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 16:43:10,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:43:10,297 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:43:10,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1918350099, now seen corresponding path program 1 times [2022-11-25 16:43:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:10,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618230028] [2022-11-25 16:43:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:10,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:11,134 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 16:43:11,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:11,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618230028] [2022-11-25 16:43:11,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618230028] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:43:11,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536910120] [2022-11-25 16:43:11,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:11,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:43:11,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:43:11,139 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:43:11,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 16:43:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:11,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-25 16:43:11,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:43:11,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:11,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 16:43:11,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:11,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 16:43:11,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:11,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 16:43:11,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:11,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-25 16:43:12,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:12,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:12,088 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 16:43:12,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2022-11-25 16:43:12,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:12,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 16:43:12,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:12,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 16:43:12,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:12,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 16:43:12,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:12,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 16:43:12,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:12,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 16:43:12,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:12,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 16:43:12,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:12,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 16:43:12,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 16:43:12,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 16:43:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:43:12,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:43:12,636 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)) (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)))) (forall ((|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (not (<= |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| |c_ULTIMATE.start_node_create_with_sublist_#res#1.base|)) (forall ((v_ArrVal_504 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) is different from false [2022-11-25 16:43:12,672 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (forall ((v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int)) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) is different from false [2022-11-25 16:43:12,990 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0)))) is different from false [2022-11-25 16:43:27,202 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))))) (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|))))) is different from false [2022-11-25 16:43:27,432 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0) (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (< |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |c_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 0))))))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|))))) is different from false [2022-11-25 16:43:29,788 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_492 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int)) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int) (v_ArrVal_495 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_497 (Array Int Int))) (or (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|) (= (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_492) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| v_ArrVal_495) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_497) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_502) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_503) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0))))))))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|)))) (forall ((|v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| Int)) (or (forall ((v_ArrVal_493 (Array Int Int)) (|v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| Int) (|ULTIMATE.start_sll_create_~head~0#1.offset| Int)) (or (forall ((|v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| Int)) (or (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_504 (Array Int Int)) (|v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| Int) (v_ArrVal_498 (Array Int Int))) (or (= (select (select (store (store (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| v_ArrVal_493))) (store .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| (store (select .cse0 |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25|) 0 |ULTIMATE.start_sll_create_~head~0#1.offset|))) |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| v_ArrVal_498) |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| v_ArrVal_501) |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14| v_ArrVal_504) |c_ULTIMATE.start_main_~#head~1#1.base|) |c_ULTIMATE.start_main_~#head~1#1.offset|) 0) (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |v_ULTIMATE.start_sll_append_~new_last~0#1.base_14|))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_24| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_25| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_sll_create_~new_head~0#1.base_26| |c_#StackHeapBarrier|)))) (not (< |v_ULTIMATE.start_node_create_with_sublist_~new_node~0#1.base_16| |c_#StackHeapBarrier|))))) is different from false [2022-11-25 16:43:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-25 16:43:30,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536910120] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:43:30,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:43:30,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 35 [2022-11-25 16:43:30,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413623056] [2022-11-25 16:43:30,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:43:30,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-25 16:43:30,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:30,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-25 16:43:30,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=626, Unknown=48, NotChecked=354, Total=1190 [2022-11-25 16:43:30,323 INFO L87 Difference]: Start difference. First operand 201 states and 243 transitions. Second operand has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:33,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:43:33,601 INFO L93 Difference]: Finished difference Result 365 states and 425 transitions. [2022-11-25 16:43:33,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 16:43:33,607 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-25 16:43:33,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:43:33,608 INFO L225 Difference]: With dead ends: 365 [2022-11-25 16:43:33,609 INFO L226 Difference]: Without dead ends: 365 [2022-11-25 16:43:33,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=424, Invalid=1111, Unknown=49, NotChecked=486, Total=2070 [2022-11-25 16:43:33,611 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 190 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 686 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:43:33,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1421 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 431 Invalid, 0 Unknown, 686 Unchecked, 1.1s Time] [2022-11-25 16:43:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-11-25 16:43:33,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 279. [2022-11-25 16:43:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 278 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 16:43:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 324 transitions. [2022-11-25 16:43:33,621 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 324 transitions. Word has length 33 [2022-11-25 16:43:33,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:43:33,621 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 324 transitions. [2022-11-25 16:43:33,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 324 transitions. [2022-11-25 16:43:33,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 16:43:33,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:43:33,623 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:33,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 16:43:33,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:43:33,837 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:43:33,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:33,838 INFO L85 PathProgramCache]: Analyzing trace with hash -919962184, now seen corresponding path program 1 times [2022-11-25 16:43:33,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:33,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081201659] [2022-11-25 16:43:33,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:33,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-25 16:43:33,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:33,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081201659] [2022-11-25 16:43:33,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081201659] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:33,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:33,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:43:33,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707270143] [2022-11-25 16:43:33,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:33,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:43:33,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:33,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:43:33,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:43:33,962 INFO L87 Difference]: Start difference. First operand 279 states and 324 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:34,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:43:34,021 INFO L93 Difference]: Finished difference Result 341 states and 386 transitions. [2022-11-25 16:43:34,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:43:34,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 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 55 [2022-11-25 16:43:34,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:43:34,024 INFO L225 Difference]: With dead ends: 341 [2022-11-25 16:43:34,024 INFO L226 Difference]: Without dead ends: 341 [2022-11-25 16:43:34,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:43:34,025 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 250 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:43:34,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 188 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:43:34,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-11-25 16:43:34,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 279. [2022-11-25 16:43:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 253 states have (on average 1.2806324110671936) internal successors, (324), 278 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 16:43:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 324 transitions. [2022-11-25 16:43:34,033 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 324 transitions. Word has length 55 [2022-11-25 16:43:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:43:34,034 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 324 transitions. [2022-11-25 16:43:34,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:34,034 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 324 transitions. [2022-11-25 16:43:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 16:43:34,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:43:34,035 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:34,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 16:43:34,036 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:43:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:34,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1545942185, now seen corresponding path program 1 times [2022-11-25 16:43:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:34,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453790247] [2022-11-25 16:43:34,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:34,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-25 16:43:34,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:34,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453790247] [2022-11-25 16:43:34,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453790247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:34,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:34,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:43:34,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473368568] [2022-11-25 16:43:34,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:34,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:43:34,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:34,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:43:34,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:43:34,407 INFO L87 Difference]: Start difference. First operand 279 states and 324 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:34,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:43:34,918 INFO L93 Difference]: Finished difference Result 470 states and 540 transitions. [2022-11-25 16:43:34,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 16:43:34,919 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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 56 [2022-11-25 16:43:34,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:43:34,922 INFO L225 Difference]: With dead ends: 470 [2022-11-25 16:43:34,922 INFO L226 Difference]: Without dead ends: 470 [2022-11-25 16:43:34,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2022-11-25 16:43:34,924 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 934 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:43:34,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 409 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:43:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2022-11-25 16:43:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 305. [2022-11-25 16:43:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 280 states have (on average 1.2857142857142858) internal successors, (360), 304 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 16:43:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 360 transitions. [2022-11-25 16:43:34,935 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 360 transitions. Word has length 56 [2022-11-25 16:43:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:43:34,936 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 360 transitions. [2022-11-25 16:43:34,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:34,936 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 360 transitions. [2022-11-25 16:43:34,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 16:43:34,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:43:34,937 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:34,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 16:43:34,938 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:43:34,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:34,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1545942186, now seen corresponding path program 1 times [2022-11-25 16:43:34,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:34,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382535232] [2022-11-25 16:43:34,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:34,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:43:35,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:35,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382535232] [2022-11-25 16:43:35,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382535232] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:43:35,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937938395] [2022-11-25 16:43:35,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:35,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:43:35,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:43:35,266 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:43:35,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 16:43:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:35,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 16:43:35,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:43:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:43:35,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:43:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:43:35,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937938395] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:43:35,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:43:35,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15 [2022-11-25 16:43:35,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878261181] [2022-11-25 16:43:35,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:43:35,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-25 16:43:35,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:35,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 16:43:35,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:43:35,732 INFO L87 Difference]: Start difference. First operand 305 states and 360 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:43:36,378 INFO L93 Difference]: Finished difference Result 688 states and 794 transitions. [2022-11-25 16:43:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 16:43:36,379 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 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 56 [2022-11-25 16:43:36,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:43:36,381 INFO L225 Difference]: With dead ends: 688 [2022-11-25 16:43:36,381 INFO L226 Difference]: Without dead ends: 688 [2022-11-25 16:43:36,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 102 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=552, Unknown=0, NotChecked=0, Total=812 [2022-11-25 16:43:36,383 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 552 mSDsluCounter, 2333 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 16:43:36,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 2796 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 16:43:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-11-25 16:43:36,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 347. [2022-11-25 16:43:36,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 322 states have (on average 1.2857142857142858) internal successors, (414), 346 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:36,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 414 transitions. [2022-11-25 16:43:36,395 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 414 transitions. Word has length 56 [2022-11-25 16:43:36,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:43:36,396 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 414 transitions. [2022-11-25 16:43:36,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 414 transitions. [2022-11-25 16:43:36,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 16:43:36,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:43:36,397 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:36,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 16:43:36,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-25 16:43:36,604 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:43:36,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:36,604 INFO L85 PathProgramCache]: Analyzing trace with hash -276278870, now seen corresponding path program 2 times [2022-11-25 16:43:36,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:36,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413574394] [2022-11-25 16:43:36,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:36,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:37,239 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-25 16:43:37,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:37,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413574394] [2022-11-25 16:43:37,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413574394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:37,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:37,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:43:37,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376742070] [2022-11-25 16:43:37,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:37,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 16:43:37,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:37,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 16:43:37,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:43:37,241 INFO L87 Difference]: Start difference. First operand 347 states and 414 transitions. Second operand has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:37,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:43:37,748 INFO L93 Difference]: Finished difference Result 511 states and 616 transitions. [2022-11-25 16:43:37,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:43:37,749 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 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 56 [2022-11-25 16:43:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:43:37,751 INFO L225 Difference]: With dead ends: 511 [2022-11-25 16:43:37,751 INFO L226 Difference]: Without dead ends: 511 [2022-11-25 16:43:37,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:43:37,752 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 824 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 16:43:37,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 355 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 16:43:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-11-25 16:43:37,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 380. [2022-11-25 16:43:37,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 355 states have (on average 1.3070422535211268) internal successors, (464), 379 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 464 transitions. [2022-11-25 16:43:37,763 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 464 transitions. Word has length 56 [2022-11-25 16:43:37,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:43:37,764 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 464 transitions. [2022-11-25 16:43:37,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 464 transitions. [2022-11-25 16:43:37,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 16:43:37,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:43:37,765 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:37,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 16:43:37,766 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:43:37,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:37,767 INFO L85 PathProgramCache]: Analyzing trace with hash 25284007, now seen corresponding path program 1 times [2022-11-25 16:43:37,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:37,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509818275] [2022-11-25 16:43:37,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:37,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-11-25 16:43:38,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:38,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509818275] [2022-11-25 16:43:38,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509818275] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:38,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:38,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:43:38,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728847527] [2022-11-25 16:43:38,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:38,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:43:38,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:38,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:43:38,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:43:38,002 INFO L87 Difference]: Start difference. First operand 380 states and 464 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:38,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:43:38,280 INFO L93 Difference]: Finished difference Result 430 states and 532 transitions. [2022-11-25 16:43:38,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:43:38,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 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 57 [2022-11-25 16:43:38,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:43:38,283 INFO L225 Difference]: With dead ends: 430 [2022-11-25 16:43:38,283 INFO L226 Difference]: Without dead ends: 430 [2022-11-25 16:43:38,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-25 16:43:38,284 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 53 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:43:38,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 507 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:43:38,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-11-25 16:43:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 418. [2022-11-25 16:43:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 393 states have (on average 1.3333333333333333) internal successors, (524), 417 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:38,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 524 transitions. [2022-11-25 16:43:38,296 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 524 transitions. Word has length 57 [2022-11-25 16:43:38,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:43:38,297 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 524 transitions. [2022-11-25 16:43:38,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 524 transitions. [2022-11-25 16:43:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 16:43:38,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:43:38,298 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:38,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 16:43:38,299 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:43:38,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:38,300 INFO L85 PathProgramCache]: Analyzing trace with hash 783803729, now seen corresponding path program 1 times [2022-11-25 16:43:38,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:38,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777599076] [2022-11-25 16:43:38,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:38,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-25 16:43:38,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:38,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777599076] [2022-11-25 16:43:38,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777599076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:43:38,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:43:38,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:43:38,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292976615] [2022-11-25 16:43:38,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:43:38,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:43:38,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:43:38,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:43:38,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:43:38,633 INFO L87 Difference]: Start difference. First operand 418 states and 524 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:43:38,926 INFO L93 Difference]: Finished difference Result 516 states and 637 transitions. [2022-11-25 16:43:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:43:38,927 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 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 58 [2022-11-25 16:43:38,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:43:38,929 INFO L225 Difference]: With dead ends: 516 [2022-11-25 16:43:38,929 INFO L226 Difference]: Without dead ends: 516 [2022-11-25 16:43:38,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-11-25 16:43:38,930 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 659 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 16:43:38,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 415 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 16:43:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-11-25 16:43:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 418. [2022-11-25 16:43:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 393 states have (on average 1.3206106870229009) internal successors, (519), 417 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 519 transitions. [2022-11-25 16:43:38,942 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 519 transitions. Word has length 58 [2022-11-25 16:43:38,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:43:38,943 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 519 transitions. [2022-11-25 16:43:38,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:43:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 519 transitions. [2022-11-25 16:43:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-25 16:43:38,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:43:38,944 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:43:38,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 16:43:38,945 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 39 more)] === [2022-11-25 16:43:38,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:43:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1466385390, now seen corresponding path program 1 times [2022-11-25 16:43:38,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:43:38,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686747651] [2022-11-25 16:43:38,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:43:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-25 16:43:40,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:43:40,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686747651] [2022-11-25 16:43:40,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686747651] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:43:40,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003404464] [2022-11-25 16:43:40,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:43:40,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:43:40,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:43:40,370 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:43:40,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da1eaff2-457c-4795-83e9-a74d7e851453/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 16:43:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:43:40,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 78 conjunts are in the unsatisfiable core [2022-11-25 16:43:40,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:43:40,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 16:43:40,698 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 16:43:40,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 16:43:40,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 16:43:41,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 16:43:41,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:41,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 16:43:41,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 16:43:41,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 16:43:41,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 16:43:41,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-25 16:43:42,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 16:43:42,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 16:43:42,621 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-11-25 16:43:42,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 42 [2022-11-25 16:43:42,632 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 16:43:42,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2022-11-25 16:43:42,646 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 16:43:42,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:43:43,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 16:43:43,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1424 treesize of output 1405 [2022-11-25 16:57:52,009 WARN L233 SmtUtils]: Spent 13.82m on a formula simplification. DAG size of input: 228 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)