./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-15/cstrncat_reverse_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-15/cstrncat_reverse_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8 --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 bccafd118bd3a0a83ff8db4cf42e66a78381136beaa46d7482d6d8b6c55b738f --- 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-2329fc7 [2022-12-13 20:32:36,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:32:36,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:32:36,433 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:32:36,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:32:36,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:32:36,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:32:36,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:32:36,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:32:36,440 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:32:36,441 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:32:36,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:32:36,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:32:36,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:32:36,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:32:36,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:32:36,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:32:36,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:32:36,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:32:36,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:32:36,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:32:36,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:32:36,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:32:36,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:32:36,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:32:36,459 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:32:36,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:32:36,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:32:36,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:32:36,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:32:36,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:32:36,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:32:36,463 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:32:36,464 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:32:36,465 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:32:36,465 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:32:36,466 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:32:36,466 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:32:36,466 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:32:36,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:32:36,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:32:36,469 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-12-13 20:32:36,488 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:32:36,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:32:36,488 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:32:36,488 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:32:36,489 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:32:36,489 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:32:36,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:32:36,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:32:36,490 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:32:36,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:32:36,491 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 20:32:36,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:32:36,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:32:36,491 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 20:32:36,491 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 20:32:36,492 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 20:32:36,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:32:36,492 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 20:32:36,492 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:32:36,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:32:36,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:32:36,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:32:36,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:32:36,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:32:36,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:32:36,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:32:36,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:32:36,494 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:32:36,494 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:32:36,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:32:36,494 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:32:36,495 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_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/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_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8 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 -> bccafd118bd3a0a83ff8db4cf42e66a78381136beaa46d7482d6d8b6c55b738f [2022-12-13 20:32:36,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:32:36,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:32:36,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:32:36,699 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:32:36,700 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:32:36,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/termination-15/cstrncat_reverse_alloca.i [2022-12-13 20:32:39,332 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:32:39,496 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:32:39,497 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/sv-benchmarks/c/termination-15/cstrncat_reverse_alloca.i [2022-12-13 20:32:39,503 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/data/6eea76998/0beb422c803c45eabfe34a60e8ca8c4a/FLAG5c8ce1be0 [2022-12-13 20:32:39,515 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/data/6eea76998/0beb422c803c45eabfe34a60e8ca8c4a [2022-12-13 20:32:39,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:32:39,519 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:32:39,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:32:39,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:32:39,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:32:39,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:32:39" (1/1) ... [2022-12-13 20:32:39,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26cb38e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:39, skipping insertion in model container [2022-12-13 20:32:39,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:32:39" (1/1) ... [2022-12-13 20:32:39,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:32:39,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:32:39,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:32:39,834 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:32:39,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:32:39,895 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:32:39,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:39 WrapperNode [2022-12-13 20:32:39,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:32:39,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:32:39,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:32:39,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:32:39,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:39" (1/1) ... [2022-12-13 20:32:39,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:39" (1/1) ... [2022-12-13 20:32:39,934 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2022-12-13 20:32:39,934 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:32:39,935 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:32:39,935 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:32:39,935 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:32:39,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:39" (1/1) ... [2022-12-13 20:32:39,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:39" (1/1) ... [2022-12-13 20:32:39,946 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:39" (1/1) ... [2022-12-13 20:32:39,946 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:39" (1/1) ... [2022-12-13 20:32:39,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:39" (1/1) ... [2022-12-13 20:32:39,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:39" (1/1) ... [2022-12-13 20:32:39,955 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:39" (1/1) ... [2022-12-13 20:32:39,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:39" (1/1) ... [2022-12-13 20:32:39,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:32:39,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:32:39,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:32:39,959 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:32:39,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:39" (1/1) ... [2022-12-13 20:32:39,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:32:39,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:32:39,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:32:39,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:32:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 20:32:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 20:32:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 20:32:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 20:32:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:32:40,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:32:40,094 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:32:40,096 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:32:40,284 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:32:40,289 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:32:40,289 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 20:32:40,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:32:40 BoogieIcfgContainer [2022-12-13 20:32:40,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:32:40,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:32:40,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:32:40,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:32:40,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:32:39" (1/3) ... [2022-12-13 20:32:40,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f992c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:32:40, skipping insertion in model container [2022-12-13 20:32:40,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:32:39" (2/3) ... [2022-12-13 20:32:40,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f992c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:32:40, skipping insertion in model container [2022-12-13 20:32:40,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:32:40" (3/3) ... [2022-12-13 20:32:40,298 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncat_reverse_alloca.i [2022-12-13 20:32:40,312 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:32:40,312 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-12-13 20:32:40,346 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:32:40,351 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;@50379dd5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:32:40,351 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-12-13 20:32:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:40,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 20:32:40,359 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:40,360 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:40,360 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:40,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1805031082, now seen corresponding path program 1 times [2022-12-13 20:32:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:40,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814893304] [2022-12-13 20:32:40,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:40,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:40,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:40,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814893304] [2022-12-13 20:32:40,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814893304] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:40,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:40,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:32:40,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785236108] [2022-12-13 20:32:40,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:40,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:32:40,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:40,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:32:40,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:32:40,523 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 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 3.5) internal successors, (7), 3 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-12-13 20:32:40,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:40,570 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-12-13 20:32:40,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:32:40,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12-13 20:32:40,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:40,584 INFO L225 Difference]: With dead ends: 41 [2022-12-13 20:32:40,585 INFO L226 Difference]: Without dead ends: 38 [2022-12-13 20:32:40,586 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-12-13 20:32:40,588 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:40,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 64 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:32:40,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-13 20:32:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-12-13 20:32:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-12-13 20:32:40,615 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 7 [2022-12-13 20:32:40,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:40,615 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-12-13 20:32:40,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12-13 20:32:40,616 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-12-13 20:32:40,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 20:32:40,616 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:40,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:40,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:32:40,616 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:40,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:40,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1805031082, now seen corresponding path program 1 times [2022-12-13 20:32:40,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:40,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871365988] [2022-12-13 20:32:40,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:40,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:40,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:40,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:40,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871365988] [2022-12-13 20:32:40,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871365988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:40,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:40,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:32:40,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84565488] [2022-12-13 20:32:40,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:40,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:32:40,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:40,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:32:40,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:32:40,694 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-12-13 20:32:40,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:40,740 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-12-13 20:32:40,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:32:40,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-12-13 20:32:40,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:40,742 INFO L225 Difference]: With dead ends: 41 [2022-12-13 20:32:40,742 INFO L226 Difference]: Without dead ends: 38 [2022-12-13 20:32:40,742 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-12-13 20:32:40,743 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:40,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 155 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:32:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-13 20:32:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-12-13 20:32:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-12-13 20:32:40,747 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 7 [2022-12-13 20:32:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:40,747 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-12-13 20:32:40,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 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-12-13 20:32:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-12-13 20:32:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 20:32:40,748 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:40,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:40,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:32:40,749 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:40,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:40,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1806878124, now seen corresponding path program 1 times [2022-12-13 20:32:40,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:40,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171853729] [2022-12-13 20:32:40,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:40,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:40,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:40,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:40,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171853729] [2022-12-13 20:32:40,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171853729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:40,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:40,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:32:40,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721836519] [2022-12-13 20:32:40,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:40,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:32:40,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:40,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:32:40,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:32:40,847 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12-13 20:32:40,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:40,875 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-12-13 20:32:40,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:32:40,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12-13 20:32:40,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:40,876 INFO L225 Difference]: With dead ends: 37 [2022-12-13 20:32:40,876 INFO L226 Difference]: Without dead ends: 37 [2022-12-13 20:32:40,877 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-12-13 20:32:40,878 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 31 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:40,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 31 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:32:40,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-12-13 20:32:40,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-12-13 20:32:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.826086956521739) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-12-13 20:32:40,883 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 7 [2022-12-13 20:32:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:40,883 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-12-13 20:32:40,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-12-13 20:32:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-12-13 20:32:40,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 20:32:40,884 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:40,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:40,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:32:40,885 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:40,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:40,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1806878125, now seen corresponding path program 1 times [2022-12-13 20:32:40,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:40,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894210850] [2022-12-13 20:32:40,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:40,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:41,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:41,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:41,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894210850] [2022-12-13 20:32:41,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894210850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:41,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:41,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:32:41,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348797597] [2022-12-13 20:32:41,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:41,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:32:41,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:41,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:32:41,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:32:41,107 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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-12-13 20:32:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:41,164 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-12-13 20:32:41,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:32:41,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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-12-13 20:32:41,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:41,165 INFO L225 Difference]: With dead ends: 36 [2022-12-13 20:32:41,165 INFO L226 Difference]: Without dead ends: 36 [2022-12-13 20:32:41,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:32:41,167 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 110 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:41,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 59 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:32:41,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-12-13 20:32:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-12-13 20:32:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:41,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-12-13 20:32:41,171 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 7 [2022-12-13 20:32:41,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:41,172 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-12-13 20:32:41,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 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-12-13 20:32:41,172 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-12-13 20:32:41,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-13 20:32:41,172 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:41,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:41,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:32:41,173 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:41,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:41,173 INFO L85 PathProgramCache]: Analyzing trace with hash 178646995, now seen corresponding path program 1 times [2022-12-13 20:32:41,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:41,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510483000] [2022-12-13 20:32:41,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:41,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:41,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:41,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510483000] [2022-12-13 20:32:41,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510483000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:41,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:41,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 20:32:41,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177034325] [2022-12-13 20:32:41,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:41,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:32:41,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:41,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:32:41,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:32:41,219 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-12-13 20:32:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:41,239 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-12-13 20:32:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:32:41,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-12-13 20:32:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:41,240 INFO L225 Difference]: With dead ends: 35 [2022-12-13 20:32:41,240 INFO L226 Difference]: Without dead ends: 35 [2022-12-13 20:32:41,241 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-12-13 20:32:41,242 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:41,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 30 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:32:41,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-12-13 20:32:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-12-13 20:32:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-12-13 20:32:41,245 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 8 [2022-12-13 20:32:41,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:41,246 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-12-13 20:32:41,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-12-13 20:32:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-12-13 20:32:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-13 20:32:41,247 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:41,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:41,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:32:41,247 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:41,248 INFO L85 PathProgramCache]: Analyzing trace with hash 178646996, now seen corresponding path program 1 times [2022-12-13 20:32:41,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:41,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636484045] [2022-12-13 20:32:41,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:41,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:41,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:41,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636484045] [2022-12-13 20:32:41,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636484045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:41,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:41,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:32:41,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825711693] [2022-12-13 20:32:41,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:41,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:32:41,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:41,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:32:41,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:32:41,341 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) 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-12-13 20:32:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:41,380 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2022-12-13 20:32:41,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:32:41,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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-12-13 20:32:41,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:41,381 INFO L225 Difference]: With dead ends: 65 [2022-12-13 20:32:41,381 INFO L226 Difference]: Without dead ends: 65 [2022-12-13 20:32:41,381 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-12-13 20:32:41,382 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 34 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:41,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 95 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:32:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-12-13 20:32:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2022-12-13 20:32:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:41,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-12-13 20:32:41,387 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 8 [2022-12-13 20:32:41,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:41,387 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-12-13 20:32:41,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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-12-13 20:32:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-12-13 20:32:41,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-13 20:32:41,388 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:41,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:41,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 20:32:41,388 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:41,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:41,389 INFO L85 PathProgramCache]: Analyzing trace with hash 180494038, now seen corresponding path program 1 times [2022-12-13 20:32:41,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:41,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496678248] [2022-12-13 20:32:41,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:41,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:41,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:41,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496678248] [2022-12-13 20:32:41,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496678248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:41,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:41,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:32:41,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514315331] [2022-12-13 20:32:41,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:41,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:32:41,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:41,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:32:41,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:32:41,475 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-12-13 20:32:41,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:41,507 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-12-13 20:32:41,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:32:41,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-12-13 20:32:41,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:41,508 INFO L225 Difference]: With dead ends: 38 [2022-12-13 20:32:41,509 INFO L226 Difference]: Without dead ends: 38 [2022-12-13 20:32:41,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:32:41,509 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 34 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:41,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:32:41,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-13 20:32:41,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2022-12-13 20:32:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-12-13 20:32:41,513 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 8 [2022-12-13 20:32:41,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:41,513 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-12-13 20:32:41,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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-12-13 20:32:41,513 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-12-13 20:32:41,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 20:32:41,514 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:41,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:41,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:32:41,514 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:41,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash -118929576, now seen corresponding path program 1 times [2022-12-13 20:32:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:41,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988784009] [2022-12-13 20:32:41,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:41,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:41,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:41,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988784009] [2022-12-13 20:32:41,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988784009] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:41,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:41,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:32:41,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617263558] [2022-12-13 20:32:41,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:41,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 20:32:41,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:41,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 20:32:41,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 20:32:41,555 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:41,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:41,587 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-12-13 20:32:41,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:32:41,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-13 20:32:41,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:41,587 INFO L225 Difference]: With dead ends: 30 [2022-12-13 20:32:41,587 INFO L226 Difference]: Without dead ends: 30 [2022-12-13 20:32:41,587 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-12-13 20:32:41,588 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 42 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:41,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 29 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:32:41,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-12-13 20:32:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-12-13 20:32:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-12-13 20:32:41,591 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2022-12-13 20:32:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:41,591 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-12-13 20:32:41,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-12-13 20:32:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 20:32:41,592 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:41,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:41,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:32:41,592 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:41,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:41,593 INFO L85 PathProgramCache]: Analyzing trace with hash -118929575, now seen corresponding path program 1 times [2022-12-13 20:32:41,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:41,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560656571] [2022-12-13 20:32:41,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:41,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:41,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:41,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560656571] [2022-12-13 20:32:41,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560656571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:41,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:41,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:32:41,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870537782] [2022-12-13 20:32:41,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:41,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:32:41,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:41,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:32:41,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:32:41,870 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:41,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:41,950 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-12-13 20:32:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:32:41,950 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-13 20:32:41,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:41,950 INFO L225 Difference]: With dead ends: 47 [2022-12-13 20:32:41,950 INFO L226 Difference]: Without dead ends: 47 [2022-12-13 20:32:41,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-12-13 20:32:41,951 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 67 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:41,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 57 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:32:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-12-13 20:32:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-12-13 20:32:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2022-12-13 20:32:41,955 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 10 [2022-12-13 20:32:41,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:41,955 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2022-12-13 20:32:41,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2022-12-13 20:32:41,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-13 20:32:41,956 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:41,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:41,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 20:32:41,956 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:41,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:41,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1672794898, now seen corresponding path program 1 times [2022-12-13 20:32:41,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:41,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691810131] [2022-12-13 20:32:41,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:41,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:42,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:42,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691810131] [2022-12-13 20:32:42,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691810131] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:32:42,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428742466] [2022-12-13 20:32:42,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:42,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:32:42,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:32:42,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:32:42,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 20:32:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:42,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 20:32:42,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:32:42,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:32:42,375 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 20:32:42,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-13 20:32:42,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:32:42,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 20:32:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:42,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:32:42,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-12-13 20:32:42,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 20:32:42,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-13 20:32:42,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:42,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428742466] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:32:42,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:32:42,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 18 [2022-12-13 20:32:42,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360103747] [2022-12-13 20:32:42,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:32:42,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 20:32:42,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:42,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 20:32:42,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-12-13 20:32:42,688 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:43,439 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2022-12-13 20:32:43,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 20:32:43,439 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-13 20:32:43,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:43,441 INFO L225 Difference]: With dead ends: 114 [2022-12-13 20:32:43,441 INFO L226 Difference]: Without dead ends: 114 [2022-12-13 20:32:43,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2022-12-13 20:32:43,441 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 252 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:43,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 351 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 20:32:43,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-13 20:32:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 34. [2022-12-13 20:32:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 33 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-12-13 20:32:43,444 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 12 [2022-12-13 20:32:43,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:43,444 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-12-13 20:32:43,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-12-13 20:32:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 20:32:43,445 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:43,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:43,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 20:32:43,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 20:32:43,646 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:43,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:43,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1238081954, now seen corresponding path program 1 times [2022-12-13 20:32:43,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:43,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705721333] [2022-12-13 20:32:43,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:43,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:43,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:43,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705721333] [2022-12-13 20:32:43,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705721333] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:43,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:43,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:32:43,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858457988] [2022-12-13 20:32:43,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:43,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:32:43,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:43,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:32:43,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:32:43,796 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:43,837 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-12-13 20:32:43,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:32:43,838 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-12-13 20:32:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:43,838 INFO L225 Difference]: With dead ends: 34 [2022-12-13 20:32:43,838 INFO L226 Difference]: Without dead ends: 34 [2022-12-13 20:32:43,838 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-12-13 20:32:43,839 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 40 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:43,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 46 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:32:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-13 20:32:43,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-12-13 20:32:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 32 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:43,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-12-13 20:32:43,841 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 14 [2022-12-13 20:32:43,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:43,842 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-12-13 20:32:43,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:43,842 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-12-13 20:32:43,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 20:32:43,842 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:43,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:43,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 20:32:43,843 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:43,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:43,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1238081955, now seen corresponding path program 1 times [2022-12-13 20:32:43,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:43,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914648868] [2022-12-13 20:32:43,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:43,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:43,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:43,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914648868] [2022-12-13 20:32:43,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914648868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:43,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:43,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 20:32:43,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843433003] [2022-12-13 20:32:43,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:43,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 20:32:43,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:43,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 20:32:43,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 20:32:43,984 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:44,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:44,077 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2022-12-13 20:32:44,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:32:44,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-12-13 20:32:44,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:44,078 INFO L225 Difference]: With dead ends: 77 [2022-12-13 20:32:44,078 INFO L226 Difference]: Without dead ends: 77 [2022-12-13 20:32:44,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:32:44,079 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 58 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:44,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 131 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:32:44,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-12-13 20:32:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 48. [2022-12-13 20:32:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.4090909090909092) internal successors, (62), 47 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-12-13 20:32:44,082 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 14 [2022-12-13 20:32:44,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:44,082 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2022-12-13 20:32:44,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2022-12-13 20:32:44,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 20:32:44,082 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:44,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:44,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 20:32:44,083 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:44,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:44,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1939146533, now seen corresponding path program 1 times [2022-12-13 20:32:44,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:44,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162900828] [2022-12-13 20:32:44,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:44,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:44,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:44,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162900828] [2022-12-13 20:32:44,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162900828] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:44,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:44,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 20:32:44,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409040446] [2022-12-13 20:32:44,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:44,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 20:32:44,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:44,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 20:32:44,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:32:44,259 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:44,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:44,326 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2022-12-13 20:32:44,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:32:44,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-12-13 20:32:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:44,327 INFO L225 Difference]: With dead ends: 62 [2022-12-13 20:32:44,327 INFO L226 Difference]: Without dead ends: 62 [2022-12-13 20:32:44,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 20:32:44,328 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 95 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:44,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 87 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:32:44,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-13 20:32:44,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 38. [2022-12-13 20:32:44,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.411764705882353) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:44,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-12-13 20:32:44,331 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 14 [2022-12-13 20:32:44,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:44,331 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-12-13 20:32:44,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-12-13 20:32:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 20:32:44,332 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:44,332 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:44,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 20:32:44,332 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:44,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1646841934, now seen corresponding path program 1 times [2022-12-13 20:32:44,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:44,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335504882] [2022-12-13 20:32:44,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:44,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:44,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:44,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:44,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335504882] [2022-12-13 20:32:44,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335504882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:44,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:44,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:32:44,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815737081] [2022-12-13 20:32:44,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:44,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:32:44,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:44,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:32:44,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:32:44,358 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-12-13 20:32:44,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:44,364 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-12-13 20:32:44,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:32:44,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-12-13 20:32:44,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:44,365 INFO L225 Difference]: With dead ends: 34 [2022-12-13 20:32:44,365 INFO L226 Difference]: Without dead ends: 34 [2022-12-13 20:32:44,365 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-12-13 20:32:44,366 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 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-12-13 20:32:44,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:32:44,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-12-13 20:32:44,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-12-13 20:32:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-12-13 20:32:44,368 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 18 [2022-12-13 20:32:44,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:44,368 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-12-13 20:32:44,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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-12-13 20:32:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-12-13 20:32:44,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 20:32:44,369 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:44,369 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-12-13 20:32:44,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 20:32:44,369 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:44,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:44,370 INFO L85 PathProgramCache]: Analyzing trace with hash -523554743, now seen corresponding path program 1 times [2022-12-13 20:32:44,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:44,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25065179] [2022-12-13 20:32:44,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:44,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:44,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:44,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25065179] [2022-12-13 20:32:44,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25065179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:44,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:44,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:32:44,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723695344] [2022-12-13 20:32:44,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:44,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:32:44,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:44,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:32:44,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:32:44,426 INFO L87 Difference]: Start difference. First operand 34 states and 40 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-12-13 20:32:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:44,448 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-12-13 20:32:44,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 20:32:44,448 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-12-13 20:32:44,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:44,448 INFO L225 Difference]: With dead ends: 42 [2022-12-13 20:32:44,449 INFO L226 Difference]: Without dead ends: 42 [2022-12-13 20:32:44,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 20:32:44,449 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 57 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:44,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 76 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:32:44,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-12-13 20:32:44,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2022-12-13 20:32:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-12-13 20:32:44,451 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 19 [2022-12-13 20:32:44,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:44,451 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-12-13 20:32:44,452 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-12-13 20:32:44,452 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-12-13 20:32:44,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 20:32:44,452 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:44,452 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:44,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 20:32:44,452 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:44,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:44,453 INFO L85 PathProgramCache]: Analyzing trace with hash -66128267, now seen corresponding path program 1 times [2022-12-13 20:32:44,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:44,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734124258] [2022-12-13 20:32:44,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:44,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:44,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:44,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734124258] [2022-12-13 20:32:44,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734124258] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:32:44,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995686266] [2022-12-13 20:32:44,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:44,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:32:44,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:32:44,547 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:32:44,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 20:32:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:44,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 20:32:44,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:32:44,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:44,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:32:44,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:44,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995686266] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:32:44,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:32:44,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2022-12-13 20:32:44,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571078543] [2022-12-13 20:32:44,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:32:44,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 20:32:44,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:44,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 20:32:44,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 20:32:44,689 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:44,729 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-12-13 20:32:44,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 20:32:44,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 20:32:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:44,730 INFO L225 Difference]: With dead ends: 63 [2022-12-13 20:32:44,730 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 20:32:44,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:32:44,731 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 50 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:44,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 154 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:32:44,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 20:32:44,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 47. [2022-12-13 20:32:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.255813953488372) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2022-12-13 20:32:44,733 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2022-12-13 20:32:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:44,734 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2022-12-13 20:32:44,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-12-13 20:32:44,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 20:32:44,734 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:44,734 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:44,744 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 20:32:44,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 20:32:44,935 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:44,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1087196621, now seen corresponding path program 1 times [2022-12-13 20:32:44,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:44,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703991183] [2022-12-13 20:32:44,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:44,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:45,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:45,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703991183] [2022-12-13 20:32:45,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703991183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:45,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:45,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 20:32:45,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887446861] [2022-12-13 20:32:45,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:45,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 20:32:45,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:45,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 20:32:45,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 20:32:45,125 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:45,216 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2022-12-13 20:32:45,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 20:32:45,216 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 20:32:45,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:45,216 INFO L225 Difference]: With dead ends: 79 [2022-12-13 20:32:45,217 INFO L226 Difference]: Without dead ends: 79 [2022-12-13 20:32:45,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-12-13 20:32:45,217 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:45,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 137 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:32:45,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-13 20:32:45,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2022-12-13 20:32:45,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:45,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-12-13 20:32:45,219 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 20 [2022-12-13 20:32:45,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:45,219 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-12-13 20:32:45,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-12-13 20:32:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 20:32:45,220 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:45,220 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:45,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 20:32:45,220 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:45,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1619422773, now seen corresponding path program 1 times [2022-12-13 20:32:45,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:45,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390141601] [2022-12-13 20:32:45,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:45,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:45,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:45,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:45,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390141601] [2022-12-13 20:32:45,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390141601] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:32:45,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078254969] [2022-12-13 20:32:45,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:45,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:32:45,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:32:45,434 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:32:45,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 20:32:45,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:45,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 20:32:45,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:32:45,514 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 20:32:45,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-13 20:32:45,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:32:45,639 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:32:45,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-12-13 20:32:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:45,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:32:45,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2022-12-13 20:32:45,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2022-12-13 20:32:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:46,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078254969] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:32:46,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:32:46,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 23 [2022-12-13 20:32:46,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798318004] [2022-12-13 20:32:46,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:32:46,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-13 20:32:46,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:46,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 20:32:46,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2022-12-13 20:32:46,028 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:46,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:46,484 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2022-12-13 20:32:46,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 20:32:46,484 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-13 20:32:46,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:46,485 INFO L225 Difference]: With dead ends: 78 [2022-12-13 20:32:46,485 INFO L226 Difference]: Without dead ends: 78 [2022-12-13 20:32:46,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2022-12-13 20:32:46,486 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 120 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:46,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 315 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 20:32:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-13 20:32:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2022-12-13 20:32:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 64 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-12-13 20:32:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-12-13 20:32:46,489 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 20 [2022-12-13 20:32:46,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:46,489 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-12-13 20:32:46,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.130434782608696) internal successors, (49), 24 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-12-13 20:32:46,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 20:32:46,490 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:46,490 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:46,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 20:32:46,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 20:32:46,691 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:46,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:46,692 INFO L85 PathProgramCache]: Analyzing trace with hash 250855347, now seen corresponding path program 1 times [2022-12-13 20:32:46,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:46,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108868610] [2022-12-13 20:32:46,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:46,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:46,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:46,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108868610] [2022-12-13 20:32:46,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108868610] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:32:46,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59970923] [2022-12-13 20:32:46,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:46,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:32:46,944 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:32:46,945 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:32:46,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 20:32:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:47,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 20:32:47,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:32:47,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 20:32:47,185 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 20:32:47,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 20:32:47,282 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:47,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:32:47,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-12-13 20:32:47,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-13 20:32:47,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-13 20:32:47,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:47,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59970923] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:32:47,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:32:47,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2022-12-13 20:32:47,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895001839] [2022-12-13 20:32:47,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:32:47,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 20:32:47,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:47,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 20:32:47,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2022-12-13 20:32:47,637 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:48,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:48,702 INFO L93 Difference]: Finished difference Result 119 states and 137 transitions. [2022-12-13 20:32:48,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 20:32:48,703 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-13 20:32:48,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:48,703 INFO L225 Difference]: With dead ends: 119 [2022-12-13 20:32:48,704 INFO L226 Difference]: Without dead ends: 119 [2022-12-13 20:32:48,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=272, Invalid=1288, Unknown=0, NotChecked=0, Total=1560 [2022-12-13 20:32:48,705 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 190 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:48,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 387 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 20:32:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-12-13 20:32:48,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 87. [2022-12-13 20:32:48,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 86 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2022-12-13 20:32:48,708 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 21 [2022-12-13 20:32:48,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:48,708 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2022-12-13 20:32:48,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 27 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-12-13 20:32:48,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 20:32:48,709 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:48,709 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:48,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 20:32:48,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:32:48,911 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:48,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:48,912 INFO L85 PathProgramCache]: Analyzing trace with hash 839197646, now seen corresponding path program 1 times [2022-12-13 20:32:48,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:48,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842743611] [2022-12-13 20:32:48,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:48,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:32:49,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:32:49,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:32:49,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842743611] [2022-12-13 20:32:49,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842743611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:32:49,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:32:49,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 20:32:49,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607062005] [2022-12-13 20:32:49,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:32:49,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:32:49,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:32:49,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:32:49,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:32:49,056 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:49,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:32:49,073 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2022-12-13 20:32:49,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 20:32:49,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 20:32:49,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:32:49,074 INFO L225 Difference]: With dead ends: 86 [2022-12-13 20:32:49,074 INFO L226 Difference]: Without dead ends: 59 [2022-12-13 20:32:49,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:32:49,075 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:32:49,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 42 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:32:49,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-12-13 20:32:49,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-12-13 20:32:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-12-13 20:32:49,078 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 22 [2022-12-13 20:32:49,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:32:49,078 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-12-13 20:32:49,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:32:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-12-13 20:32:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 20:32:49,078 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:32:49,079 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:32:49,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 20:32:49,079 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-13 20:32:49,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:32:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash -778846502, now seen corresponding path program 1 times [2022-12-13 20:32:49,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:32:49,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923228259] [2022-12-13 20:32:49,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:32:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:32:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:32:49,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 20:32:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 20:32:49,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 20:32:49,120 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 20:32:49,121 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2022-12-13 20:32:49,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2022-12-13 20:32:49,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2022-12-13 20:32:49,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2022-12-13 20:32:49,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2022-12-13 20:32:49,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2022-12-13 20:32:49,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2022-12-13 20:32:49,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2022-12-13 20:32:49,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2022-12-13 20:32:49,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2022-12-13 20:32:49,123 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2022-12-13 20:32:49,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2022-12-13 20:32:49,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2022-12-13 20:32:49,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2022-12-13 20:32:49,124 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2022-12-13 20:32:49,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 20:32:49,126 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-12-13 20:32:49,130 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 20:32:49,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:32:49 BoogieIcfgContainer [2022-12-13 20:32:49,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 20:32:49,159 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:32:49,159 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:32:49,160 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:32:49,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:32:40" (3/4) ... [2022-12-13 20:32:49,162 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 20:32:49,194 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 20:32:49,195 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:32:49,195 INFO L158 Benchmark]: Toolchain (without parser) took 9676.62ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 113.1MB in the beginning and 95.2MB in the end (delta: 17.9MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2022-12-13 20:32:49,195 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 151.0MB. Free memory is still 94.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:32:49,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.38ms. Allocated memory is still 151.0MB. Free memory was 112.8MB in the beginning and 95.3MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 20:32:49,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.32ms. Allocated memory is still 151.0MB. Free memory was 95.3MB in the beginning and 93.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:32:49,196 INFO L158 Benchmark]: Boogie Preprocessor took 23.72ms. Allocated memory is still 151.0MB. Free memory was 93.1MB in the beginning and 91.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:32:49,197 INFO L158 Benchmark]: RCFGBuilder took 331.80ms. Allocated memory is still 151.0MB. Free memory was 91.6MB in the beginning and 77.6MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 20:32:49,197 INFO L158 Benchmark]: TraceAbstraction took 8866.27ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 77.0MB in the beginning and 98.3MB in the end (delta: -21.4MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2022-12-13 20:32:49,197 INFO L158 Benchmark]: Witness Printer took 35.22ms. Allocated memory is still 182.5MB. Free memory was 98.3MB in the beginning and 95.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:32:49,199 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.13ms. Allocated memory is still 151.0MB. Free memory is still 94.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.38ms. Allocated memory is still 151.0MB. Free memory was 112.8MB in the beginning and 95.3MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.32ms. Allocated memory is still 151.0MB. Free memory was 95.3MB in the beginning and 93.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.72ms. Allocated memory is still 151.0MB. Free memory was 93.1MB in the beginning and 91.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 331.80ms. Allocated memory is still 151.0MB. Free memory was 91.6MB in the beginning and 77.6MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8866.27ms. Allocated memory was 151.0MB in the beginning and 182.5MB in the end (delta: 31.5MB). Free memory was 77.0MB in the beginning and 98.3MB in the end (delta: -21.4MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Witness Printer took 35.22ms. Allocated memory is still 182.5MB. Free memory was 98.3MB in the beginning and 95.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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: [L378] int length1 = __VERIFIER_nondet_int(); [L379] int length2 = __VERIFIER_nondet_int(); [L380] int n = __VERIFIER_nondet_int(); [L381] COND FALSE !(length1 < 1) VAL [length1=3, length2=2, n=0] [L384] COND FALSE !(length2 < 1) VAL [length1=3, length2=2, n=0] [L387] COND TRUE n < 1 [L388] n = 1 VAL [length1=3, length2=2, n=1] [L390] COND FALSE !(length1 < n || length1 - n < length2) [L391] char* nondetString1 = (char*) __builtin_alloca(length1 * sizeof(char)); [L392] char* nondetString2 = (char*) __builtin_alloca(length2 * sizeof(char)); VAL [__builtin_alloca(length1 * sizeof(char))={6:0}, __builtin_alloca(length2 * sizeof(char))={4:0}, length1=3, length2=2, n=1, nondetString1={6:0}, nondetString2={4:0}] [L393] nondetString1[0] = '\0' VAL [__builtin_alloca(length1 * sizeof(char))={6:0}, __builtin_alloca(length2 * sizeof(char))={4:0}, length1=3, length2=2, n=1, nondetString1={6:0}, nondetString2={4:0}] [L394] nondetString2[0] = '\0' VAL [__builtin_alloca(length1 * sizeof(char))={6:0}, __builtin_alloca(length2 * sizeof(char))={4:0}, length1=3, length2=2, n=1, nondetString1={6:0}, nondetString2={4:0}] [L395] nondetString1 += length1 - n - 1 [L396] nondetString2 += length2 - 1 [L397] CALL cstrncat(nondetString1, nondetString2, n) [L366] char *s = s1; VAL [\old(n)=1, n=1, s={6:1}, s1={6:1}, s1={6:1}, s2={4:1}, s2={4:1}] [L367] EXPR \read(*s) VAL [\old(n)=1, \read(*s)=8, n=1, s={6:1}, s1={6:1}, s1={6:1}, s2={4:1}, s2={4:1}] [L367] COND TRUE *s != '\0' [L368] s-- VAL [\old(n)=1, n=1, s={6:0}, s1={6:1}, s1={6:1}, s2={4:1}, s2={4:1}] [L367] EXPR \read(*s) VAL [\old(n)=1, \read(*s)=0, n=1, s={6:0}, s1={6:1}, s1={6:1}, s2={4:1}, s2={4:1}] [L367] COND FALSE !(*s != '\0') [L369] n != 0 && (*s = *s2--) != '\0' [L369] EXPR s2-- VAL [\old(n)=1, n=1, n != 0 && (*s = *s2--) != '\0'=1, s={6:0}, s1={6:1}, s1={6:1}, s2={4:1}, s2={4:0}, s2--=7s2--={4:1}] [L369] EXPR *s = *s2-- VAL [\old(n)=1, n=1, n != 0 && (*s = *s2--) != '\0'=1, s={6:0}, s1={6:1}, s1={6:1}, s2={4:1}, s2={4:0}, s2--={4:1}s2--=7] [L369] n != 0 && (*s = *s2--) != '\0' VAL [\old(n)=1, n=1, n != 0 && (*s = *s2--) != '\0'=1, s={6:0}, s1={6:1}, s1={6:1}, s2={4:0}, s2={4:1}, s2--=7s2--={4:1}] [L369] COND TRUE n != 0 && (*s = *s2--) != '\0' [L370] n-- [L371] s-- VAL [\old(n)=1, n=0, s={6:-1}, s1={6:1}, s1={6:1}, s2={4:0}, s2={4:1}] [L369] n != 0 && (*s = *s2--) != '\0' VAL [\old(n)=1, n=0, n != 0 && (*s = *s2--) != '\0'=0, s={6:-1}, s1={6:1}, s1={6:1}, s2={4:0}, s2={4:1}] [L369] COND FALSE !(n != 0 && (*s = *s2--) != '\0') [L373] \read(*s) - 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: 377]: 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, 40 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 21, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1268 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1268 mSDsluCounter, 2360 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1789 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1518 IncrementalHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 571 mSDtfsCounter, 1518 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 306 GetRequests, 114 SyntacticMatches, 8 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=19, InterpolantAutomatonStates: 139, 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, 259 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 362 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 384 ConstructedInterpolants, 22 QuantifiedInterpolants, 3177 SizeOfPredicates, 62 NumberOfNonLiveVariables, 572 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 28 InterpolantComputations, 16 PerfectInterpolantSequences, 8/35 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-12-13 20:32:49,211 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b397faca-c72e-473e-bc13-c6fdde7abe10/bin/uautomizer-uyxdKDjOR8/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)