./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-dietlibc/strtok_r.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/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_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-dietlibc/strtok_r.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/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 64bit --witnessprinter.graph.data.programhash 768358a1bcdb56fc885a8df113baa43d689898e0e32c0ab06e790a868148d36d --- 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 15:32:54,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:32:54,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:32:54,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:32:54,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:32:54,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:32:54,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:32:54,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:32:54,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:32:54,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:32:54,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:32:54,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:32:54,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:32:54,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:32:54,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:32:54,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:32:54,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:32:54,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:32:54,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:32:54,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:32:54,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:32:54,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:32:54,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:32:54,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:32:54,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:32:54,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:32:54,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:32:54,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:32:54,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:32:54,493 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:32:54,493 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:32:54,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:32:54,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:32:54,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:32:54,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:32:54,497 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:32:54,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:32:54,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:32:54,498 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:32:54,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:32:54,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:32:54,500 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-11-25 15:32:54,521 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:32:54,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:32:54,522 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:32:54,522 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:32:54,523 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:32:54,523 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:32:54,524 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:32:54,524 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:32:54,524 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:32:54,525 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:32:54,525 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:32:54,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:32:54,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:32:54,525 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 15:32:54,526 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 15:32:54,526 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 15:32:54,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:32:54,526 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 15:32:54,526 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:32:54,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:32:54,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:32:54,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:32:54,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:32:54,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:32:54,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:32:54,528 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:32:54,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:32:54,529 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:32:54,529 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:32:54,529 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:32:54,529 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_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/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_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 768358a1bcdb56fc885a8df113baa43d689898e0e32c0ab06e790a868148d36d [2022-11-25 15:32:54,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:32:54,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:32:54,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:32:54,917 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:32:54,918 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:32:54,919 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/termination-dietlibc/strtok_r.i [2022-11-25 15:32:58,055 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:32:58,352 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:32:58,353 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/sv-benchmarks/c/termination-dietlibc/strtok_r.i [2022-11-25 15:32:58,366 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/bin/uautomizer-ZsLfNo2U6R/data/635a3e1b3/0965b7adf8c74176bd812aaa1afecb3b/FLAGb866dcbdb [2022-11-25 15:32:58,387 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/bin/uautomizer-ZsLfNo2U6R/data/635a3e1b3/0965b7adf8c74176bd812aaa1afecb3b [2022-11-25 15:32:58,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:32:58,394 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:32:58,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:32:58,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:32:58,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:32:58,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:32:58" (1/1) ... [2022-11-25 15:32:58,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6faaafe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:58, skipping insertion in model container [2022-11-25 15:32:58,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:32:58" (1/1) ... [2022-11-25 15:32:58,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:32:58,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:32:58,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:32:58,843 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:32:58,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:32:58,912 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:32:58,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:58 WrapperNode [2022-11-25 15:32:58,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:32:58,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:32:58,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:32:58,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:32:58,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:58" (1/1) ... [2022-11-25 15:32:58,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:58" (1/1) ... [2022-11-25 15:32:58,972 INFO L138 Inliner]: procedures = 118, calls = 31, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 157 [2022-11-25 15:32:58,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:32:58,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:32:58,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:32:58,974 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:32:58,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:58" (1/1) ... [2022-11-25 15:32:58,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:58" (1/1) ... [2022-11-25 15:32:58,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:58" (1/1) ... [2022-11-25 15:32:58,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:58" (1/1) ... [2022-11-25 15:32:59,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:58" (1/1) ... [2022-11-25 15:32:59,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:58" (1/1) ... [2022-11-25 15:32:59,013 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:58" (1/1) ... [2022-11-25 15:32:59,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:58" (1/1) ... [2022-11-25 15:32:59,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:32:59,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:32:59,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:32:59,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:32:59,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:58" (1/1) ... [2022-11-25 15:32:59,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:32:59,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:32:59,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:32:59,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:32:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 15:32:59,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:32:59,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:32:59,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 15:32:59,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 15:32:59,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:32:59,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 15:32:59,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:32:59,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:32:59,259 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:32:59,262 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:32:59,782 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:32:59,788 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:32:59,788 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-25 15:32:59,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:32:59 BoogieIcfgContainer [2022-11-25 15:32:59,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:32:59,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:32:59,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:32:59,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:32:59,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:32:58" (1/3) ... [2022-11-25 15:32:59,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11637aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:32:59, skipping insertion in model container [2022-11-25 15:32:59,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:32:58" (2/3) ... [2022-11-25 15:32:59,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11637aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:32:59, skipping insertion in model container [2022-11-25 15:32:59,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:32:59" (3/3) ... [2022-11-25 15:32:59,806 INFO L112 eAbstractionObserver]: Analyzing ICFG strtok_r.i [2022-11-25 15:32:59,828 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:32:59,829 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-11-25 15:32:59,909 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:32:59,918 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;@304868ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:32:59,918 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-11-25 15:32:59,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 79 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:32:59,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 15:32:59,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:32:59,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 15:32:59,934 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:32:59,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:32:59,943 INFO L85 PathProgramCache]: Analyzing trace with hash 925759, now seen corresponding path program 1 times [2022-11-25 15:32:59,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:32:59,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635053363] [2022-11-25 15:32:59,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:32:59,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:00,128 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 15:33:00,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:00,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635053363] [2022-11-25 15:33:00,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635053363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:00,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:00,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:33:00,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110164843] [2022-11-25 15:33:00,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:00,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:00,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:00,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:00,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:00,192 INFO L87 Difference]: Start difference. First operand has 80 states, 48 states have (on average 1.9791666666666667) internal successors, (95), 79 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 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 15:33:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:00,319 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-11-25 15:33:00,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:00,325 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 15:33:00,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:00,335 INFO L225 Difference]: With dead ends: 81 [2022-11-25 15:33:00,336 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 15:33:00,338 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 15:33:00,343 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 2 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:00,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 140 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:33:00,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 15:33:00,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-25 15:33:00,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.872340425531915) internal successors, (88), 77 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2022-11-25 15:33:00,396 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 4 [2022-11-25 15:33:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:00,396 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2022-11-25 15:33:00,397 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 15:33:00,397 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2022-11-25 15:33:00,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 15:33:00,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:00,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 15:33:00,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:33:00,399 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:00,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:00,401 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-11-25 15:33:00,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:00,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284735866] [2022-11-25 15:33:00,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:00,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:00,536 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 15:33:00,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:00,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284735866] [2022-11-25 15:33:00,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284735866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:00,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:00,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:33:00,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089149354] [2022-11-25 15:33:00,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:00,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:00,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:00,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:00,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:00,542 INFO L87 Difference]: Start difference. First operand 78 states and 88 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 15:33:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:00,640 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-11-25 15:33:00,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:00,641 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 15:33:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:00,646 INFO L225 Difference]: With dead ends: 77 [2022-11-25 15:33:00,647 INFO L226 Difference]: Without dead ends: 77 [2022-11-25 15:33:00,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:00,653 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:00,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 54 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:33:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-25 15:33:00,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-11-25 15:33:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 47 states have (on average 1.851063829787234) internal successors, (87), 76 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:00,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2022-11-25 15:33:00,674 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 4 [2022-11-25 15:33:00,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:00,674 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2022-11-25 15:33:00,674 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 15:33:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2022-11-25 15:33:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 15:33:00,676 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:00,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 15:33:00,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:33:00,678 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:00,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:00,683 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-11-25 15:33:00,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:00,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043142609] [2022-11-25 15:33:00,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:00,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:00,951 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 15:33:00,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:00,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043142609] [2022-11-25 15:33:00,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043142609] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:00,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:00,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:00,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292379704] [2022-11-25 15:33:00,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:00,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:33:00,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:00,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:33:00,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:33:00,956 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:01,097 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2022-11-25 15:33:01,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:33:01,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 15:33:01,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:01,100 INFO L225 Difference]: With dead ends: 78 [2022-11-25 15:33:01,100 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 15:33:01,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:33:01,108 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 88 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:01,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 135 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:33:01,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 15:33:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-11-25 15:33:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.8297872340425532) internal successors, (86), 75 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 15:33:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-11-25 15:33:01,126 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 4 [2022-11-25 15:33:01,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:01,126 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-11-25 15:33:01,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-11-25 15:33:01,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 15:33:01,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:01,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:01,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:33:01,129 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:01,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:01,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1806782778, now seen corresponding path program 1 times [2022-11-25 15:33:01,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:01,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499654185] [2022-11-25 15:33:01,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:01,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:01,274 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 15:33:01,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:01,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499654185] [2022-11-25 15:33:01,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499654185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:01,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:01,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:01,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078105903] [2022-11-25 15:33:01,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:01,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:33:01,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:01,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:33:01,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:33:01,277 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:01,360 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2022-11-25 15:33:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:33:01,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-25 15:33:01,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:01,362 INFO L225 Difference]: With dead ends: 77 [2022-11-25 15:33:01,362 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 15:33:01,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:33:01,363 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:01,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:33:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 15:33:01,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-25 15:33:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.8085106382978724) internal successors, (85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2022-11-25 15:33:01,369 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 7 [2022-11-25 15:33:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:01,370 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2022-11-25 15:33:01,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2022-11-25 15:33:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-25 15:33:01,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:01,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:01,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:33:01,372 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:01,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:01,372 INFO L85 PathProgramCache]: Analyzing trace with hash 175688811, now seen corresponding path program 1 times [2022-11-25 15:33:01,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:01,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618943269] [2022-11-25 15:33:01,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:01,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:01,449 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 15:33:01,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:01,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618943269] [2022-11-25 15:33:01,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618943269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:01,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:01,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:33:01,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301611831] [2022-11-25 15:33:01,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:01,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:33:01,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:01,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:33:01,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:33:01,453 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:01,487 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2022-11-25 15:33:01,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:33:01,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-11-25 15:33:01,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:01,489 INFO L225 Difference]: With dead ends: 72 [2022-11-25 15:33:01,489 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 15:33:01,489 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 15:33:01,490 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 146 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:01,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 70 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:01,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 15:33:01,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-25 15:33:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 71 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 15:33:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2022-11-25 15:33:01,495 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 8 [2022-11-25 15:33:01,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:01,495 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2022-11-25 15:33:01,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-11-25 15:33:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 15:33:01,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:01,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:01,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:33:01,497 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:01,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1151391829, now seen corresponding path program 1 times [2022-11-25 15:33:01,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:01,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381088026] [2022-11-25 15:33:01,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:01,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:01,630 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 15:33:01,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:01,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381088026] [2022-11-25 15:33:01,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381088026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:01,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:01,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:33:01,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974213670] [2022-11-25 15:33:01,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:01,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:33:01,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:01,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:33:01,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:33:01,637 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 15:33:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:01,751 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-11-25 15:33:01,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:33:01,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 9 [2022-11-25 15:33:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:01,753 INFO L225 Difference]: With dead ends: 68 [2022-11-25 15:33:01,753 INFO L226 Difference]: Without dead ends: 68 [2022-11-25 15:33:01,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:33:01,754 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 197 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:01,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 42 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:33:01,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-25 15:33:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-25 15:33:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:01,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-11-25 15:33:01,758 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 9 [2022-11-25 15:33:01,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:01,758 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-11-25 15:33:01,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 15:33:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-11-25 15:33:01,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 15:33:01,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:01,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:01,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:33:01,760 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:01,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:01,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1151391830, now seen corresponding path program 1 times [2022-11-25 15:33:01,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:01,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332027987] [2022-11-25 15:33:01,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:01,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:02,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:02,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:02,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332027987] [2022-11-25 15:33:02,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332027987] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:02,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:02,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:33:02,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57340931] [2022-11-25 15:33:02,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:02,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:33:02,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:02,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:33:02,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:33:02,034 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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 15:33:02,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:02,302 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2022-11-25 15:33:02,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:33:02,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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 9 [2022-11-25 15:33:02,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:02,303 INFO L225 Difference]: With dead ends: 126 [2022-11-25 15:33:02,304 INFO L226 Difference]: Without dead ends: 126 [2022-11-25 15:33:02,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-25 15:33:02,305 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 387 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:02,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 86 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:33:02,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-25 15:33:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 78. [2022-11-25 15:33:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.690909090909091) internal successors, (93), 77 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-11-25 15:33:02,310 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 9 [2022-11-25 15:33:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:02,310 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-11-25 15:33:02,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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 15:33:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-11-25 15:33:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 15:33:02,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:02,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:02,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:33:02,311 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:02,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:02,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1614014439, now seen corresponding path program 1 times [2022-11-25 15:33:02,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:02,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112596202] [2022-11-25 15:33:02,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:02,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:02,429 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 15:33:02,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:02,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112596202] [2022-11-25 15:33:02,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112596202] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:02,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:02,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:33:02,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069058021] [2022-11-25 15:33:02,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:02,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:33:02,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:02,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:33:02,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:33:02,432 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:02,550 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2022-11-25 15:33:02,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:33:02,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 15:33:02,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:02,552 INFO L225 Difference]: With dead ends: 112 [2022-11-25 15:33:02,552 INFO L226 Difference]: Without dead ends: 112 [2022-11-25 15:33:02,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:33:02,553 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 187 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:02,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 105 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:33:02,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-25 15:33:02,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 75. [2022-11-25 15:33:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 55 states have (on average 1.6) internal successors, (88), 74 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:02,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2022-11-25 15:33:02,562 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 11 [2022-11-25 15:33:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:02,564 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2022-11-25 15:33:02,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2022-11-25 15:33:02,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 15:33:02,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:02,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:02,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:33:02,567 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:02,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1614014438, now seen corresponding path program 1 times [2022-11-25 15:33:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:02,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472039543] [2022-11-25 15:33:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:02,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:02,948 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 15:33:02,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:02,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472039543] [2022-11-25 15:33:02,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472039543] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:02,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:02,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:33:02,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360748477] [2022-11-25 15:33:02,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:02,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:33:02,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:02,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:33:02,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:33:02,951 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:03,157 INFO L93 Difference]: Finished difference Result 137 states and 160 transitions. [2022-11-25 15:33:03,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:33:03,158 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 15:33:03,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:03,159 INFO L225 Difference]: With dead ends: 137 [2022-11-25 15:33:03,159 INFO L226 Difference]: Without dead ends: 137 [2022-11-25 15:33:03,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:33:03,160 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 306 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:03,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 119 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:33:03,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-25 15:33:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 90. [2022-11-25 15:33:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.542857142857143) internal successors, (108), 89 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:03,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-11-25 15:33:03,165 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 11 [2022-11-25 15:33:03,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:03,165 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-11-25 15:33:03,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:03,165 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-11-25 15:33:03,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 15:33:03,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:03,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:03,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:33:03,167 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:03,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:03,167 INFO L85 PathProgramCache]: Analyzing trace with hash -584701435, now seen corresponding path program 1 times [2022-11-25 15:33:03,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:03,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148479426] [2022-11-25 15:33:03,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:03,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:03,411 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 15:33:03,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:03,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148479426] [2022-11-25 15:33:03,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148479426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:03,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:03,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 15:33:03,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933347936] [2022-11-25 15:33:03,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:03,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:33:03,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:03,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:33:03,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:33:03,415 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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 15:33:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:03,667 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2022-11-25 15:33:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:33:03,667 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-25 15:33:03,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:03,668 INFO L225 Difference]: With dead ends: 134 [2022-11-25 15:33:03,668 INFO L226 Difference]: Without dead ends: 134 [2022-11-25 15:33:03,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-11-25 15:33:03,669 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 367 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:03,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 137 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 15:33:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-25 15:33:03,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2022-11-25 15:33:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.5263157894736843) internal successors, (116), 95 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-11-25 15:33:03,673 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 13 [2022-11-25 15:33:03,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:03,673 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-11-25 15:33:03,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 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 15:33:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-11-25 15:33:03,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 15:33:03,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:03,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:03,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:33:03,674 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:03,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:03,675 INFO L85 PathProgramCache]: Analyzing trace with hash 742639686, now seen corresponding path program 1 times [2022-11-25 15:33:03,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:03,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191199682] [2022-11-25 15:33:03,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:03,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:03,755 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 15:33:03,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:03,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191199682] [2022-11-25 15:33:03,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191199682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:03,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:03,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:33:03,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092086752] [2022-11-25 15:33:03,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:03,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:03,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:03,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:03,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:03,758 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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 15:33:03,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:03,799 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2022-11-25 15:33:03,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:03,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 15:33:03,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:03,800 INFO L225 Difference]: With dead ends: 95 [2022-11-25 15:33:03,800 INFO L226 Difference]: Without dead ends: 95 [2022-11-25 15:33:03,800 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 15:33:03,801 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 56 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:03,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 53 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:03,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-25 15:33:03,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-11-25 15:33:03,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.513157894736842) internal successors, (115), 94 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2022-11-25 15:33:03,804 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 15 [2022-11-25 15:33:03,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:03,805 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2022-11-25 15:33:03,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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 15:33:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2022-11-25 15:33:03,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 15:33:03,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:03,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:03,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:33:03,806 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:03,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:03,807 INFO L85 PathProgramCache]: Analyzing trace with hash 742639687, now seen corresponding path program 1 times [2022-11-25 15:33:03,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:03,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171546018] [2022-11-25 15:33:03,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:03,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:03,926 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 15:33:03,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:03,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171546018] [2022-11-25 15:33:03,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171546018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:03,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:03,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:33:03,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270700013] [2022-11-25 15:33:03,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:03,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:03,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:03,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:03,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:03,928 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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 15:33:03,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:03,965 INFO L93 Difference]: Finished difference Result 94 states and 114 transitions. [2022-11-25 15:33:03,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:03,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 15:33:03,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:03,967 INFO L225 Difference]: With dead ends: 94 [2022-11-25 15:33:03,967 INFO L226 Difference]: Without dead ends: 94 [2022-11-25 15:33:03,967 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 15:33:03,968 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 57 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:03,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 49 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:03,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-25 15:33:03,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-11-25 15:33:03,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.5) internal successors, (114), 93 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2022-11-25 15:33:03,974 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 15 [2022-11-25 15:33:03,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:03,974 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2022-11-25 15:33:03,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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 15:33:03,975 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2022-11-25 15:33:03,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 15:33:03,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:03,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:03,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:33:03,976 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:03,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:03,977 INFO L85 PathProgramCache]: Analyzing trace with hash 742637705, now seen corresponding path program 1 times [2022-11-25 15:33:03,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:03,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145045016] [2022-11-25 15:33:03,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:03,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:04,101 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 15:33:04,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:04,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145045016] [2022-11-25 15:33:04,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145045016] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:04,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:04,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:04,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783706765] [2022-11-25 15:33:04,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:04,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:33:04,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:04,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:33:04,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:33:04,104 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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 15:33:04,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:04,188 INFO L93 Difference]: Finished difference Result 105 states and 123 transitions. [2022-11-25 15:33:04,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:33:04,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 15:33:04,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:04,189 INFO L225 Difference]: With dead ends: 105 [2022-11-25 15:33:04,189 INFO L226 Difference]: Without dead ends: 105 [2022-11-25 15:33:04,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:33:04,191 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 66 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:04,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 99 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:33:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-25 15:33:04,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2022-11-25 15:33:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.4935064935064934) internal successors, (115), 93 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:04,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2022-11-25 15:33:04,195 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 15 [2022-11-25 15:33:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:04,195 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2022-11-25 15:33:04,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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 15:33:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2022-11-25 15:33:04,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 15:33:04,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:04,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:04,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:33:04,198 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:04,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:04,198 INFO L85 PathProgramCache]: Analyzing trace with hash 742637704, now seen corresponding path program 1 times [2022-11-25 15:33:04,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:04,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928835976] [2022-11-25 15:33:04,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:04,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:04,284 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 15:33:04,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:04,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928835976] [2022-11-25 15:33:04,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928835976] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:04,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:04,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:33:04,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674169275] [2022-11-25 15:33:04,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:04,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:33:04,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:04,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:33:04,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:33:04,287 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 5 states, 4 states have (on average 3.75) 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 15:33:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:04,379 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2022-11-25 15:33:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:33:04,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) 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 15 [2022-11-25 15:33:04,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:04,383 INFO L225 Difference]: With dead ends: 95 [2022-11-25 15:33:04,383 INFO L226 Difference]: Without dead ends: 95 [2022-11-25 15:33:04,384 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 15:33:04,384 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 136 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:04,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 67 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:33:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-25 15:33:04,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2022-11-25 15:33:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 91 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2022-11-25 15:33:04,391 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 15 [2022-11-25 15:33:04,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:04,392 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2022-11-25 15:33:04,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) 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 15:33:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2022-11-25 15:33:04,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 15:33:04,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:04,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:04,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 15:33:04,395 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:04,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:04,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2139895366, now seen corresponding path program 1 times [2022-11-25 15:33:04,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:04,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028382072] [2022-11-25 15:33:04,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:04,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:04,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:04,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:04,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028382072] [2022-11-25 15:33:04,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028382072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:04,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:04,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:04,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577290784] [2022-11-25 15:33:04,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:04,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:33:04,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:04,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:33:04,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:33:04,439 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 15:33:04,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:04,462 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-11-25 15:33:04,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:33:04,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 15:33:04,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:04,464 INFO L225 Difference]: With dead ends: 96 [2022-11-25 15:33:04,464 INFO L226 Difference]: Without dead ends: 96 [2022-11-25 15:33:04,465 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 15:33:04,466 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:04,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-25 15:33:04,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-11-25 15:33:04,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 95 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:04,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-11-25 15:33:04,471 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 16 [2022-11-25 15:33:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:04,471 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-11-25 15:33:04,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 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 15:33:04,472 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-11-25 15:33:04,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 15:33:04,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:04,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:04,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 15:33:04,476 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:04,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash 710264684, now seen corresponding path program 1 times [2022-11-25 15:33:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:04,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627114668] [2022-11-25 15:33:04,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:04,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:04,630 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 15:33:04,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:04,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627114668] [2022-11-25 15:33:04,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627114668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:04,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:04,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:33:04,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763142970] [2022-11-25 15:33:04,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:04,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:33:04,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:04,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:33:04,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:33:04,633 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:04,684 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2022-11-25 15:33:04,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:33:04,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 15:33:04,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:04,685 INFO L225 Difference]: With dead ends: 97 [2022-11-25 15:33:04,686 INFO L226 Difference]: Without dead ends: 97 [2022-11-25 15:33:04,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:33:04,686 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 77 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:04,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 73 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:33:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-25 15:33:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2022-11-25 15:33:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 93 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 114 transitions. [2022-11-25 15:33:04,690 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 114 transitions. Word has length 17 [2022-11-25 15:33:04,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:04,690 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 114 transitions. [2022-11-25 15:33:04,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 114 transitions. [2022-11-25 15:33:04,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 15:33:04,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:04,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:04,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 15:33:04,692 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:04,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:04,692 INFO L85 PathProgramCache]: Analyzing trace with hash 710264685, now seen corresponding path program 1 times [2022-11-25 15:33:04,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:04,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934632615] [2022-11-25 15:33:04,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:04,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:04,925 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 15:33:04,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:04,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934632615] [2022-11-25 15:33:04,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934632615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:04,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:04,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:33:04,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44266170] [2022-11-25 15:33:04,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:04,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:33:04,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:04,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:33:04,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:33:04,928 INFO L87 Difference]: Start difference. First operand 94 states and 114 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:05,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:05,065 INFO L93 Difference]: Finished difference Result 124 states and 146 transitions. [2022-11-25 15:33:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:33:05,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-25 15:33:05,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:05,067 INFO L225 Difference]: With dead ends: 124 [2022-11-25 15:33:05,067 INFO L226 Difference]: Without dead ends: 124 [2022-11-25 15:33:05,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:33:05,068 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 191 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:05,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 118 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:33:05,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-25 15:33:05,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 98. [2022-11-25 15:33:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.4) internal successors, (119), 97 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:05,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2022-11-25 15:33:05,071 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 17 [2022-11-25 15:33:05,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:05,071 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2022-11-25 15:33:05,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:05,072 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2022-11-25 15:33:05,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 15:33:05,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:05,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:05,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 15:33:05,073 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:05,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:05,073 INFO L85 PathProgramCache]: Analyzing trace with hash 602470106, now seen corresponding path program 1 times [2022-11-25 15:33:05,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:05,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598362424] [2022-11-25 15:33:05,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:05,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:05,415 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 15:33:05,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:05,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598362424] [2022-11-25 15:33:05,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598362424] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:05,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:05,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:33:05,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112629804] [2022-11-25 15:33:05,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:05,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:33:05,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:05,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:33:05,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:33:05,418 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:05,499 INFO L93 Difference]: Finished difference Result 97 states and 118 transitions. [2022-11-25 15:33:05,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:33:05,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 15:33:05,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:05,504 INFO L225 Difference]: With dead ends: 97 [2022-11-25 15:33:05,504 INFO L226 Difference]: Without dead ends: 92 [2022-11-25 15:33:05,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:33:05,505 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 50 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:05,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 181 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:33:05,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-25 15:33:05,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-11-25 15:33:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.3875) internal successors, (111), 91 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2022-11-25 15:33:05,507 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 18 [2022-11-25 15:33:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:05,508 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2022-11-25 15:33:05,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2022-11-25 15:33:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 15:33:05,508 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:05,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:05,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 15:33:05,509 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:05,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:05,510 INFO L85 PathProgramCache]: Analyzing trace with hash -851582733, now seen corresponding path program 1 times [2022-11-25 15:33:05,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:05,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088157454] [2022-11-25 15:33:05,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:05,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:05,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:33:05,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:05,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088157454] [2022-11-25 15:33:05,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088157454] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:05,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:05,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:33:05,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529396949] [2022-11-25 15:33:05,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:05,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:33:05,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:05,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:33:05,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:33:05,588 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:05,680 INFO L93 Difference]: Finished difference Result 133 states and 156 transitions. [2022-11-25 15:33:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:33:05,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-25 15:33:05,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:05,682 INFO L225 Difference]: With dead ends: 133 [2022-11-25 15:33:05,682 INFO L226 Difference]: Without dead ends: 133 [2022-11-25 15:33:05,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-25 15:33:05,683 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 75 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:05,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 228 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:33:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-25 15:33:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 98. [2022-11-25 15:33:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 97 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:05,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2022-11-25 15:33:05,686 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 18 [2022-11-25 15:33:05,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:05,687 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2022-11-25 15:33:05,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:05,687 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2022-11-25 15:33:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 15:33:05,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:05,688 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:05,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 15:33:05,688 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:05,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:05,689 INFO L85 PathProgramCache]: Analyzing trace with hash -335466066, now seen corresponding path program 1 times [2022-11-25 15:33:05,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:05,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855198066] [2022-11-25 15:33:05,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:05,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:33:05,785 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 15:33:05,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:33:05,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855198066] [2022-11-25 15:33:05,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855198066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:33:05,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:33:05,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:33:05,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63430477] [2022-11-25 15:33:05,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:33:05,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:33:05,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:33:05,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:33:05,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:33:05,787 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:33:05,860 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2022-11-25 15:33:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:33:05,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-25 15:33:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:33:05,862 INFO L225 Difference]: With dead ends: 114 [2022-11-25 15:33:05,863 INFO L226 Difference]: Without dead ends: 114 [2022-11-25 15:33:05,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:33:05,864 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:33:05,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 169 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 15:33:05,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-25 15:33:05,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2022-11-25 15:33:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 87 states have (on average 1.3793103448275863) internal successors, (120), 98 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:05,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 120 transitions. [2022-11-25 15:33:05,868 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 120 transitions. Word has length 19 [2022-11-25 15:33:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:33:05,868 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 120 transitions. [2022-11-25 15:33:05,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:33:05,869 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2022-11-25 15:33:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 15:33:05,869 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:33:05,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:05,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 15:33:05,870 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 15:33:05,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:33:05,870 INFO L85 PathProgramCache]: Analyzing trace with hash -386748143, now seen corresponding path program 1 times [2022-11-25 15:33:05,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:33:05,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572304968] [2022-11-25 15:33:05,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:33:05,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:33:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:33:05,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:33:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:33:05,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:33:05,946 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:33:05,947 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 31 remaining) [2022-11-25 15:33:05,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2022-11-25 15:33:05,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2022-11-25 15:33:05,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2022-11-25 15:33:05,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2022-11-25 15:33:05,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2022-11-25 15:33:05,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2022-11-25 15:33:05,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2022-11-25 15:33:05,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2022-11-25 15:33:05,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2022-11-25 15:33:05,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2022-11-25 15:33:05,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2022-11-25 15:33:05,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2022-11-25 15:33:05,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2022-11-25 15:33:05,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2022-11-25 15:33:05,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2022-11-25 15:33:05,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2022-11-25 15:33:05,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2022-11-25 15:33:05,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2022-11-25 15:33:05,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2022-11-25 15:33:05,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2022-11-25 15:33:05,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2022-11-25 15:33:05,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2022-11-25 15:33:05,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2022-11-25 15:33:05,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2022-11-25 15:33:05,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2022-11-25 15:33:05,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2022-11-25 15:33:05,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2022-11-25 15:33:05,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2022-11-25 15:33:05,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2022-11-25 15:33:05,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (0 of 31 remaining) [2022-11-25 15:33:05,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 15:33:05,960 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:33:05,965 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:33:06,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:33:06 BoogieIcfgContainer [2022-11-25 15:33:06,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:33:06,002 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:33:06,002 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:33:06,002 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:33:06,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:32:59" (3/4) ... [2022-11-25 15:33:06,005 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 15:33:06,062 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:33:06,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:33:06,063 INFO L158 Benchmark]: Toolchain (without parser) took 7669.69ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 137.8MB in the beginning and 203.3MB in the end (delta: -65.5MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2022-11-25 15:33:06,064 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 130.0MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:33:06,064 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.48ms. Allocated memory is still 169.9MB. Free memory was 137.8MB in the beginning and 129.0MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-25 15:33:06,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.34ms. Allocated memory is still 169.9MB. Free memory was 129.0MB in the beginning and 126.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:33:06,065 INFO L158 Benchmark]: Boogie Preprocessor took 49.47ms. Allocated memory is still 169.9MB. Free memory was 126.9MB in the beginning and 124.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:33:06,065 INFO L158 Benchmark]: RCFGBuilder took 760.45ms. Allocated memory is still 169.9MB. Free memory was 124.8MB in the beginning and 103.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-25 15:33:06,065 INFO L158 Benchmark]: TraceAbstraction took 6209.16ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 103.8MB in the beginning and 207.5MB in the end (delta: -103.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:33:06,066 INFO L158 Benchmark]: Witness Printer took 60.94ms. Allocated memory is still 247.5MB. Free memory was 207.5MB in the beginning and 203.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 15:33:06,068 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 130.0MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.48ms. Allocated memory is still 169.9MB. Free memory was 137.8MB in the beginning and 129.0MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.34ms. Allocated memory is still 169.9MB. Free memory was 129.0MB in the beginning and 126.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.47ms. Allocated memory is still 169.9MB. Free memory was 126.9MB in the beginning and 124.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 760.45ms. Allocated memory is still 169.9MB. Free memory was 124.8MB in the beginning and 103.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6209.16ms. Allocated memory was 169.9MB in the beginning and 247.5MB in the end (delta: 77.6MB). Free memory was 103.8MB in the beginning and 207.5MB in the end (delta: -103.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 60.94ms. Allocated memory is still 247.5MB. Free memory was 207.5MB in the beginning and 203.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L543] int in_len = __VERIFIER_nondet_int(); [L544] COND FALSE !(in_len < 1) [L545] char* in = __builtin_alloca (in_len); VAL [__builtin_alloca (in_len)={3:0}, in={3:0}, in_len=8] [L546] in[in_len-1]=0 VAL [__builtin_alloca (in_len)={3:0}, in={3:0}, in_len=8] [L547] int delim_len = __VERIFIER_nondet_int(); [L548] COND FALSE !(delim_len < 1) [L549] char* delim = __builtin_alloca (delim_len); [L550] char* ptr = 0; [L551] CALL strtok_r(in, delim, &ptr) [L531] char*tmp=0; VAL [delim={4:0}, delim={4:0}, ptrptr={2:0}, ptrptr={2:0}, s={3:0}, s={3:0}, tmp={0:0}] [L532] COND FALSE !(s==0) VAL [delim={4:0}, delim={4:0}, ptrptr={2:0}, ptrptr={2:0}, s={3:0}, s={3:0}, tmp={0:0}] [L533] CALL strspn(s,delim) [L508] size_t l = 0; [L509] const char *a; VAL [accept={4:0}, accept={4:0}, l=0, s={3:0}, s={3:0}] [L510] EXPR \read(*s) VAL [\read(*s)=12, accept={4:0}, accept={4:0}, l=0, s={3:0}, s={3:0}] [L510] COND TRUE *s [L511] a = accept VAL [a={4:0}, accept={4:0}, accept={4:0}, l=0, s={3:0}, s={3:0}] [L511] EXPR \read(*a) VAL [\read(*a)=11, a={4:0}, accept={4:0}, accept={4:0}, l=0, s={3:0}, s={3:0}] [L511] *a && *s != *a VAL [*a && *s != *a=1, \read(*a)=11, a={4:0}, accept={4:0}, accept={4:0}, l=0, s={3:0}, s={3:0}] [L511] EXPR \read(*s) VAL [*a && *s != *a=1, \read(*a)=11, \read(*s)=12, a={4:0}, accept={4:0}, accept={4:0}, l=0, s={3:0}, s={3:0}] [L511] EXPR \read(*a) VAL [*a && *s != *a=1, \read(*a)=11, \read(*a)=11, \read(*s)=12, a={4:0}, accept={4:0}, accept={4:0}, l=0, s={3:0}, s={3:0}] [L511] *a && *s != *a VAL [*a && *s != *a=1, \read(*a)=11, \read(*a)=11, \read(*s)=12, a={4:0}, accept={4:0}, accept={4:0}, l=0, s={3:0}, s={3:0}] [L511] COND TRUE *a && *s != *a [L511] a++ VAL [a={4:1}, accept={4:0}, accept={4:0}, l=0, s={3:0}, s={3:0}] [L511] \read(*a) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 542]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 80 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2481 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2481 mSDsluCounter, 2234 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1074 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1206 IncrementalHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 1160 mSDtfsCounter, 1206 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=20, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 265 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 1147 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 15:33:06,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7a77360-8857-44fb-9c76-6cd1fe1a1b00/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)