./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN --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 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c --- 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-6b4ec56 [2022-11-20 10:55:14,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:55:14,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:55:14,311 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:55:14,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:55:14,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:55:14,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:55:14,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:55:14,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:55:14,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:55:14,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:55:14,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:55:14,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:55:14,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:55:14,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:55:14,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:55:14,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:55:14,365 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:55:14,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:55:14,370 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:55:14,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:55:14,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:55:14,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:55:14,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:55:14,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:55:14,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:55:14,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:55:14,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:55:14,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:55:14,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:55:14,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:55:14,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:55:14,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:55:14,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:55:14,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:55:14,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:55:14,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:55:14,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:55:14,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:55:14,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:55:14,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:55:14,417 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-11-20 10:55:14,471 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:55:14,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:55:14,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:55:14,474 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:55:14,475 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:55:14,476 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:55:14,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:55:14,477 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:55:14,477 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:55:14,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:55:14,479 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 10:55:14,479 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:55:14,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:55:14,480 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-20 10:55:14,480 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-20 10:55:14,481 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-20 10:55:14,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:55:14,481 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 10:55:14,481 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:55:14,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:55:14,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:55:14,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:55:14,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:55:14,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:55:14,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:55:14,484 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:55:14,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:55:14,484 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN/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_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN 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 -> 7d44dc9ee297680f321b2cf4dcd79f3ba6ced2470ed6439fc6dd5eb0285efc9c [2022-11-20 10:55:14,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:55:14,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:55:14,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:55:14,862 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:55:14,863 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:55:14,865 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2022-11-20 10:55:18,157 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:55:18,425 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:55:18,426 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/sv-benchmarks/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2022-11-20 10:55:18,436 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN/data/6c03a1b7c/77e57e8d4b804329bfe8ea90b4cb44b4/FLAG0399bb71f [2022-11-20 10:55:18,452 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN/data/6c03a1b7c/77e57e8d4b804329bfe8ea90b4cb44b4 [2022-11-20 10:55:18,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:55:18,456 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:55:18,458 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:55:18,458 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:55:18,462 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:55:18,463 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:55:18" (1/1) ... [2022-11-20 10:55:18,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@650b5b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:18, skipping insertion in model container [2022-11-20 10:55:18,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:55:18" (1/1) ... [2022-11-20 10:55:18,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:55:18,505 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:55:18,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:55:18,874 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:55:18,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:55:18,964 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:55:18,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:18 WrapperNode [2022-11-20 10:55:18,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:55:18,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:55:18,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:55:18,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:55:18,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:18" (1/1) ... [2022-11-20 10:55:18,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:18" (1/1) ... [2022-11-20 10:55:19,020 INFO L138 Inliner]: procedures = 111, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 11 [2022-11-20 10:55:19,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:55:19,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:55:19,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:55:19,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:55:19,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:18" (1/1) ... [2022-11-20 10:55:19,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:18" (1/1) ... [2022-11-20 10:55:19,058 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:18" (1/1) ... [2022-11-20 10:55:19,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:18" (1/1) ... [2022-11-20 10:55:19,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:18" (1/1) ... [2022-11-20 10:55:19,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:18" (1/1) ... [2022-11-20 10:55:19,081 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:18" (1/1) ... [2022-11-20 10:55:19,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:18" (1/1) ... [2022-11-20 10:55:19,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:55:19,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:55:19,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:55:19,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:55:19,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:18" (1/1) ... [2022-11-20 10:55:19,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:55:19,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:55:19,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:55:19,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:55:19,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:55:19,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:55:19,224 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-20 10:55:19,224 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-20 10:55:19,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:55:19,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:55:19,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:55:19,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:55:19,401 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:55:19,404 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:55:19,921 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:55:19,930 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:55:19,931 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 10:55:19,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:55:19 BoogieIcfgContainer [2022-11-20 10:55:19,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:55:19,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:55:19,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:55:19,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:55:19,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:55:18" (1/3) ... [2022-11-20 10:55:19,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419d3ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:55:19, skipping insertion in model container [2022-11-20 10:55:19,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:55:18" (2/3) ... [2022-11-20 10:55:19,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@419d3ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:55:19, skipping insertion in model container [2022-11-20 10:55:19,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:55:19" (3/3) ... [2022-11-20 10:55:19,946 INFO L112 eAbstractionObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig1-alloca.i [2022-11-20 10:55:19,971 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:55:19,971 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2022-11-20 10:55:20,034 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:55:20,043 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3256fde3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:55:20,043 INFO L358 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2022-11-20 10:55:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 85 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:55:20,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 10:55:20,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:20,060 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 10:55:20,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-11-20 10:55:20,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:20,068 INFO L85 PathProgramCache]: Analyzing trace with hash -62527250, now seen corresponding path program 1 times [2022-11-20 10:55:20,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:20,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117468930] [2022-11-20 10:55:20,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:20,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:21,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:21,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:21,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117468930] [2022-11-20 10:55:21,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117468930] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:21,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:21,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:55:21,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874928560] [2022-11-20 10:55:21,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:21,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:55:21,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:21,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:55:21,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:21,131 INFO L87 Difference]: Start difference. First operand has 88 states, 41 states have (on average 2.2439024390243905) internal successors, (92), 85 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:21,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:21,306 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2022-11-20 10:55:21,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:55:21,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-20 10:55:21,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:21,322 INFO L225 Difference]: With dead ends: 85 [2022-11-20 10:55:21,322 INFO L226 Difference]: Without dead ends: 83 [2022-11-20 10:55:21,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:21,329 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 76 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:21,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 55 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:55:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-20 10:55:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-20 10:55:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 40 states have (on average 2.125) internal successors, (85), 80 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:55:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-11-20 10:55:21,407 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 6 [2022-11-20 10:55:21,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:21,408 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-11-20 10:55:21,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:21,408 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-11-20 10:55:21,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-20 10:55:21,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:21,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-20 10:55:21,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:55:21,413 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-11-20 10:55:21,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:21,414 INFO L85 PathProgramCache]: Analyzing trace with hash -62527249, now seen corresponding path program 1 times [2022-11-20 10:55:21,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:21,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776899414] [2022-11-20 10:55:21,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:21,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:21,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:21,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:21,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776899414] [2022-11-20 10:55:21,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776899414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:21,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:21,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:55:21,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135179329] [2022-11-20 10:55:21,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:21,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:55:21,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:21,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:55:21,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:21,733 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:21,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:21,867 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-11-20 10:55:21,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:55:21,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-20 10:55:21,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:21,869 INFO L225 Difference]: With dead ends: 80 [2022-11-20 10:55:21,869 INFO L226 Difference]: Without dead ends: 80 [2022-11-20 10:55:21,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:21,871 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:21,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 54 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:55:21,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-20 10:55:21,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-20 10:55:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 40 states have (on average 2.05) internal successors, (82), 77 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:55:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-11-20 10:55:21,879 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 6 [2022-11-20 10:55:21,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:21,880 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-11-20 10:55:21,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-11-20 10:55:21,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:55:21,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:21,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:21,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:55:21,882 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-11-20 10:55:21,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:21,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1938344776, now seen corresponding path program 1 times [2022-11-20 10:55:21,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:21,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453034525] [2022-11-20 10:55:21,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:21,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:22,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:22,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:22,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453034525] [2022-11-20 10:55:22,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453034525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:22,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:22,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:55:22,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742357905] [2022-11-20 10:55:22,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:22,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:55:22,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:22,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:55:22,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:22,100 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:22,161 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-11-20 10:55:22,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:55:22,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 10:55:22,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:22,162 INFO L225 Difference]: With dead ends: 76 [2022-11-20 10:55:22,162 INFO L226 Difference]: Without dead ends: 76 [2022-11-20 10:55:22,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:22,164 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 68 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:22,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 48 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:55:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-20 10:55:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-20 10:55:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 40 states have (on average 1.95) internal successors, (78), 73 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:55:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2022-11-20 10:55:22,171 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 7 [2022-11-20 10:55:22,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:22,171 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2022-11-20 10:55:22,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:22,172 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2022-11-20 10:55:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-20 10:55:22,172 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:22,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:22,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 10:55:22,173 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting fErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-11-20 10:55:22,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:22,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1938344775, now seen corresponding path program 1 times [2022-11-20 10:55:22,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:22,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293304361] [2022-11-20 10:55:22,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:22,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:22,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:22,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293304361] [2022-11-20 10:55:22,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293304361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:22,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:22,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 10:55:22,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645370626] [2022-11-20 10:55:22,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:22,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 10:55:22,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:22,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 10:55:22,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 10:55:22,841 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:22,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:22,967 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-11-20 10:55:22,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:55:22,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-20 10:55:22,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:22,974 INFO L225 Difference]: With dead ends: 72 [2022-11-20 10:55:22,974 INFO L226 Difference]: Without dead ends: 72 [2022-11-20 10:55:22,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 10:55:22,982 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 135 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:22,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 57 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:55:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-20 10:55:22,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-20 10:55:22,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 40 states have (on average 1.85) internal successors, (74), 69 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:55:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2022-11-20 10:55:23,003 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 7 [2022-11-20 10:55:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:23,004 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2022-11-20 10:55:23,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-11-20 10:55:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 10:55:23,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:23,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:23,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 10:55:23,006 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting fErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-11-20 10:55:23,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:23,007 INFO L85 PathProgramCache]: Analyzing trace with hash 40854065, now seen corresponding path program 1 times [2022-11-20 10:55:23,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:23,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2224846] [2022-11-20 10:55:23,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:23,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:23,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:23,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2224846] [2022-11-20 10:55:23,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2224846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:23,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:23,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:55:23,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675512476] [2022-11-20 10:55:23,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:23,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:55:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:23,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:55:23,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:23,122 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:23,212 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2022-11-20 10:55:23,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:55:23,214 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-20 10:55:23,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:23,217 INFO L225 Difference]: With dead ends: 67 [2022-11-20 10:55:23,217 INFO L226 Difference]: Without dead ends: 67 [2022-11-20 10:55:23,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:23,222 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 58 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:23,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 43 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:55:23,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-20 10:55:23,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-20 10:55:23,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 40 states have (on average 1.725) internal successors, (69), 64 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:55:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2022-11-20 10:55:23,236 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 8 [2022-11-20 10:55:23,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:23,237 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2022-11-20 10:55:23,237 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2022-11-20 10:55:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 10:55:23,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:23,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:23,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 10:55:23,246 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting fErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-11-20 10:55:23,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:23,247 INFO L85 PathProgramCache]: Analyzing trace with hash 40854066, now seen corresponding path program 1 times [2022-11-20 10:55:23,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:23,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954882734] [2022-11-20 10:55:23,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:23,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:23,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:23,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954882734] [2022-11-20 10:55:23,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954882734] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:23,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:23,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:55:23,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522282113] [2022-11-20 10:55:23,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:23,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:55:23,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:23,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:55:23,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:23,411 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:23,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:23,503 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-11-20 10:55:23,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:55:23,504 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-20 10:55:23,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:23,504 INFO L225 Difference]: With dead ends: 62 [2022-11-20 10:55:23,505 INFO L226 Difference]: Without dead ends: 62 [2022-11-20 10:55:23,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:23,506 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 56 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:23,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 45 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:55:23,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-20 10:55:23,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-20 10:55:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.6) internal successors, (64), 59 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:55:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-11-20 10:55:23,511 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 8 [2022-11-20 10:55:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:23,512 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-11-20 10:55:23,512 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-11-20 10:55:23,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:55:23,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:23,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:23,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 10:55:23,513 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting fErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-11-20 10:55:23,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:23,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1266475995, now seen corresponding path program 1 times [2022-11-20 10:55:23,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:23,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466188710] [2022-11-20 10:55:23,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:23,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:23,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:23,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466188710] [2022-11-20 10:55:23,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466188710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:23,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:23,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:55:23,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932586979] [2022-11-20 10:55:23,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:23,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:55:23,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:23,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:55:23,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:23,633 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:23,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:23,702 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-11-20 10:55:23,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:55:23,703 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 10:55:23,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:23,704 INFO L225 Difference]: With dead ends: 59 [2022-11-20 10:55:23,705 INFO L226 Difference]: Without dead ends: 59 [2022-11-20 10:55:23,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:23,706 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 49 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:23,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 40 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:55:23,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-20 10:55:23,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-20 10:55:23,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.525) internal successors, (61), 56 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:55:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-11-20 10:55:23,711 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 9 [2022-11-20 10:55:23,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:23,712 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-11-20 10:55:23,712 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:23,712 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-11-20 10:55:23,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 10:55:23,713 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:23,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:23,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 10:55:23,714 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting fErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-11-20 10:55:23,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:23,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1266475996, now seen corresponding path program 1 times [2022-11-20 10:55:23,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:23,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394103696] [2022-11-20 10:55:23,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:23,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:23,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:23,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:23,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394103696] [2022-11-20 10:55:23,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394103696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:23,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:23,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:55:23,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563371582] [2022-11-20 10:55:23,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:23,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:55:23,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:23,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:55:23,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:23,916 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:23,984 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-11-20 10:55:23,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:55:23,985 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-20 10:55:23,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:23,986 INFO L225 Difference]: With dead ends: 56 [2022-11-20 10:55:23,986 INFO L226 Difference]: Without dead ends: 56 [2022-11-20 10:55:23,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:23,987 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 49 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:23,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 42 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:55:23,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-20 10:55:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-20 10:55:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.45) internal successors, (58), 53 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:55:23,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-11-20 10:55:23,993 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 9 [2022-11-20 10:55:23,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:23,994 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-11-20 10:55:23,994 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-11-20 10:55:23,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 10:55:23,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:23,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:23,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 10:55:23,996 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting fErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-11-20 10:55:23,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:23,997 INFO L85 PathProgramCache]: Analyzing trace with hash 606050164, now seen corresponding path program 1 times [2022-11-20 10:55:23,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:23,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320670225] [2022-11-20 10:55:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:23,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:24,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:24,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320670225] [2022-11-20 10:55:24,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320670225] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:24,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:24,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:55:24,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017325471] [2022-11-20 10:55:24,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:24,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:55:24,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:24,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:55:24,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:24,066 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:24,131 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-11-20 10:55:24,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:55:24,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 10:55:24,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:24,133 INFO L225 Difference]: With dead ends: 50 [2022-11-20 10:55:24,133 INFO L226 Difference]: Without dead ends: 50 [2022-11-20 10:55:24,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:24,135 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:24,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 34 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:55:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-20 10:55:24,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-20 10:55:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.3) internal successors, (52), 47 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:55:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2022-11-20 10:55:24,140 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 10 [2022-11-20 10:55:24,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:24,141 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2022-11-20 10:55:24,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-11-20 10:55:24,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-20 10:55:24,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:24,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:24,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 10:55:24,143 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting fErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-11-20 10:55:24,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash 606050165, now seen corresponding path program 1 times [2022-11-20 10:55:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:24,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871020136] [2022-11-20 10:55:24,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:24,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:24,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:24,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:24,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871020136] [2022-11-20 10:55:24,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871020136] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:24,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:24,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:55:24,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533783596] [2022-11-20 10:55:24,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:24,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 10:55:24,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:24,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 10:55:24,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:24,255 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:24,320 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-11-20 10:55:24,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 10:55:24,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-20 10:55:24,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:24,322 INFO L225 Difference]: With dead ends: 44 [2022-11-20 10:55:24,322 INFO L226 Difference]: Without dead ends: 44 [2022-11-20 10:55:24,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 10:55:24,323 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 36 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:24,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 36 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:55:24,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-20 10:55:24,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-20 10:55:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:55:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-11-20 10:55:24,338 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 10 [2022-11-20 10:55:24,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:24,338 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-11-20 10:55:24,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:24,339 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-11-20 10:55:24,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-20 10:55:24,340 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:24,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:24,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 10:55:24,341 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-11-20 10:55:24,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:24,341 INFO L85 PathProgramCache]: Analyzing trace with hash 137416884, now seen corresponding path program 1 times [2022-11-20 10:55:24,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:24,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013566026] [2022-11-20 10:55:24,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:24,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:24,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:55:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:24,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:24,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:24,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013566026] [2022-11-20 10:55:24,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013566026] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:24,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:24,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 10:55:24,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770631114] [2022-11-20 10:55:24,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:24,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:55:24,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:24,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:55:24,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:55:24,684 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:55:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:24,858 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-11-20 10:55:24,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:55:24,859 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-20 10:55:24,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:24,860 INFO L225 Difference]: With dead ends: 81 [2022-11-20 10:55:24,860 INFO L226 Difference]: Without dead ends: 81 [2022-11-20 10:55:24,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:55:24,861 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 146 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:24,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 125 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:55:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-20 10:55:24,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 44. [2022-11-20 10:55:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:55:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-11-20 10:55:24,866 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 15 [2022-11-20 10:55:24,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:24,866 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-11-20 10:55:24,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:55:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-11-20 10:55:24,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-20 10:55:24,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:24,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:24,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 10:55:24,868 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-11-20 10:55:24,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:24,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2077535637, now seen corresponding path program 1 times [2022-11-20 10:55:24,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:24,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383493328] [2022-11-20 10:55:24,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:25,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:55:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:26,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:26,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383493328] [2022-11-20 10:55:26,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383493328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:26,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:26,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:55:26,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718547346] [2022-11-20 10:55:26,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:26,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:55:26,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:26,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:55:26,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:55:26,150 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:55:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:26,739 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2022-11-20 10:55:26,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:55:26,740 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-11-20 10:55:26,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:26,741 INFO L225 Difference]: With dead ends: 83 [2022-11-20 10:55:26,741 INFO L226 Difference]: Without dead ends: 83 [2022-11-20 10:55:26,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-11-20 10:55:26,742 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 146 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:26,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 186 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:55:26,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-20 10:55:26,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 58. [2022-11-20 10:55:26,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 55 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:55:26,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2022-11-20 10:55:26,747 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 23 [2022-11-20 10:55:26,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:26,747 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2022-11-20 10:55:26,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:55:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2022-11-20 10:55:26,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-20 10:55:26,749 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:26,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:26,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 10:55:26,749 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-11-20 10:55:26,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2090010354, now seen corresponding path program 1 times [2022-11-20 10:55:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:26,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890515603] [2022-11-20 10:55:26,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:26,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:27,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:55:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:27,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:27,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890515603] [2022-11-20 10:55:27,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890515603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:27,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:27,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 10:55:27,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675480821] [2022-11-20 10:55:27,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:27,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:55:27,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:27,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:55:27,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-20 10:55:27,473 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:55:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:27,844 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2022-11-20 10:55:27,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 10:55:27,845 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-11-20 10:55:27,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:27,846 INFO L225 Difference]: With dead ends: 89 [2022-11-20 10:55:27,846 INFO L226 Difference]: Without dead ends: 89 [2022-11-20 10:55:27,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:55:27,847 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 95 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:27,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 171 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 10:55:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-20 10:55:27,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 64. [2022-11-20 10:55:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 61 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:55:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-11-20 10:55:27,852 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 25 [2022-11-20 10:55:27,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:27,852 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-11-20 10:55:27,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:55:27,852 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-11-20 10:55:27,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-20 10:55:27,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:27,854 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, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:27,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 10:55:27,854 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-11-20 10:55:27,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:27,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1910924132, now seen corresponding path program 1 times [2022-11-20 10:55:27,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:27,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222606611] [2022-11-20 10:55:27,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:27,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:28,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:55:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:55:28,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:28,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222606611] [2022-11-20 10:55:28,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222606611] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:28,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:28,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-20 10:55:28,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491528844] [2022-11-20 10:55:28,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:28,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 10:55:28,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:28,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 10:55:28,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-20 10:55:28,644 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:55:28,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:28,840 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-11-20 10:55:28,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 10:55:28,841 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-11-20 10:55:28,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:28,842 INFO L225 Difference]: With dead ends: 65 [2022-11-20 10:55:28,842 INFO L226 Difference]: Without dead ends: 65 [2022-11-20 10:55:28,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-20 10:55:28,843 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 62 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:28,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 146 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:55:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-20 10:55:28,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2022-11-20 10:55:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-20 10:55:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2022-11-20 10:55:28,848 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 29 [2022-11-20 10:55:28,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:28,849 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2022-11-20 10:55:28,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:55:28,849 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2022-11-20 10:55:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-20 10:55:28,851 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 10:55:28,852 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:28,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 10:55:28,852 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 40 more)] === [2022-11-20 10:55:28,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:55:28,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1125264602, now seen corresponding path program 1 times [2022-11-20 10:55:28,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:55:28,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86992346] [2022-11-20 10:55:28,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:55:28,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:55:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:29,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-20 10:55:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:55:30,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-20 10:55:30,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:55:30,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86992346] [2022-11-20 10:55:30,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86992346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:55:30,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:55:30,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 10:55:30,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806150384] [2022-11-20 10:55:30,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:55:30,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:55:30,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:55:30,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:55:30,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:55:30,845 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:55:30,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 10:55:30,995 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-11-20 10:55:30,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 10:55:30,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-11-20 10:55:30,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 10:55:30,997 INFO L225 Difference]: With dead ends: 57 [2022-11-20 10:55:30,997 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 10:55:30,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-20 10:55:30,998 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 45 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 10:55:30,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 72 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 10:55:30,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 10:55:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 10:55:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 10:55:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 10:55:30,999 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-11-20 10:55:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 10:55:31,000 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 10:55:31,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-20 10:55:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 10:55:31,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 10:55:31,003 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 43 remaining) [2022-11-20 10:55:31,004 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 43 remaining) [2022-11-20 10:55:31,004 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 43 remaining) [2022-11-20 10:55:31,004 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 43 remaining) [2022-11-20 10:55:31,004 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 43 remaining) [2022-11-20 10:55:31,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 43 remaining) [2022-11-20 10:55:31,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 43 remaining) [2022-11-20 10:55:31,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 43 remaining) [2022-11-20 10:55:31,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 43 remaining) [2022-11-20 10:55:31,005 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 43 remaining) [2022-11-20 10:55:31,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 43 remaining) [2022-11-20 10:55:31,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 43 remaining) [2022-11-20 10:55:31,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 43 remaining) [2022-11-20 10:55:31,006 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 43 remaining) [2022-11-20 10:55:31,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 43 remaining) [2022-11-20 10:55:31,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 43 remaining) [2022-11-20 10:55:31,010 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 43 remaining) [2022-11-20 10:55:31,012 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 43 remaining) [2022-11-20 10:55:31,012 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 43 remaining) [2022-11-20 10:55:31,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 43 remaining) [2022-11-20 10:55:31,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 43 remaining) [2022-11-20 10:55:31,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 43 remaining) [2022-11-20 10:55:31,013 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 43 remaining) [2022-11-20 10:55:31,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 43 remaining) [2022-11-20 10:55:31,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 43 remaining) [2022-11-20 10:55:31,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 43 remaining) [2022-11-20 10:55:31,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 43 remaining) [2022-11-20 10:55:31,014 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 43 remaining) [2022-11-20 10:55:31,015 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 43 remaining) [2022-11-20 10:55:31,015 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 43 remaining) [2022-11-20 10:55:31,015 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 43 remaining) [2022-11-20 10:55:31,015 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 43 remaining) [2022-11-20 10:55:31,016 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 43 remaining) [2022-11-20 10:55:31,016 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 43 remaining) [2022-11-20 10:55:31,016 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 43 remaining) [2022-11-20 10:55:31,016 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 43 remaining) [2022-11-20 10:55:31,017 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 43 remaining) [2022-11-20 10:55:31,017 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 43 remaining) [2022-11-20 10:55:31,017 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 43 remaining) [2022-11-20 10:55:31,017 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 43 remaining) [2022-11-20 10:55:31,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 43 remaining) [2022-11-20 10:55:31,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 43 remaining) [2022-11-20 10:55:31,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 43 remaining) [2022-11-20 10:55:31,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 10:55:31,022 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 10:55:31,028 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 10:55:31,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:55:31 BoogieIcfgContainer [2022-11-20 10:55:31,033 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 10:55:31,034 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 10:55:31,034 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 10:55:31,034 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 10:55:31,035 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:55:19" (3/4) ... [2022-11-20 10:55:31,038 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-20 10:55:31,047 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2022-11-20 10:55:31,056 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-11-20 10:55:31,056 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-20 10:55:31,057 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-20 10:55:31,057 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-20 10:55:31,122 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 10:55:31,122 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 10:55:31,122 INFO L158 Benchmark]: Toolchain (without parser) took 12666.32ms. Allocated memory was 199.2MB in the beginning and 287.3MB in the end (delta: 88.1MB). Free memory was 152.3MB in the beginning and 105.8MB in the end (delta: 46.5MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. [2022-11-20 10:55:31,123 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 142.6MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:55:31,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.37ms. Allocated memory is still 199.2MB. Free memory was 151.8MB in the beginning and 136.2MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-20 10:55:31,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.06ms. Allocated memory is still 199.2MB. Free memory was 136.2MB in the beginning and 134.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 10:55:31,125 INFO L158 Benchmark]: Boogie Preprocessor took 73.75ms. Allocated memory is still 199.2MB. Free memory was 134.7MB in the beginning and 133.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 10:55:31,126 INFO L158 Benchmark]: RCFGBuilder took 836.63ms. Allocated memory is still 199.2MB. Free memory was 133.0MB in the beginning and 114.7MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-20 10:55:31,126 INFO L158 Benchmark]: TraceAbstraction took 11096.53ms. Allocated memory was 199.2MB in the beginning and 287.3MB in the end (delta: 88.1MB). Free memory was 114.2MB in the beginning and 109.0MB in the end (delta: 5.2MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. [2022-11-20 10:55:31,126 INFO L158 Benchmark]: Witness Printer took 87.86ms. Allocated memory is still 287.3MB. Free memory was 109.0MB in the beginning and 105.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 10:55:31,129 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.71ms. Allocated memory is still 142.6MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.37ms. Allocated memory is still 199.2MB. Free memory was 151.8MB in the beginning and 136.2MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.06ms. Allocated memory is still 199.2MB. Free memory was 136.2MB in the beginning and 134.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.75ms. Allocated memory is still 199.2MB. Free memory was 134.7MB in the beginning and 133.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 836.63ms. Allocated memory is still 199.2MB. Free memory was 133.0MB in the beginning and 114.7MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11096.53ms. Allocated memory was 199.2MB in the beginning and 287.3MB in the end (delta: 88.1MB). Free memory was 114.2MB in the beginning and 109.0MB in the end (delta: 5.2MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. * Witness Printer took 87.86ms. Allocated memory is still 287.3MB. Free memory was 109.0MB in the beginning and 105.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 43 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1136 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1136 mSDsluCounter, 1154 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 647 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1022 IncrementalHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 507 mSDtfsCounter, 1022 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, InterpolantAutomatonStates: 72, 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, 15 MinimizatonAttempts, 94 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 3602 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 9/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 43 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-20 10:55:31,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78f7769e-c217-4c2c-86a0-c208aee202cf/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE