./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 00:03:27,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 00:03:27,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 00:03:27,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 00:03:27,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 00:03:27,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 00:03:27,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 00:03:27,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 00:03:27,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 00:03:27,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 00:03:27,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 00:03:27,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 00:03:27,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 00:03:27,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 00:03:27,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 00:03:27,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 00:03:27,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 00:03:27,186 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 00:03:27,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 00:03:27,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 00:03:27,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 00:03:27,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 00:03:27,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 00:03:27,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 00:03:27,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 00:03:27,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 00:03:27,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 00:03:27,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 00:03:27,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 00:03:27,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 00:03:27,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 00:03:27,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 00:03:27,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 00:03:27,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 00:03:27,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 00:03:27,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 00:03:27,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 00:03:27,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 00:03:27,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 00:03:27,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 00:03:27,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 00:03:27,242 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-10-29 00:03:27,295 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 00:03:27,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 00:03:27,296 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-29 00:03:27,296 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-29 00:03:27,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 00:03:27,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 00:03:27,303 INFO L138 SettingsManager]: * Use SBE=true [2021-10-29 00:03:27,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 00:03:27,303 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 00:03:27,304 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-29 00:03:27,304 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 00:03:27,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 00:03:27,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 00:03:27,304 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-29 00:03:27,304 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-29 00:03:27,304 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-29 00:03:27,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 00:03:27,305 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 00:03:27,305 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 00:03:27,305 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 00:03:27,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 00:03:27,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-29 00:03:27,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 00:03:27,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 00:03:27,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 00:03:27,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 00:03:27,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-29 00:03:27,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 00:03:27,306 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 00:03:27,306 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_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/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_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c [2021-10-29 00:03:27,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 00:03:27,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 00:03:27,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 00:03:27,639 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 00:03:27,641 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 00:03:27,642 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-10-29 00:03:27,734 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/data/5edb3595f/00518009210640bba5d5fd26d005f903/FLAG86ea3768d [2021-10-29 00:03:28,326 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 00:03:28,328 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-10-29 00:03:28,348 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/data/5edb3595f/00518009210640bba5d5fd26d005f903/FLAG86ea3768d [2021-10-29 00:03:28,619 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/data/5edb3595f/00518009210640bba5d5fd26d005f903 [2021-10-29 00:03:28,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 00:03:28,627 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-29 00:03:28,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 00:03:28,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 00:03:28,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 00:03:28,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 12:03:28" (1/1) ... [2021-10-29 00:03:28,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f633506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:28, skipping insertion in model container [2021-10-29 00:03:28,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 12:03:28" (1/1) ... [2021-10-29 00:03:28,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 00:03:28,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 00:03:28,898 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2021-10-29 00:03:29,063 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 00:03:29,074 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 00:03:29,097 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2021-10-29 00:03:29,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 00:03:29,237 INFO L208 MainTranslator]: Completed translation [2021-10-29 00:03:29,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:29 WrapperNode [2021-10-29 00:03:29,238 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 00:03:29,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 00:03:29,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 00:03:29,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 00:03:29,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:29" (1/1) ... [2021-10-29 00:03:29,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:29" (1/1) ... [2021-10-29 00:03:29,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:29" (1/1) ... [2021-10-29 00:03:29,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:29" (1/1) ... [2021-10-29 00:03:29,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:29" (1/1) ... [2021-10-29 00:03:29,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:29" (1/1) ... [2021-10-29 00:03:29,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:29" (1/1) ... [2021-10-29 00:03:29,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 00:03:29,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 00:03:29,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 00:03:29,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 00:03:29,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:29" (1/1) ... [2021-10-29 00:03:29,362 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 00:03:29,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-29 00:03:29,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 00:03:29,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 00:03:29,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-29 00:03:29,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 00:03:29,461 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-29 00:03:29,462 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-10-29 00:03:29,462 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2021-10-29 00:03:29,463 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2021-10-29 00:03:29,463 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2021-10-29 00:03:29,463 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2021-10-29 00:03:29,464 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2021-10-29 00:03:29,466 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2021-10-29 00:03:29,466 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2021-10-29 00:03:29,467 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2021-10-29 00:03:29,467 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2021-10-29 00:03:29,467 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2021-10-29 00:03:29,467 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2021-10-29 00:03:29,467 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2021-10-29 00:03:29,468 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2021-10-29 00:03:29,468 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2021-10-29 00:03:29,468 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2021-10-29 00:03:29,468 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2021-10-29 00:03:29,468 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-29 00:03:29,469 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2021-10-29 00:03:29,469 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-10-29 00:03:29,469 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-10-29 00:03:29,469 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-10-29 00:03:29,469 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2021-10-29 00:03:29,469 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-10-29 00:03:29,470 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2021-10-29 00:03:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-29 00:03:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-29 00:03:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-29 00:03:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 00:03:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-10-29 00:03:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-29 00:03:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2021-10-29 00:03:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2021-10-29 00:03:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2021-10-29 00:03:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2021-10-29 00:03:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2021-10-29 00:03:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2021-10-29 00:03:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2021-10-29 00:03:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2021-10-29 00:03:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2021-10-29 00:03:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2021-10-29 00:03:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2021-10-29 00:03:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2021-10-29 00:03:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2021-10-29 00:03:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2021-10-29 00:03:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-10-29 00:03:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2021-10-29 00:03:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-10-29 00:03:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2021-10-29 00:03:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-10-29 00:03:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-10-29 00:03:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2021-10-29 00:03:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2021-10-29 00:03:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2021-10-29 00:03:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2021-10-29 00:03:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-29 00:03:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-10-29 00:03:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-29 00:03:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 00:03:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 00:03:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-29 00:03:29,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-29 00:03:29,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-29 00:03:29,788 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 00:03:29,954 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-10-29 00:03:29,954 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-10-29 00:03:29,972 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 00:03:30,043 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2021-10-29 00:03:30,043 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2021-10-29 00:03:30,082 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 00:03:30,112 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-10-29 00:03:30,113 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-10-29 00:03:30,131 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 00:03:30,142 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-29 00:03:30,142 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-29 00:03:30,469 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 00:03:30,517 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-10-29 00:03:30,518 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-10-29 00:03:30,548 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 00:03:30,561 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2021-10-29 00:03:30,562 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2021-10-29 00:03:30,658 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 00:03:30,658 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-10-29 00:03:30,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 12:03:30 BoogieIcfgContainer [2021-10-29 00:03:30,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 00:03:30,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 00:03:30,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 00:03:30,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 00:03:30,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 12:03:28" (1/3) ... [2021-10-29 00:03:30,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfe17e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 12:03:30, skipping insertion in model container [2021-10-29 00:03:30,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 12:03:29" (2/3) ... [2021-10-29 00:03:30,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfe17e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 12:03:30, skipping insertion in model container [2021-10-29 00:03:30,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 12:03:30" (3/3) ... [2021-10-29 00:03:30,671 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2021-10-29 00:03:30,676 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 00:03:30,676 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-29 00:03:30,723 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 00:03:30,730 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 00:03:30,730 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-29 00:03:30,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 296 states, 206 states have (on average 1.4320388349514563) internal successors, (295), 225 states have internal predecessors, (295), 61 states have call successors, (61), 26 states have call predecessors, (61), 26 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) [2021-10-29 00:03:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-29 00:03:30,762 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:30,763 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:30,763 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:30,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:30,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1560408711, now seen corresponding path program 1 times [2021-10-29 00:03:30,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:30,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794766910] [2021-10-29 00:03:30,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:30,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:31,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:31,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:31,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:31,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:31,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794766910] [2021-10-29 00:03:31,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794766910] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:31,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:31,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 00:03:31,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633780162] [2021-10-29 00:03:31,318 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 00:03:31,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:31,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 00:03:31,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 00:03:31,394 INFO L87 Difference]: Start difference. First operand has 296 states, 206 states have (on average 1.4320388349514563) internal successors, (295), 225 states have internal predecessors, (295), 61 states have call successors, (61), 26 states have call predecessors, (61), 26 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-10-29 00:03:32,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:32,367 INFO L93 Difference]: Finished difference Result 332 states and 459 transitions. [2021-10-29 00:03:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 00:03:32,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-10-29 00:03:32,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:32,396 INFO L225 Difference]: With dead ends: 332 [2021-10-29 00:03:32,397 INFO L226 Difference]: Without dead ends: 326 [2021-10-29 00:03:32,406 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 00:03:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-10-29 00:03:32,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2021-10-29 00:03:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 201 states have (on average 1.3781094527363185) internal successors, (277), 217 states have internal predecessors, (277), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-10-29 00:03:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 384 transitions. [2021-10-29 00:03:32,485 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 384 transitions. Word has length 15 [2021-10-29 00:03:32,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:32,485 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 384 transitions. [2021-10-29 00:03:32,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-10-29 00:03:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 384 transitions. [2021-10-29 00:03:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 00:03:32,487 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:32,487 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:32,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 00:03:32,488 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:32,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:32,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1302515818, now seen corresponding path program 1 times [2021-10-29 00:03:32,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:32,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818714270] [2021-10-29 00:03:32,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:32,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:32,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:32,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:32,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:32,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818714270] [2021-10-29 00:03:32,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818714270] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:32,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:32,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 00:03:32,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791743283] [2021-10-29 00:03:32,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 00:03:32,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:32,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 00:03:32,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-29 00:03:32,795 INFO L87 Difference]: Start difference. First operand 287 states and 384 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-10-29 00:03:33,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:33,870 INFO L93 Difference]: Finished difference Result 331 states and 451 transitions. [2021-10-29 00:03:33,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 00:03:33,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2021-10-29 00:03:33,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:33,881 INFO L225 Difference]: With dead ends: 331 [2021-10-29 00:03:33,881 INFO L226 Difference]: Without dead ends: 326 [2021-10-29 00:03:33,882 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-29 00:03:33,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-10-29 00:03:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2021-10-29 00:03:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 201 states have (on average 1.373134328358209) internal successors, (276), 217 states have internal predecessors, (276), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-10-29 00:03:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2021-10-29 00:03:33,915 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2021-10-29 00:03:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:33,915 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2021-10-29 00:03:33,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-10-29 00:03:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2021-10-29 00:03:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 00:03:33,916 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:33,916 INFO L513 BasicCegarLoop]: 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] [2021-10-29 00:03:33,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 00:03:33,917 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:33,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:33,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1551281276, now seen corresponding path program 1 times [2021-10-29 00:03:33,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:33,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642404245] [2021-10-29 00:03:33,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:33,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:34,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:34,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:34,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:03:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:34,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:34,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:34,118 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642404245] [2021-10-29 00:03:34,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642404245] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:34,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:34,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 00:03:34,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153635313] [2021-10-29 00:03:34,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 00:03:34,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:34,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 00:03:34,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-29 00:03:34,123 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-29 00:03:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:36,055 INFO L93 Difference]: Finished difference Result 508 states and 702 transitions. [2021-10-29 00:03:36,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 00:03:36,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2021-10-29 00:03:36,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:36,061 INFO L225 Difference]: With dead ends: 508 [2021-10-29 00:03:36,062 INFO L226 Difference]: Without dead ends: 507 [2021-10-29 00:03:36,062 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-29 00:03:36,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-10-29 00:03:36,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 440. [2021-10-29 00:03:36,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 318 states have (on average 1.3459119496855345) internal successors, (428), 329 states have internal predecessors, (428), 80 states have call successors, (80), 37 states have call predecessors, (80), 41 states have return successors, (100), 77 states have call predecessors, (100), 68 states have call successors, (100) [2021-10-29 00:03:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 608 transitions. [2021-10-29 00:03:36,103 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 608 transitions. Word has length 25 [2021-10-29 00:03:36,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:36,104 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 608 transitions. [2021-10-29 00:03:36,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-29 00:03:36,104 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 608 transitions. [2021-10-29 00:03:36,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-29 00:03:36,107 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:36,107 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:36,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 00:03:36,107 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:36,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:36,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1085614475, now seen corresponding path program 1 times [2021-10-29 00:03:36,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:36,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180201988] [2021-10-29 00:03:36,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:36,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:36,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:36,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:36,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:36,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:03:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:36,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:36,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180201988] [2021-10-29 00:03:36,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180201988] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:36,352 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:36,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 00:03:36,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015477787] [2021-10-29 00:03:36,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 00:03:36,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:36,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 00:03:36,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-29 00:03:36,354 INFO L87 Difference]: Start difference. First operand 440 states and 608 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-29 00:03:38,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:38,332 INFO L93 Difference]: Finished difference Result 690 states and 979 transitions. [2021-10-29 00:03:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 00:03:38,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2021-10-29 00:03:38,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:38,340 INFO L225 Difference]: With dead ends: 690 [2021-10-29 00:03:38,340 INFO L226 Difference]: Without dead ends: 690 [2021-10-29 00:03:38,341 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-29 00:03:38,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-10-29 00:03:38,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 618. [2021-10-29 00:03:38,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 455 states have (on average 1.3560439560439561) internal successors, (617), 466 states have internal predecessors, (617), 109 states have call successors, (109), 49 states have call predecessors, (109), 53 states have return successors, (162), 105 states have call predecessors, (162), 98 states have call successors, (162) [2021-10-29 00:03:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 888 transitions. [2021-10-29 00:03:38,393 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 888 transitions. Word has length 31 [2021-10-29 00:03:38,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:38,394 INFO L470 AbstractCegarLoop]: Abstraction has 618 states and 888 transitions. [2021-10-29 00:03:38,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-29 00:03:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 888 transitions. [2021-10-29 00:03:38,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-29 00:03:38,398 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:38,398 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:38,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 00:03:38,399 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:38,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:38,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1025634350, now seen corresponding path program 1 times [2021-10-29 00:03:38,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:38,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095937740] [2021-10-29 00:03:38,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:38,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:38,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:38,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:38,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:03:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:38,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:38,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:38,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095937740] [2021-10-29 00:03:38,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095937740] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:38,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:38,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 00:03:38,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333808429] [2021-10-29 00:03:38,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 00:03:38,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:38,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 00:03:38,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-29 00:03:38,640 INFO L87 Difference]: Start difference. First operand 618 states and 888 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-29 00:03:39,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:39,768 INFO L93 Difference]: Finished difference Result 661 states and 947 transitions. [2021-10-29 00:03:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 00:03:39,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2021-10-29 00:03:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:39,780 INFO L225 Difference]: With dead ends: 661 [2021-10-29 00:03:39,781 INFO L226 Difference]: Without dead ends: 661 [2021-10-29 00:03:39,781 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-29 00:03:39,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2021-10-29 00:03:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2021-10-29 00:03:39,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 466 states have (on average 1.354077253218884) internal successors, (631), 475 states have internal predecessors, (631), 108 states have call successors, (108), 50 states have call predecessors, (108), 53 states have return successors, (162), 105 states have call predecessors, (162), 98 states have call successors, (162) [2021-10-29 00:03:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 901 transitions. [2021-10-29 00:03:39,855 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 901 transitions. Word has length 36 [2021-10-29 00:03:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:39,855 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 901 transitions. [2021-10-29 00:03:39,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-29 00:03:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 901 transitions. [2021-10-29 00:03:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-29 00:03:39,859 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:39,860 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:39,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 00:03:39,860 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:39,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1273733766, now seen corresponding path program 1 times [2021-10-29 00:03:39,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:39,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019823203] [2021-10-29 00:03:39,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:39,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:40,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:40,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:40,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:03:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:40,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-29 00:03:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:40,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:03:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:40,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:40,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019823203] [2021-10-29 00:03:40,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019823203] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:40,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:40,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-29 00:03:40,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230439117] [2021-10-29 00:03:40,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-29 00:03:40,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:40,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-29 00:03:40,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-29 00:03:40,266 INFO L87 Difference]: Start difference. First operand 628 states and 901 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-29 00:03:42,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:42,030 INFO L93 Difference]: Finished difference Result 705 states and 1000 transitions. [2021-10-29 00:03:42,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-29 00:03:42,031 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2021-10-29 00:03:42,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:42,041 INFO L225 Difference]: With dead ends: 705 [2021-10-29 00:03:42,041 INFO L226 Difference]: Without dead ends: 705 [2021-10-29 00:03:42,042 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-10-29 00:03:42,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-10-29 00:03:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2021-10-29 00:03:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.348360655737705) internal successors, (658), 502 states have internal predecessors, (658), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2021-10-29 00:03:42,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 936 transitions. [2021-10-29 00:03:42,097 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 936 transitions. Word has length 39 [2021-10-29 00:03:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:42,098 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 936 transitions. [2021-10-29 00:03:42,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-29 00:03:42,099 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 936 transitions. [2021-10-29 00:03:42,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-29 00:03:42,103 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:42,103 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:42,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 00:03:42,104 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:42,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:42,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1267590478, now seen corresponding path program 1 times [2021-10-29 00:03:42,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:42,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630188981] [2021-10-29 00:03:42,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:42,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:42,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:42,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:42,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:03:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:42,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-29 00:03:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:42,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:03:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:42,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:42,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630188981] [2021-10-29 00:03:42,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630188981] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:42,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:42,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-29 00:03:42,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049161308] [2021-10-29 00:03:42,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-29 00:03:42,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:42,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-29 00:03:42,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-29 00:03:42,564 INFO L87 Difference]: Start difference. First operand 658 states and 936 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-29 00:03:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:45,116 INFO L93 Difference]: Finished difference Result 705 states and 999 transitions. [2021-10-29 00:03:45,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-29 00:03:45,117 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2021-10-29 00:03:45,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:45,123 INFO L225 Difference]: With dead ends: 705 [2021-10-29 00:03:45,124 INFO L226 Difference]: Without dead ends: 705 [2021-10-29 00:03:45,124 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-10-29 00:03:45,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-10-29 00:03:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2021-10-29 00:03:45,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.346311475409836) internal successors, (657), 502 states have internal predecessors, (657), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2021-10-29 00:03:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 935 transitions. [2021-10-29 00:03:45,161 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 935 transitions. Word has length 40 [2021-10-29 00:03:45,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:45,162 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 935 transitions. [2021-10-29 00:03:45,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-29 00:03:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 935 transitions. [2021-10-29 00:03:45,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-29 00:03:45,164 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:45,164 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:45,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 00:03:45,165 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:45,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:45,166 INFO L85 PathProgramCache]: Analyzing trace with hash -908144207, now seen corresponding path program 1 times [2021-10-29 00:03:45,166 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:45,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274729597] [2021-10-29 00:03:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:45,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:45,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:45,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:45,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:03:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:45,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-29 00:03:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:45,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:03:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:45,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:45,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:45,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274729597] [2021-10-29 00:03:45,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274729597] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:45,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:45,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-29 00:03:45,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883138474] [2021-10-29 00:03:45,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 00:03:45,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:45,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 00:03:45,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-29 00:03:45,456 INFO L87 Difference]: Start difference. First operand 658 states and 935 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:03:47,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:47,015 INFO L93 Difference]: Finished difference Result 1186 states and 1741 transitions. [2021-10-29 00:03:47,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 00:03:47,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2021-10-29 00:03:47,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:47,027 INFO L225 Difference]: With dead ends: 1186 [2021-10-29 00:03:47,027 INFO L226 Difference]: Without dead ends: 1186 [2021-10-29 00:03:47,027 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-10-29 00:03:47,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2021-10-29 00:03:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1085. [2021-10-29 00:03:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 817 states have (on average 1.3635250917992656) internal successors, (1114), 835 states have internal predecessors, (1114), 173 states have call successors, (173), 79 states have call predecessors, (173), 94 states have return successors, (315), 175 states have call predecessors, (315), 163 states have call successors, (315) [2021-10-29 00:03:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1602 transitions. [2021-10-29 00:03:47,087 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1602 transitions. Word has length 41 [2021-10-29 00:03:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:47,089 INFO L470 AbstractCegarLoop]: Abstraction has 1085 states and 1602 transitions. [2021-10-29 00:03:47,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:03:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1602 transitions. [2021-10-29 00:03:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-29 00:03:47,093 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:47,094 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:47,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 00:03:47,094 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:47,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:47,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1920333946, now seen corresponding path program 1 times [2021-10-29 00:03:47,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:47,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681276039] [2021-10-29 00:03:47,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:47,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:47,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:47,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:47,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:03:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:47,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-29 00:03:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:47,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:03:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:47,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:47,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:47,356 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681276039] [2021-10-29 00:03:47,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681276039] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:47,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:47,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-29 00:03:47,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532159745] [2021-10-29 00:03:47,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-29 00:03:47,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:47,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-29 00:03:47,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-29 00:03:47,367 INFO L87 Difference]: Start difference. First operand 1085 states and 1602 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:03:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:48,810 INFO L93 Difference]: Finished difference Result 1167 states and 1721 transitions. [2021-10-29 00:03:48,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 00:03:48,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2021-10-29 00:03:48,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:48,821 INFO L225 Difference]: With dead ends: 1167 [2021-10-29 00:03:48,822 INFO L226 Difference]: Without dead ends: 1148 [2021-10-29 00:03:48,822 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-29 00:03:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2021-10-29 00:03:48,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1078. [2021-10-29 00:03:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 813 states have (on average 1.3640836408364083) internal successors, (1109), 831 states have internal predecessors, (1109), 171 states have call successors, (171), 78 states have call predecessors, (171), 93 states have return successors, (313), 173 states have call predecessors, (313), 161 states have call successors, (313) [2021-10-29 00:03:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1593 transitions. [2021-10-29 00:03:48,876 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1593 transitions. Word has length 42 [2021-10-29 00:03:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:48,876 INFO L470 AbstractCegarLoop]: Abstraction has 1078 states and 1593 transitions. [2021-10-29 00:03:48,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:03:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1593 transitions. [2021-10-29 00:03:48,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-29 00:03:48,878 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:48,878 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:48,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 00:03:48,879 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:48,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:48,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1961075502, now seen corresponding path program 1 times [2021-10-29 00:03:48,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:48,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422576788] [2021-10-29 00:03:48,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:48,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:49,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:49,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:49,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:49,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:03:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:49,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:49,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422576788] [2021-10-29 00:03:49,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422576788] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:49,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:49,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-29 00:03:49,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272195569] [2021-10-29 00:03:49,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 00:03:49,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:49,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 00:03:49,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-29 00:03:49,081 INFO L87 Difference]: Start difference. First operand 1078 states and 1593 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-29 00:03:50,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:50,083 INFO L93 Difference]: Finished difference Result 599 states and 851 transitions. [2021-10-29 00:03:50,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 00:03:50,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2021-10-29 00:03:50,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:50,091 INFO L225 Difference]: With dead ends: 599 [2021-10-29 00:03:50,091 INFO L226 Difference]: Without dead ends: 599 [2021-10-29 00:03:50,091 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-29 00:03:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-10-29 00:03:50,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 598. [2021-10-29 00:03:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 443 states have (on average 1.327313769751693) internal successors, (588), 455 states have internal predecessors, (588), 102 states have call successors, (102), 47 states have call predecessors, (102), 52 states have return successors, (160), 98 states have call predecessors, (160), 94 states have call successors, (160) [2021-10-29 00:03:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 850 transitions. [2021-10-29 00:03:50,123 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 850 transitions. Word has length 45 [2021-10-29 00:03:50,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:50,124 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 850 transitions. [2021-10-29 00:03:50,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-29 00:03:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 850 transitions. [2021-10-29 00:03:50,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-29 00:03:50,127 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:50,127 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:50,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 00:03:50,128 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:50,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:50,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1047559429, now seen corresponding path program 1 times [2021-10-29 00:03:50,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:50,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851322836] [2021-10-29 00:03:50,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:50,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:50,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:50,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:50,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:03:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:50,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-29 00:03:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:50,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:03:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:50,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:50,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851322836] [2021-10-29 00:03:50,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851322836] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:50,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:50,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-29 00:03:50,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341934802] [2021-10-29 00:03:50,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-29 00:03:50,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:50,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-29 00:03:50,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-29 00:03:50,404 INFO L87 Difference]: Start difference. First operand 598 states and 850 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:03:51,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:51,225 INFO L93 Difference]: Finished difference Result 625 states and 884 transitions. [2021-10-29 00:03:51,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-29 00:03:51,226 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2021-10-29 00:03:51,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:51,231 INFO L225 Difference]: With dead ends: 625 [2021-10-29 00:03:51,231 INFO L226 Difference]: Without dead ends: 608 [2021-10-29 00:03:51,231 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-29 00:03:51,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-10-29 00:03:51,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 596. [2021-10-29 00:03:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.3257918552036199) internal successors, (586), 454 states have internal predecessors, (586), 101 states have call successors, (101), 47 states have call predecessors, (101), 52 states have return successors, (159), 97 states have call predecessors, (159), 93 states have call successors, (159) [2021-10-29 00:03:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 846 transitions. [2021-10-29 00:03:51,258 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 846 transitions. Word has length 46 [2021-10-29 00:03:51,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:51,259 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 846 transitions. [2021-10-29 00:03:51,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:03:51,259 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 846 transitions. [2021-10-29 00:03:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-29 00:03:51,260 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:51,261 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:51,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 00:03:51,261 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:51,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:51,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1630521075, now seen corresponding path program 1 times [2021-10-29 00:03:51,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:51,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693825979] [2021-10-29 00:03:51,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:51,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:51,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:51,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:51,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:51,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:03:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:51,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-29 00:03:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:51,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:03:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:51,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:51,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:51,522 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693825979] [2021-10-29 00:03:51,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693825979] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:51,522 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:51,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-29 00:03:51,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385914316] [2021-10-29 00:03:51,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-29 00:03:51,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:51,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-29 00:03:51,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-29 00:03:51,524 INFO L87 Difference]: Start difference. First operand 596 states and 846 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-29 00:03:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:52,700 INFO L93 Difference]: Finished difference Result 626 states and 884 transitions. [2021-10-29 00:03:52,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-29 00:03:52,701 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2021-10-29 00:03:52,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:52,706 INFO L225 Difference]: With dead ends: 626 [2021-10-29 00:03:52,706 INFO L226 Difference]: Without dead ends: 608 [2021-10-29 00:03:52,707 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-29 00:03:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-10-29 00:03:52,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 596. [2021-10-29 00:03:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.3235294117647058) internal successors, (585), 454 states have internal predecessors, (585), 101 states have call successors, (101), 47 states have call predecessors, (101), 52 states have return successors, (159), 97 states have call predecessors, (159), 93 states have call successors, (159) [2021-10-29 00:03:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 845 transitions. [2021-10-29 00:03:52,737 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 845 transitions. Word has length 46 [2021-10-29 00:03:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:52,737 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 845 transitions. [2021-10-29 00:03:52,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-29 00:03:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 845 transitions. [2021-10-29 00:03:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-29 00:03:52,739 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:52,740 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:52,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 00:03:52,740 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1014081090, now seen corresponding path program 1 times [2021-10-29 00:03:52,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:52,741 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272518637] [2021-10-29 00:03:52,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:52,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:52,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:52,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:52,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:03:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:52,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-29 00:03:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:53,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-29 00:03:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:53,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:53,032 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272518637] [2021-10-29 00:03:53,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272518637] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:53,032 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:53,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-29 00:03:53,033 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373675946] [2021-10-29 00:03:53,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 00:03:53,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:53,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 00:03:53,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-29 00:03:53,036 INFO L87 Difference]: Start difference. First operand 596 states and 845 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:03:54,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:54,877 INFO L93 Difference]: Finished difference Result 826 states and 1225 transitions. [2021-10-29 00:03:54,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 00:03:54,880 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2021-10-29 00:03:54,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:54,887 INFO L225 Difference]: With dead ends: 826 [2021-10-29 00:03:54,887 INFO L226 Difference]: Without dead ends: 826 [2021-10-29 00:03:54,888 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-10-29 00:03:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2021-10-29 00:03:54,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 665. [2021-10-29 00:03:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 495 states have (on average 1.3232323232323233) internal successors, (655), 508 states have internal predecessors, (655), 109 states have call successors, (109), 50 states have call predecessors, (109), 60 states have return successors, (184), 110 states have call predecessors, (184), 101 states have call successors, (184) [2021-10-29 00:03:54,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 948 transitions. [2021-10-29 00:03:54,936 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 948 transitions. Word has length 46 [2021-10-29 00:03:54,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:54,937 INFO L470 AbstractCegarLoop]: Abstraction has 665 states and 948 transitions. [2021-10-29 00:03:54,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:03:54,937 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 948 transitions. [2021-10-29 00:03:54,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-29 00:03:54,939 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:54,939 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:54,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-29 00:03:54,940 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:54,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:54,940 INFO L85 PathProgramCache]: Analyzing trace with hash -74200962, now seen corresponding path program 1 times [2021-10-29 00:03:54,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:54,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472753090] [2021-10-29 00:03:54,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:54,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:55,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:55,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:55,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:03:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:55,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-10-29 00:03:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:55,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:55,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472753090] [2021-10-29 00:03:55,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472753090] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:55,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:55,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-29 00:03:55,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253908644] [2021-10-29 00:03:55,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 00:03:55,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:55,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 00:03:55,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-29 00:03:55,173 INFO L87 Difference]: Start difference. First operand 665 states and 948 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-10-29 00:03:56,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:56,721 INFO L93 Difference]: Finished difference Result 462 states and 599 transitions. [2021-10-29 00:03:56,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-29 00:03:56,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2021-10-29 00:03:56,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:56,726 INFO L225 Difference]: With dead ends: 462 [2021-10-29 00:03:56,726 INFO L226 Difference]: Without dead ends: 462 [2021-10-29 00:03:56,727 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-10-29 00:03:56,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-10-29 00:03:56,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 441. [2021-10-29 00:03:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 327 states have (on average 1.27217125382263) internal successors, (416), 338 states have internal predecessors, (416), 69 states have call successors, (69), 38 states have call predecessors, (69), 44 states have return successors, (93), 68 states have call predecessors, (93), 61 states have call successors, (93) [2021-10-29 00:03:56,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 578 transitions. [2021-10-29 00:03:56,746 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 578 transitions. Word has length 49 [2021-10-29 00:03:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:56,746 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 578 transitions. [2021-10-29 00:03:56,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-10-29 00:03:56,747 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 578 transitions. [2021-10-29 00:03:56,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-29 00:03:56,748 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:56,749 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:56,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-29 00:03:56,749 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:56,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:56,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1824745018, now seen corresponding path program 1 times [2021-10-29 00:03:56,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:56,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207131423] [2021-10-29 00:03:56,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:56,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:56,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:56,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:03:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:56,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-29 00:03:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-29 00:03:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:57,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:57,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207131423] [2021-10-29 00:03:57,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207131423] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:57,045 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:57,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-29 00:03:57,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349213982] [2021-10-29 00:03:57,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-29 00:03:57,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:57,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-29 00:03:57,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-29 00:03:57,058 INFO L87 Difference]: Start difference. First operand 441 states and 578 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:03:58,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:58,184 INFO L93 Difference]: Finished difference Result 454 states and 594 transitions. [2021-10-29 00:03:58,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-29 00:03:58,185 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2021-10-29 00:03:58,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:58,187 INFO L225 Difference]: With dead ends: 454 [2021-10-29 00:03:58,188 INFO L226 Difference]: Without dead ends: 453 [2021-10-29 00:03:58,188 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-10-29 00:03:58,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-10-29 00:03:58,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2021-10-29 00:03:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 334 states have (on average 1.2724550898203593) internal successors, (425), 346 states have internal predecessors, (425), 70 states have call successors, (70), 38 states have call predecessors, (70), 44 states have return successors, (94), 69 states have call predecessors, (94), 62 states have call successors, (94) [2021-10-29 00:03:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2021-10-29 00:03:58,203 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2021-10-29 00:03:58,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:58,203 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2021-10-29 00:03:58,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:03:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2021-10-29 00:03:58,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-29 00:03:58,205 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:58,205 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:58,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-29 00:03:58,205 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:58,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:58,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1824468188, now seen corresponding path program 1 times [2021-10-29 00:03:58,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:58,206 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843971781] [2021-10-29 00:03:58,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:58,207 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:58,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:58,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:58,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:03:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:58,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-29 00:03:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:58,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-29 00:03:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:58,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:58,472 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843971781] [2021-10-29 00:03:58,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843971781] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:58,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:58,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-29 00:03:58,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664167528] [2021-10-29 00:03:58,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-29 00:03:58,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:58,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-29 00:03:58,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-29 00:03:58,476 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:03:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:03:59,357 INFO L93 Difference]: Finished difference Result 487 states and 652 transitions. [2021-10-29 00:03:59,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-29 00:03:59,358 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2021-10-29 00:03:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:03:59,361 INFO L225 Difference]: With dead ends: 487 [2021-10-29 00:03:59,362 INFO L226 Difference]: Without dead ends: 472 [2021-10-29 00:03:59,362 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-10-29 00:03:59,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-10-29 00:03:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 459. [2021-10-29 00:03:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 343 states have (on average 1.2769679300291545) internal successors, (438), 356 states have internal predecessors, (438), 70 states have call successors, (70), 38 states have call predecessors, (70), 45 states have return successors, (96), 69 states have call predecessors, (96), 62 states have call successors, (96) [2021-10-29 00:03:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 604 transitions. [2021-10-29 00:03:59,382 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 604 transitions. Word has length 47 [2021-10-29 00:03:59,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:03:59,383 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 604 transitions. [2021-10-29 00:03:59,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:03:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2021-10-29 00:03:59,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-29 00:03:59,386 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:03:59,386 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:03:59,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-29 00:03:59,387 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:03:59,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:03:59,387 INFO L85 PathProgramCache]: Analyzing trace with hash 463036434, now seen corresponding path program 1 times [2021-10-29 00:03:59,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:03:59,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835135728] [2021-10-29 00:03:59,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:03:59,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:03:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:59,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:03:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:59,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:03:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:59,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:03:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:59,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-29 00:03:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:59,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-29 00:03:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:03:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:03:59,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:03:59,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835135728] [2021-10-29 00:03:59,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835135728] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:03:59,718 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:03:59,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-29 00:03:59,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854676853] [2021-10-29 00:03:59,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-29 00:03:59,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:03:59,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-29 00:03:59,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-29 00:03:59,721 INFO L87 Difference]: Start difference. First operand 459 states and 604 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-29 00:04:02,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:02,196 INFO L93 Difference]: Finished difference Result 590 states and 807 transitions. [2021-10-29 00:04:02,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-29 00:04:02,197 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2021-10-29 00:04:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:02,201 INFO L225 Difference]: With dead ends: 590 [2021-10-29 00:04:02,201 INFO L226 Difference]: Without dead ends: 575 [2021-10-29 00:04:02,202 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2021-10-29 00:04:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-10-29 00:04:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 444. [2021-10-29 00:04:02,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 332 states have (on average 1.2771084337349397) internal successors, (424), 343 states have internal predecessors, (424), 68 states have call successors, (68), 38 states have call predecessors, (68), 43 states have return successors, (91), 66 states have call predecessors, (91), 60 states have call successors, (91) [2021-10-29 00:04:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 583 transitions. [2021-10-29 00:04:02,221 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 583 transitions. Word has length 48 [2021-10-29 00:04:02,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:02,221 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 583 transitions. [2021-10-29 00:04:02,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-29 00:04:02,221 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 583 transitions. [2021-10-29 00:04:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-29 00:04:02,223 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:02,224 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:02,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-29 00:04:02,224 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:02,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:02,225 INFO L85 PathProgramCache]: Analyzing trace with hash -97212758, now seen corresponding path program 1 times [2021-10-29 00:04:02,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:02,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109122830] [2021-10-29 00:04:02,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:02,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:02,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:02,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:02,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:02,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-10-29 00:04:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:02,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:02,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:02,482 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109122830] [2021-10-29 00:04:02,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109122830] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:02,482 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:02,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-29 00:04:02,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918967121] [2021-10-29 00:04:02,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-29 00:04:02,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:02,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-29 00:04:02,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-29 00:04:02,485 INFO L87 Difference]: Start difference. First operand 444 states and 583 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:04:03,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:03,680 INFO L93 Difference]: Finished difference Result 455 states and 596 transitions. [2021-10-29 00:04:03,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-29 00:04:03,681 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2021-10-29 00:04:03,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:03,684 INFO L225 Difference]: With dead ends: 455 [2021-10-29 00:04:03,685 INFO L226 Difference]: Without dead ends: 427 [2021-10-29 00:04:03,685 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-29 00:04:03,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-10-29 00:04:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2021-10-29 00:04:03,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 318 states have (on average 1.279874213836478) internal successors, (407), 330 states have internal predecessors, (407), 66 states have call successors, (66), 36 states have call predecessors, (66), 42 states have return successors, (89), 64 states have call predecessors, (89), 58 states have call successors, (89) [2021-10-29 00:04:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 562 transitions. [2021-10-29 00:04:03,704 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 562 transitions. Word has length 49 [2021-10-29 00:04:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:03,704 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 562 transitions. [2021-10-29 00:04:03,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:04:03,705 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 562 transitions. [2021-10-29 00:04:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-29 00:04:03,706 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:03,706 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:03,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-29 00:04:03,707 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:03,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:03,708 INFO L85 PathProgramCache]: Analyzing trace with hash 193438818, now seen corresponding path program 1 times [2021-10-29 00:04:03,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:03,708 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758148165] [2021-10-29 00:04:03,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:03,709 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:03,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:03,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:03,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:03,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-29 00:04:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:03,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-29 00:04:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:03,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:03,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:03,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758148165] [2021-10-29 00:04:03,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758148165] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:03,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:03,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-29 00:04:03,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450646969] [2021-10-29 00:04:03,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-29 00:04:03,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:03,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-29 00:04:03,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-29 00:04:03,993 INFO L87 Difference]: Start difference. First operand 427 states and 562 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-29 00:04:05,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:05,204 INFO L93 Difference]: Finished difference Result 453 states and 597 transitions. [2021-10-29 00:04:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-29 00:04:05,205 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2021-10-29 00:04:05,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:05,209 INFO L225 Difference]: With dead ends: 453 [2021-10-29 00:04:05,209 INFO L226 Difference]: Without dead ends: 423 [2021-10-29 00:04:05,210 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-29 00:04:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-10-29 00:04:05,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 409. [2021-10-29 00:04:05,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 316 states have internal predecessors, (391), 64 states have call successors, (64), 34 states have call predecessors, (64), 40 states have return successors, (87), 62 states have call predecessors, (87), 56 states have call successors, (87) [2021-10-29 00:04:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 542 transitions. [2021-10-29 00:04:05,226 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 542 transitions. Word has length 50 [2021-10-29 00:04:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:05,227 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 542 transitions. [2021-10-29 00:04:05,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-29 00:04:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 542 transitions. [2021-10-29 00:04:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-29 00:04:05,228 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:05,228 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:05,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-29 00:04:05,229 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:05,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1006860761, now seen corresponding path program 1 times [2021-10-29 00:04:05,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:05,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792920186] [2021-10-29 00:04:05,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:05,231 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:05,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:05,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:05,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:05,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-29 00:04:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:05,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:05,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:05,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792920186] [2021-10-29 00:04:05,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792920186] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:05,510 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:05,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-29 00:04:05,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330197581] [2021-10-29 00:04:05,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-29 00:04:05,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:05,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-29 00:04:05,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-29 00:04:05,512 INFO L87 Difference]: Start difference. First operand 409 states and 542 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-29 00:04:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:08,229 INFO L93 Difference]: Finished difference Result 600 states and 867 transitions. [2021-10-29 00:04:08,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-29 00:04:08,230 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2021-10-29 00:04:08,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:08,235 INFO L225 Difference]: With dead ends: 600 [2021-10-29 00:04:08,235 INFO L226 Difference]: Without dead ends: 600 [2021-10-29 00:04:08,236 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2021-10-29 00:04:08,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-10-29 00:04:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 534. [2021-10-29 00:04:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 399 states have (on average 1.3433583959899749) internal successors, (536), 410 states have internal predecessors, (536), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2021-10-29 00:04:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 769 transitions. [2021-10-29 00:04:08,260 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 769 transitions. Word has length 50 [2021-10-29 00:04:08,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:08,261 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 769 transitions. [2021-10-29 00:04:08,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-29 00:04:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 769 transitions. [2021-10-29 00:04:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-29 00:04:08,265 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:08,265 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:08,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-29 00:04:08,266 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:08,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:08,267 INFO L85 PathProgramCache]: Analyzing trace with hash 645881872, now seen corresponding path program 1 times [2021-10-29 00:04:08,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:08,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701680838] [2021-10-29 00:04:08,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:08,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:08,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:08,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:08,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:08,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-29 00:04:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:08,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:08,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:08,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701680838] [2021-10-29 00:04:08,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701680838] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:08,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:08,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-29 00:04:08,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293310129] [2021-10-29 00:04:08,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-29 00:04:08,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:08,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-29 00:04:08,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 00:04:08,515 INFO L87 Difference]: Start difference. First operand 534 states and 769 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:04:09,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:09,616 INFO L93 Difference]: Finished difference Result 740 states and 1128 transitions. [2021-10-29 00:04:09,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 00:04:09,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2021-10-29 00:04:09,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:09,627 INFO L225 Difference]: With dead ends: 740 [2021-10-29 00:04:09,627 INFO L226 Difference]: Without dead ends: 740 [2021-10-29 00:04:09,628 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-29 00:04:09,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-10-29 00:04:09,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 561. [2021-10-29 00:04:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 419 states have (on average 1.3293556085918854) internal successors, (557), 431 states have internal predecessors, (557), 93 states have call successors, (93), 38 states have call predecessors, (93), 48 states have return successors, (147), 94 states have call predecessors, (147), 85 states have call successors, (147) [2021-10-29 00:04:09,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 797 transitions. [2021-10-29 00:04:09,658 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 797 transitions. Word has length 51 [2021-10-29 00:04:09,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:09,659 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 797 transitions. [2021-10-29 00:04:09,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:04:09,659 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 797 transitions. [2021-10-29 00:04:09,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-29 00:04:09,661 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:09,661 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:09,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-29 00:04:09,661 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:09,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:09,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1801633520, now seen corresponding path program 1 times [2021-10-29 00:04:09,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:09,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389729164] [2021-10-29 00:04:09,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:09,663 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:09,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:09,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:09,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:09,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-29 00:04:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:09,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:09,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:09,873 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389729164] [2021-10-29 00:04:09,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389729164] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:09,873 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:09,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-29 00:04:09,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995211066] [2021-10-29 00:04:09,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 00:04:09,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:09,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 00:04:09,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-29 00:04:09,876 INFO L87 Difference]: Start difference. First operand 561 states and 797 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:04:10,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:10,550 INFO L93 Difference]: Finished difference Result 579 states and 821 transitions. [2021-10-29 00:04:10,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 00:04:10,550 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2021-10-29 00:04:10,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:10,554 INFO L225 Difference]: With dead ends: 579 [2021-10-29 00:04:10,554 INFO L226 Difference]: Without dead ends: 579 [2021-10-29 00:04:10,555 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-10-29 00:04:10,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-10-29 00:04:10,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 564. [2021-10-29 00:04:10,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 422 states have (on average 1.3293838862559242) internal successors, (561), 434 states have internal predecessors, (561), 93 states have call successors, (93), 38 states have call predecessors, (93), 48 states have return successors, (147), 94 states have call predecessors, (147), 85 states have call successors, (147) [2021-10-29 00:04:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 801 transitions. [2021-10-29 00:04:10,579 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 801 transitions. Word has length 51 [2021-10-29 00:04:10,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:10,579 INFO L470 AbstractCegarLoop]: Abstraction has 564 states and 801 transitions. [2021-10-29 00:04:10,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:04:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 801 transitions. [2021-10-29 00:04:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-29 00:04:10,581 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:10,581 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:10,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-29 00:04:10,582 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:10,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:10,583 INFO L85 PathProgramCache]: Analyzing trace with hash 499189070, now seen corresponding path program 1 times [2021-10-29 00:04:10,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:10,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410828840] [2021-10-29 00:04:10,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:10,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:10,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:10,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:10,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:10,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-29 00:04:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:10,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:10,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:10,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410828840] [2021-10-29 00:04:10,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410828840] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:10,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:10,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-29 00:04:10,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621163113] [2021-10-29 00:04:10,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-29 00:04:10,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:10,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-29 00:04:10,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-29 00:04:10,851 INFO L87 Difference]: Start difference. First operand 564 states and 801 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-29 00:04:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:12,344 INFO L93 Difference]: Finished difference Result 619 states and 929 transitions. [2021-10-29 00:04:12,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-29 00:04:12,358 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2021-10-29 00:04:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:12,362 INFO L225 Difference]: With dead ends: 619 [2021-10-29 00:04:12,362 INFO L226 Difference]: Without dead ends: 619 [2021-10-29 00:04:12,363 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2021-10-29 00:04:12,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-10-29 00:04:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 524. [2021-10-29 00:04:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 390 states have (on average 1.3307692307692307) internal successors, (519), 400 states have internal predecessors, (519), 91 states have call successors, (91), 37 states have call predecessors, (91), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2021-10-29 00:04:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 751 transitions. [2021-10-29 00:04:12,401 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 751 transitions. Word has length 51 [2021-10-29 00:04:12,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:12,402 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 751 transitions. [2021-10-29 00:04:12,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-29 00:04:12,402 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 751 transitions. [2021-10-29 00:04:12,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-29 00:04:12,403 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:12,403 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:12,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-29 00:04:12,404 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:12,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:12,405 INFO L85 PathProgramCache]: Analyzing trace with hash -999496148, now seen corresponding path program 1 times [2021-10-29 00:04:12,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:12,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39510672] [2021-10-29 00:04:12,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:12,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:12,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:12,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:12,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:12,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-29 00:04:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:12,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:12,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:12,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39510672] [2021-10-29 00:04:12,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39510672] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:12,704 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:12,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-29 00:04:12,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831156239] [2021-10-29 00:04:12,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-29 00:04:12,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:12,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-29 00:04:12,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-29 00:04:12,706 INFO L87 Difference]: Start difference. First operand 524 states and 751 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:04:13,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:13,688 INFO L93 Difference]: Finished difference Result 544 states and 778 transitions. [2021-10-29 00:04:13,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-29 00:04:13,689 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2021-10-29 00:04:13,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:13,694 INFO L225 Difference]: With dead ends: 544 [2021-10-29 00:04:13,694 INFO L226 Difference]: Without dead ends: 543 [2021-10-29 00:04:13,695 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-29 00:04:13,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-10-29 00:04:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 531. [2021-10-29 00:04:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 396 states have (on average 1.3282828282828283) internal successors, (526), 407 states have internal predecessors, (526), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2021-10-29 00:04:13,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 760 transitions. [2021-10-29 00:04:13,718 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 760 transitions. Word has length 52 [2021-10-29 00:04:13,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:13,719 INFO L470 AbstractCegarLoop]: Abstraction has 531 states and 760 transitions. [2021-10-29 00:04:13,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:04:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 760 transitions. [2021-10-29 00:04:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-29 00:04:13,720 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:13,721 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:13,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-29 00:04:13,721 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:13,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:13,722 INFO L85 PathProgramCache]: Analyzing trace with hash -999772978, now seen corresponding path program 1 times [2021-10-29 00:04:13,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:13,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752386875] [2021-10-29 00:04:13,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:13,723 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:13,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:13,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:13,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:13,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:13,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-29 00:04:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:13,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:14,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:14,009 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752386875] [2021-10-29 00:04:14,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752386875] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:14,009 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:14,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-29 00:04:14,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159669700] [2021-10-29 00:04:14,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-29 00:04:14,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:14,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-29 00:04:14,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-29 00:04:14,012 INFO L87 Difference]: Start difference. First operand 531 states and 760 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:04:14,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:14,866 INFO L93 Difference]: Finished difference Result 559 states and 794 transitions. [2021-10-29 00:04:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-29 00:04:14,866 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2021-10-29 00:04:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:14,871 INFO L225 Difference]: With dead ends: 559 [2021-10-29 00:04:14,871 INFO L226 Difference]: Without dead ends: 538 [2021-10-29 00:04:14,871 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-10-29 00:04:14,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-10-29 00:04:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 530. [2021-10-29 00:04:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 395 states have (on average 1.3265822784810126) internal successors, (524), 406 states have internal predecessors, (524), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2021-10-29 00:04:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 758 transitions. [2021-10-29 00:04:14,894 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 758 transitions. Word has length 52 [2021-10-29 00:04:14,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:14,895 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 758 transitions. [2021-10-29 00:04:14,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-29 00:04:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 758 transitions. [2021-10-29 00:04:14,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-29 00:04:14,897 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:14,897 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:14,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-29 00:04:14,897 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:14,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:14,898 INFO L85 PathProgramCache]: Analyzing trace with hash -639415020, now seen corresponding path program 1 times [2021-10-29 00:04:14,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:14,898 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524466054] [2021-10-29 00:04:14,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:14,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:15,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:15,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:15,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:15,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:15,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-29 00:04:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:15,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:15,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-10-29 00:04:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:15,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:15,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524466054] [2021-10-29 00:04:15,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524466054] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:15,120 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:15,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-29 00:04:15,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585308482] [2021-10-29 00:04:15,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 00:04:15,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:15,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 00:04:15,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-29 00:04:15,123 INFO L87 Difference]: Start difference. First operand 530 states and 758 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-29 00:04:15,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:15,715 INFO L93 Difference]: Finished difference Result 549 states and 800 transitions. [2021-10-29 00:04:15,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-29 00:04:15,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2021-10-29 00:04:15,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:15,723 INFO L225 Difference]: With dead ends: 549 [2021-10-29 00:04:15,724 INFO L226 Difference]: Without dead ends: 549 [2021-10-29 00:04:15,724 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-29 00:04:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-10-29 00:04:15,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 529. [2021-10-29 00:04:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 394 states have (on average 1.3197969543147208) internal successors, (520), 405 states have internal predecessors, (520), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2021-10-29 00:04:15,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 754 transitions. [2021-10-29 00:04:15,767 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 754 transitions. Word has length 58 [2021-10-29 00:04:15,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:15,768 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 754 transitions. [2021-10-29 00:04:15,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-29 00:04:15,768 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 754 transitions. [2021-10-29 00:04:15,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-29 00:04:15,769 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:15,769 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:15,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-29 00:04:15,770 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:15,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:15,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1490997952, now seen corresponding path program 1 times [2021-10-29 00:04:15,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:15,771 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857413687] [2021-10-29 00:04:15,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:15,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:15,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:15,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:15,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:16,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-29 00:04:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:16,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:16,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:16,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:16,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857413687] [2021-10-29 00:04:16,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857413687] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:16,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:16,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-29 00:04:16,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588093786] [2021-10-29 00:04:16,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-29 00:04:16,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:16,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-29 00:04:16,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-29 00:04:16,038 INFO L87 Difference]: Start difference. First operand 529 states and 754 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-29 00:04:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:17,657 INFO L93 Difference]: Finished difference Result 671 states and 995 transitions. [2021-10-29 00:04:17,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-29 00:04:17,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2021-10-29 00:04:17,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:17,675 INFO L225 Difference]: With dead ends: 671 [2021-10-29 00:04:17,676 INFO L226 Difference]: Without dead ends: 639 [2021-10-29 00:04:17,676 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-10-29 00:04:17,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-10-29 00:04:17,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 560. [2021-10-29 00:04:17,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 415 states have (on average 1.344578313253012) internal successors, (558), 426 states have internal predecessors, (558), 101 states have call successors, (101), 37 states have call predecessors, (101), 43 states have return successors, (165), 98 states have call predecessors, (165), 94 states have call successors, (165) [2021-10-29 00:04:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 824 transitions. [2021-10-29 00:04:17,701 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 824 transitions. Word has length 53 [2021-10-29 00:04:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:17,701 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 824 transitions. [2021-10-29 00:04:17,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-29 00:04:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 824 transitions. [2021-10-29 00:04:17,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-29 00:04:17,703 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:17,703 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:17,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-29 00:04:17,704 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:17,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:17,705 INFO L85 PathProgramCache]: Analyzing trace with hash -538464897, now seen corresponding path program 1 times [2021-10-29 00:04:17,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:17,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638344982] [2021-10-29 00:04:17,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:17,706 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:17,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:17,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:17,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:17,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-10-29 00:04:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:18,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:18,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:18,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:18,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638344982] [2021-10-29 00:04:18,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638344982] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:18,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:18,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-29 00:04:18,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401997870] [2021-10-29 00:04:18,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-29 00:04:18,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:18,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-29 00:04:18,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-10-29 00:04:18,130 INFO L87 Difference]: Start difference. First operand 560 states and 824 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-29 00:04:18,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:18,817 INFO L93 Difference]: Finished difference Result 390 states and 522 transitions. [2021-10-29 00:04:18,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-29 00:04:18,817 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2021-10-29 00:04:18,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:18,820 INFO L225 Difference]: With dead ends: 390 [2021-10-29 00:04:18,820 INFO L226 Difference]: Without dead ends: 390 [2021-10-29 00:04:18,821 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-10-29 00:04:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-10-29 00:04:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 338. [2021-10-29 00:04:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 246 states have (on average 1.2560975609756098) internal successors, (309), 254 states have internal predecessors, (309), 59 states have call successors, (59), 31 states have call predecessors, (59), 32 states have return successors, (74), 54 states have call predecessors, (74), 53 states have call successors, (74) [2021-10-29 00:04:18,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2021-10-29 00:04:18,835 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 63 [2021-10-29 00:04:18,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:18,835 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2021-10-29 00:04:18,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-29 00:04:18,836 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2021-10-29 00:04:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-29 00:04:18,837 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:18,837 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:18,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-29 00:04:18,837 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:18,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1094959805, now seen corresponding path program 1 times [2021-10-29 00:04:18,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:18,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654590714] [2021-10-29 00:04:18,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:18,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:18,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:19,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:19,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:19,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-29 00:04:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:19,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:19,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:19,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:19,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:19,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654590714] [2021-10-29 00:04:19,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654590714] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:19,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:19,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-29 00:04:19,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305959276] [2021-10-29 00:04:19,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-29 00:04:19,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:19,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-29 00:04:19,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-10-29 00:04:19,169 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-29 00:04:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:20,251 INFO L93 Difference]: Finished difference Result 343 states and 451 transitions. [2021-10-29 00:04:20,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-29 00:04:20,252 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2021-10-29 00:04:20,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:20,254 INFO L225 Difference]: With dead ends: 343 [2021-10-29 00:04:20,254 INFO L226 Difference]: Without dead ends: 304 [2021-10-29 00:04:20,255 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-10-29 00:04:20,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-10-29 00:04:20,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2021-10-29 00:04:20,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 214 states have (on average 1.2757009345794392) internal successors, (273), 220 states have internal predecessors, (273), 55 states have call successors, (55), 28 states have call predecessors, (55), 28 states have return successors, (70), 50 states have call predecessors, (70), 50 states have call successors, (70) [2021-10-29 00:04:20,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 398 transitions. [2021-10-29 00:04:20,268 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 398 transitions. Word has length 58 [2021-10-29 00:04:20,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:20,269 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 398 transitions. [2021-10-29 00:04:20,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-29 00:04:20,269 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 398 transitions. [2021-10-29 00:04:20,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-10-29 00:04:20,271 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:20,272 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:20,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-29 00:04:20,272 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:20,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:20,273 INFO L85 PathProgramCache]: Analyzing trace with hash -703797032, now seen corresponding path program 1 times [2021-10-29 00:04:20,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:20,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216606973] [2021-10-29 00:04:20,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:20,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:20,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:20,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:20,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:20,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-10-29 00:04:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:20,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:20,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:20,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:20,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:20,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:20,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:20,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216606973] [2021-10-29 00:04:20,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216606973] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:20,614 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:20,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-29 00:04:20,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874620424] [2021-10-29 00:04:20,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-29 00:04:20,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:20,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-29 00:04:20,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-29 00:04:20,618 INFO L87 Difference]: Start difference. First operand 298 states and 398 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-29 00:04:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:21,478 INFO L93 Difference]: Finished difference Result 316 states and 429 transitions. [2021-10-29 00:04:21,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-29 00:04:21,478 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2021-10-29 00:04:21,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:21,480 INFO L225 Difference]: With dead ends: 316 [2021-10-29 00:04:21,480 INFO L226 Difference]: Without dead ends: 316 [2021-10-29 00:04:21,481 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2021-10-29 00:04:21,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-10-29 00:04:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 298. [2021-10-29 00:04:21,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 214 states have (on average 1.266355140186916) internal successors, (271), 220 states have internal predecessors, (271), 55 states have call successors, (55), 28 states have call predecessors, (55), 28 states have return successors, (70), 50 states have call predecessors, (70), 50 states have call successors, (70) [2021-10-29 00:04:21,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 396 transitions. [2021-10-29 00:04:21,492 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 396 transitions. Word has length 67 [2021-10-29 00:04:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:21,492 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 396 transitions. [2021-10-29 00:04:21,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-29 00:04:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 396 transitions. [2021-10-29 00:04:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-29 00:04:21,494 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:21,494 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:21,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-29 00:04:21,495 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:21,495 INFO L85 PathProgramCache]: Analyzing trace with hash -194321691, now seen corresponding path program 1 times [2021-10-29 00:04:21,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:21,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365556229] [2021-10-29 00:04:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:21,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:21,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:21,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:21,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:21,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-10-29 00:04:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:21,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:21,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:21,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:21,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:21,772 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365556229] [2021-10-29 00:04:21,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365556229] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:21,772 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:21,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-29 00:04:21,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734017202] [2021-10-29 00:04:21,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-29 00:04:21,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:21,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-29 00:04:21,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-10-29 00:04:21,774 INFO L87 Difference]: Start difference. First operand 298 states and 396 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-10-29 00:04:22,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:22,294 INFO L93 Difference]: Finished difference Result 330 states and 453 transitions. [2021-10-29 00:04:22,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-29 00:04:22,294 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2021-10-29 00:04:22,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:22,297 INFO L225 Difference]: With dead ends: 330 [2021-10-29 00:04:22,297 INFO L226 Difference]: Without dead ends: 330 [2021-10-29 00:04:22,298 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-10-29 00:04:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-10-29 00:04:22,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 303. [2021-10-29 00:04:22,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 218 states have (on average 1.261467889908257) internal successors, (275), 224 states have internal predecessors, (275), 55 states have call successors, (55), 28 states have call predecessors, (55), 29 states have return successors, (79), 51 states have call predecessors, (79), 50 states have call successors, (79) [2021-10-29 00:04:22,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 409 transitions. [2021-10-29 00:04:22,309 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 409 transitions. Word has length 68 [2021-10-29 00:04:22,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:22,310 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 409 transitions. [2021-10-29 00:04:22,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-10-29 00:04:22,310 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 409 transitions. [2021-10-29 00:04:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-10-29 00:04:22,312 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:22,312 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:22,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-29 00:04:22,313 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:22,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:22,313 INFO L85 PathProgramCache]: Analyzing trace with hash -198191505, now seen corresponding path program 1 times [2021-10-29 00:04:22,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:22,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924005677] [2021-10-29 00:04:22,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:22,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:22,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:22,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:22,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:22,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-10-29 00:04:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:22,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:22,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:22,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:22,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:22,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924005677] [2021-10-29 00:04:22,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924005677] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:22,570 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:22,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-29 00:04:22,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191706737] [2021-10-29 00:04:22,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-29 00:04:22,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:22,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-29 00:04:22,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-29 00:04:22,572 INFO L87 Difference]: Start difference. First operand 303 states and 409 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-10-29 00:04:23,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:23,188 INFO L93 Difference]: Finished difference Result 474 states and 674 transitions. [2021-10-29 00:04:23,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-29 00:04:23,188 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2021-10-29 00:04:23,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:23,191 INFO L225 Difference]: With dead ends: 474 [2021-10-29 00:04:23,191 INFO L226 Difference]: Without dead ends: 474 [2021-10-29 00:04:23,191 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-10-29 00:04:23,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-10-29 00:04:23,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 307. [2021-10-29 00:04:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 222 states have (on average 1.2657657657657657) internal successors, (281), 228 states have internal predecessors, (281), 55 states have call successors, (55), 28 states have call predecessors, (55), 29 states have return successors, (79), 51 states have call predecessors, (79), 50 states have call successors, (79) [2021-10-29 00:04:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 415 transitions. [2021-10-29 00:04:23,207 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 415 transitions. Word has length 69 [2021-10-29 00:04:23,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:23,207 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 415 transitions. [2021-10-29 00:04:23,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-10-29 00:04:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 415 transitions. [2021-10-29 00:04:23,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-29 00:04:23,209 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:23,209 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:23,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-29 00:04:23,210 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:23,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:23,210 INFO L85 PathProgramCache]: Analyzing trace with hash 392199007, now seen corresponding path program 1 times [2021-10-29 00:04:23,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:23,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361747899] [2021-10-29 00:04:23,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:23,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:23,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:23,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:23,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:23,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-10-29 00:04:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:23,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:23,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:23,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:23,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:23,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361747899] [2021-10-29 00:04:23,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361747899] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:23,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:23,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-29 00:04:23,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485063310] [2021-10-29 00:04:23,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-29 00:04:23,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:23,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-29 00:04:23,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-29 00:04:23,456 INFO L87 Difference]: Start difference. First operand 307 states and 415 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-29 00:04:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:24,402 INFO L93 Difference]: Finished difference Result 529 states and 764 transitions. [2021-10-29 00:04:24,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-29 00:04:24,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2021-10-29 00:04:24,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:24,406 INFO L225 Difference]: With dead ends: 529 [2021-10-29 00:04:24,406 INFO L226 Difference]: Without dead ends: 529 [2021-10-29 00:04:24,407 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-10-29 00:04:24,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-10-29 00:04:24,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 490. [2021-10-29 00:04:24,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 357 states have (on average 1.2913165266106443) internal successors, (461), 366 states have internal predecessors, (461), 89 states have call successors, (89), 35 states have call predecessors, (89), 43 states have return successors, (153), 89 states have call predecessors, (153), 85 states have call successors, (153) [2021-10-29 00:04:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 703 transitions. [2021-10-29 00:04:24,440 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 703 transitions. Word has length 71 [2021-10-29 00:04:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:24,440 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 703 transitions. [2021-10-29 00:04:24,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-29 00:04:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 703 transitions. [2021-10-29 00:04:24,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-29 00:04:24,442 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:24,443 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:24,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-29 00:04:24,443 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:24,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:24,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1252090646, now seen corresponding path program 1 times [2021-10-29 00:04:24,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:24,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165322555] [2021-10-29 00:04:24,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:24,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:24,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:24,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:24,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:24,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-10-29 00:04:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:24,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:24,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:24,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:24,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:24,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:24,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:24,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165322555] [2021-10-29 00:04:24,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165322555] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:24,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:24,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-29 00:04:24,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285085937] [2021-10-29 00:04:24,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-29 00:04:24,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:24,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-29 00:04:24,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-10-29 00:04:24,836 INFO L87 Difference]: Start difference. First operand 490 states and 703 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2021-10-29 00:04:25,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:25,412 INFO L93 Difference]: Finished difference Result 493 states and 705 transitions. [2021-10-29 00:04:25,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-29 00:04:25,412 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2021-10-29 00:04:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:25,416 INFO L225 Difference]: With dead ends: 493 [2021-10-29 00:04:25,417 INFO L226 Difference]: Without dead ends: 493 [2021-10-29 00:04:25,417 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-10-29 00:04:25,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-10-29 00:04:25,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 484. [2021-10-29 00:04:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 353 states have (on average 1.2832861189801699) internal successors, (453), 361 states have internal predecessors, (453), 88 states have call successors, (88), 35 states have call predecessors, (88), 42 states have return successors, (146), 88 states have call predecessors, (146), 84 states have call successors, (146) [2021-10-29 00:04:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 687 transitions. [2021-10-29 00:04:25,435 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 687 transitions. Word has length 72 [2021-10-29 00:04:25,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:25,436 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 687 transitions. [2021-10-29 00:04:25,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2021-10-29 00:04:25,436 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 687 transitions. [2021-10-29 00:04:25,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-29 00:04:25,438 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:25,438 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:25,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-29 00:04:25,439 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:25,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:25,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1761504416, now seen corresponding path program 1 times [2021-10-29 00:04:25,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:25,440 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84026445] [2021-10-29 00:04:25,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:25,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:25,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:25,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:25,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:25,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-10-29 00:04:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:25,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:25,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:25,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:25,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:25,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-10-29 00:04:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:25,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:25,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84026445] [2021-10-29 00:04:25,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84026445] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:25,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:25,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-29 00:04:25,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592393265] [2021-10-29 00:04:25,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-29 00:04:25,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:25,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-29 00:04:25,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-10-29 00:04:25,794 INFO L87 Difference]: Start difference. First operand 484 states and 687 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-29 00:04:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:26,931 INFO L93 Difference]: Finished difference Result 450 states and 629 transitions. [2021-10-29 00:04:26,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-29 00:04:26,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2021-10-29 00:04:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:26,933 INFO L225 Difference]: With dead ends: 450 [2021-10-29 00:04:26,936 INFO L226 Difference]: Without dead ends: 450 [2021-10-29 00:04:26,936 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2021-10-29 00:04:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-10-29 00:04:26,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 436. [2021-10-29 00:04:26,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 320 states have (on average 1.296875) internal successors, (415), 329 states have internal predecessors, (415), 79 states have call successors, (79), 33 states have call predecessors, (79), 36 states have return successors, (110), 74 states have call predecessors, (110), 75 states have call successors, (110) [2021-10-29 00:04:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 604 transitions. [2021-10-29 00:04:26,950 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 604 transitions. Word has length 83 [2021-10-29 00:04:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:26,951 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 604 transitions. [2021-10-29 00:04:26,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-29 00:04:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 604 transitions. [2021-10-29 00:04:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-29 00:04:26,952 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:26,953 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:26,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-29 00:04:26,953 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:26,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:26,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1176411851, now seen corresponding path program 1 times [2021-10-29 00:04:26,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:26,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194629299] [2021-10-29 00:04:26,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:26,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:27,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:27,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:27,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:27,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-29 00:04:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:27,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:27,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:27,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:27,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:27,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:27,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:27,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-10-29 00:04:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:27,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:27,592 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194629299] [2021-10-29 00:04:27,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194629299] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:27,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:27,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-10-29 00:04:27,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949414504] [2021-10-29 00:04:27,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-29 00:04:27,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:27,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-29 00:04:27,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2021-10-29 00:04:27,595 INFO L87 Difference]: Start difference. First operand 436 states and 604 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2021-10-29 00:04:28,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:28,600 INFO L93 Difference]: Finished difference Result 483 states and 678 transitions. [2021-10-29 00:04:28,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-29 00:04:28,601 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2021-10-29 00:04:28,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:28,605 INFO L225 Difference]: With dead ends: 483 [2021-10-29 00:04:28,605 INFO L226 Difference]: Without dead ends: 461 [2021-10-29 00:04:28,608 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2021-10-29 00:04:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-10-29 00:04:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2021-10-29 00:04:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 329 states have (on average 1.2887537993920972) internal successors, (424), 339 states have internal predecessors, (424), 79 states have call successors, (79), 33 states have call predecessors, (79), 38 states have return successors, (116), 75 states have call predecessors, (116), 75 states have call successors, (116) [2021-10-29 00:04:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 619 transitions. [2021-10-29 00:04:28,646 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 619 transitions. Word has length 92 [2021-10-29 00:04:28,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:28,646 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 619 transitions. [2021-10-29 00:04:28,648 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2021-10-29 00:04:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 619 transitions. [2021-10-29 00:04:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-29 00:04:28,650 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:28,650 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:28,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-29 00:04:28,651 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:28,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:28,652 INFO L85 PathProgramCache]: Analyzing trace with hash 702793907, now seen corresponding path program 1 times [2021-10-29 00:04:28,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:28,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285462068] [2021-10-29 00:04:28,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:28,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:28,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:28,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:28,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:28,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-29 00:04:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:28,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:29,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:29,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:29,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:29,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:29,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:29,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-10-29 00:04:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:29,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:29,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285462068] [2021-10-29 00:04:29,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285462068] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:29,289 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:29,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-10-29 00:04:29,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773552368] [2021-10-29 00:04:29,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-29 00:04:29,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:29,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-29 00:04:29,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2021-10-29 00:04:29,291 INFO L87 Difference]: Start difference. First operand 447 states and 619 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2021-10-29 00:04:30,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:30,269 INFO L93 Difference]: Finished difference Result 481 states and 674 transitions. [2021-10-29 00:04:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-29 00:04:30,284 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2021-10-29 00:04:30,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:30,287 INFO L225 Difference]: With dead ends: 481 [2021-10-29 00:04:30,288 INFO L226 Difference]: Without dead ends: 459 [2021-10-29 00:04:30,288 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2021-10-29 00:04:30,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-10-29 00:04:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 434. [2021-10-29 00:04:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 319 states have (on average 1.297805642633229) internal successors, (414), 328 states have internal predecessors, (414), 78 states have call successors, (78), 33 states have call predecessors, (78), 36 states have return successors, (108), 73 states have call predecessors, (108), 74 states have call successors, (108) [2021-10-29 00:04:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 600 transitions. [2021-10-29 00:04:30,300 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 600 transitions. Word has length 93 [2021-10-29 00:04:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:30,301 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 600 transitions. [2021-10-29 00:04:30,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2021-10-29 00:04:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 600 transitions. [2021-10-29 00:04:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-29 00:04:30,303 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:30,303 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:30,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-29 00:04:30,303 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:30,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:30,304 INFO L85 PathProgramCache]: Analyzing trace with hash 940384513, now seen corresponding path program 1 times [2021-10-29 00:04:30,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:30,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080861481] [2021-10-29 00:04:30,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:30,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:30,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:30,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:30,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:30,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-29 00:04:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:30,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:30,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:30,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:30,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:30,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:30,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:30,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-10-29 00:04:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:30,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-10-29 00:04:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:30,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:30,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080861481] [2021-10-29 00:04:30,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080861481] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:30,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:30,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-10-29 00:04:30,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915224729] [2021-10-29 00:04:30,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-29 00:04:30,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:30,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-29 00:04:30,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-10-29 00:04:30,926 INFO L87 Difference]: Start difference. First operand 434 states and 600 transitions. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2021-10-29 00:04:33,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:33,729 INFO L93 Difference]: Finished difference Result 860 states and 1205 transitions. [2021-10-29 00:04:33,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-29 00:04:33,730 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2021-10-29 00:04:33,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:33,735 INFO L225 Difference]: With dead ends: 860 [2021-10-29 00:04:33,736 INFO L226 Difference]: Without dead ends: 827 [2021-10-29 00:04:33,737 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=289, Invalid=2261, Unknown=0, NotChecked=0, Total=2550 [2021-10-29 00:04:33,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2021-10-29 00:04:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 805. [2021-10-29 00:04:33,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 596 states have (on average 1.3120805369127517) internal successors, (782), 614 states have internal predecessors, (782), 143 states have call successors, (143), 57 states have call predecessors, (143), 65 states have return successors, (208), 134 states have call predecessors, (208), 139 states have call successors, (208) [2021-10-29 00:04:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1133 transitions. [2021-10-29 00:04:33,768 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1133 transitions. Word has length 103 [2021-10-29 00:04:33,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:33,769 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 1133 transitions. [2021-10-29 00:04:33,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2021-10-29 00:04:33,769 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1133 transitions. [2021-10-29 00:04:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-29 00:04:33,772 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:33,772 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:33,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-29 00:04:33,773 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:33,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:33,774 INFO L85 PathProgramCache]: Analyzing trace with hash 911884223, now seen corresponding path program 1 times [2021-10-29 00:04:33,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:33,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64879609] [2021-10-29 00:04:33,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:33,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:33,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:33,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:33,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:34,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-29 00:04:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:34,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:34,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:34,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:34,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:34,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:34,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:34,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-10-29 00:04:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:34,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-10-29 00:04:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:34,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:34,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64879609] [2021-10-29 00:04:34,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64879609] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:34,442 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:34,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-10-29 00:04:34,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718715224] [2021-10-29 00:04:34,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-29 00:04:34,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:34,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-29 00:04:34,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-10-29 00:04:34,445 INFO L87 Difference]: Start difference. First operand 805 states and 1133 transitions. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2021-10-29 00:04:37,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:37,913 INFO L93 Difference]: Finished difference Result 847 states and 1189 transitions. [2021-10-29 00:04:37,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-29 00:04:37,914 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2021-10-29 00:04:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:37,920 INFO L225 Difference]: With dead ends: 847 [2021-10-29 00:04:37,920 INFO L226 Difference]: Without dead ends: 814 [2021-10-29 00:04:37,921 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=257, Invalid=1723, Unknown=0, NotChecked=0, Total=1980 [2021-10-29 00:04:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-10-29 00:04:37,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 424. [2021-10-29 00:04:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 313 states have (on average 1.3003194888178913) internal successors, (407), 322 states have internal predecessors, (407), 75 states have call successors, (75), 32 states have call predecessors, (75), 35 states have return successors, (105), 70 states have call predecessors, (105), 71 states have call successors, (105) [2021-10-29 00:04:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 587 transitions. [2021-10-29 00:04:37,941 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 587 transitions. Word has length 103 [2021-10-29 00:04:37,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:37,941 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 587 transitions. [2021-10-29 00:04:37,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2021-10-29 00:04:37,942 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 587 transitions. [2021-10-29 00:04:37,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-10-29 00:04:37,944 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:37,944 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:37,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-29 00:04:37,945 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:37,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:37,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1426002147, now seen corresponding path program 1 times [2021-10-29 00:04:37,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:37,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104203616] [2021-10-29 00:04:37,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:37,946 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:38,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:38,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:38,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:38,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-29 00:04:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:38,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-29 00:04:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:38,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:38,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:38,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:38,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:38,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:38,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:38,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-10-29 00:04:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:38,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-10-29 00:04:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:38,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:38,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-10-29 00:04:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:38,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:38,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104203616] [2021-10-29 00:04:38,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104203616] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:38,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:38,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-29 00:04:38,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97702586] [2021-10-29 00:04:38,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-29 00:04:38,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:38,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-29 00:04:38,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2021-10-29 00:04:38,664 INFO L87 Difference]: Start difference. First operand 424 states and 587 transitions. Second operand has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-10-29 00:04:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:39,782 INFO L93 Difference]: Finished difference Result 478 states and 676 transitions. [2021-10-29 00:04:39,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-29 00:04:39,783 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2021-10-29 00:04:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:39,787 INFO L225 Difference]: With dead ends: 478 [2021-10-29 00:04:39,787 INFO L226 Difference]: Without dead ends: 454 [2021-10-29 00:04:39,788 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2021-10-29 00:04:39,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-10-29 00:04:39,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2021-10-29 00:04:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 324 states have (on average 1.2901234567901234) internal successors, (418), 334 states have internal predecessors, (418), 78 states have call successors, (78), 32 states have call predecessors, (78), 37 states have return successors, (114), 74 states have call predecessors, (114), 73 states have call successors, (114) [2021-10-29 00:04:39,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 610 transitions. [2021-10-29 00:04:39,804 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 610 transitions. Word has length 108 [2021-10-29 00:04:39,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:39,805 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 610 transitions. [2021-10-29 00:04:39,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-10-29 00:04:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 610 transitions. [2021-10-29 00:04:39,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-10-29 00:04:39,807 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:39,808 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:39,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-29 00:04:39,808 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:39,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:39,809 INFO L85 PathProgramCache]: Analyzing trace with hash 986627049, now seen corresponding path program 1 times [2021-10-29 00:04:39,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:39,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807916390] [2021-10-29 00:04:39,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:39,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:39,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:39,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:40,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:40,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-29 00:04:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:40,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-29 00:04:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:40,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:40,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:40,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:40,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:40,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:40,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-10-29 00:04:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:40,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-10-29 00:04:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:40,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:40,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-10-29 00:04:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:40,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:40,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:40,528 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807916390] [2021-10-29 00:04:40,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807916390] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:40,529 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:40,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-29 00:04:40,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340901197] [2021-10-29 00:04:40,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-29 00:04:40,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:40,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-29 00:04:40,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2021-10-29 00:04:40,532 INFO L87 Difference]: Start difference. First operand 440 states and 610 transitions. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-10-29 00:04:41,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:41,862 INFO L93 Difference]: Finished difference Result 480 states and 674 transitions. [2021-10-29 00:04:41,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-29 00:04:41,862 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2021-10-29 00:04:41,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:41,866 INFO L225 Difference]: With dead ends: 480 [2021-10-29 00:04:41,866 INFO L226 Difference]: Without dead ends: 443 [2021-10-29 00:04:41,867 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2021-10-29 00:04:41,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-10-29 00:04:41,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 413. [2021-10-29 00:04:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 304 states have (on average 1.2664473684210527) internal successors, (385), 312 states have internal predecessors, (385), 75 states have call successors, (75), 32 states have call predecessors, (75), 33 states have return successors, (97), 69 states have call predecessors, (97), 70 states have call successors, (97) [2021-10-29 00:04:41,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 557 transitions. [2021-10-29 00:04:41,883 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 557 transitions. Word has length 109 [2021-10-29 00:04:41,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:41,884 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 557 transitions. [2021-10-29 00:04:41,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-10-29 00:04:41,884 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 557 transitions. [2021-10-29 00:04:41,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-10-29 00:04:41,887 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:41,887 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:41,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-29 00:04:41,888 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:41,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:41,888 INFO L85 PathProgramCache]: Analyzing trace with hash 358552163, now seen corresponding path program 1 times [2021-10-29 00:04:41,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:41,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382368695] [2021-10-29 00:04:41,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:41,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:42,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:42,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:42,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:42,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-10-29 00:04:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:42,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:42,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:42,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:42,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:42,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-29 00:04:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:42,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-29 00:04:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:42,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:42,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-29 00:04:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:42,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:42,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:42,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 00:04:42,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:42,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382368695] [2021-10-29 00:04:42,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382368695] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:42,288 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:42,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-29 00:04:42,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873956759] [2021-10-29 00:04:42,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-29 00:04:42,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:42,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-29 00:04:42,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-10-29 00:04:42,290 INFO L87 Difference]: Start difference. First operand 413 states and 557 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2021-10-29 00:04:43,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:43,118 INFO L93 Difference]: Finished difference Result 420 states and 559 transitions. [2021-10-29 00:04:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-29 00:04:43,118 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2021-10-29 00:04:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:43,121 INFO L225 Difference]: With dead ends: 420 [2021-10-29 00:04:43,121 INFO L226 Difference]: Without dead ends: 420 [2021-10-29 00:04:43,121 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-29 00:04:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-10-29 00:04:43,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 408. [2021-10-29 00:04:43,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 302 states have (on average 1.2483443708609272) internal successors, (377), 309 states have internal predecessors, (377), 71 states have call successors, (71), 32 states have call predecessors, (71), 34 states have return successors, (92), 67 states have call predecessors, (92), 66 states have call successors, (92) [2021-10-29 00:04:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 540 transitions. [2021-10-29 00:04:43,133 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 540 transitions. Word has length 121 [2021-10-29 00:04:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:43,134 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 540 transitions. [2021-10-29 00:04:43,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2021-10-29 00:04:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 540 transitions. [2021-10-29 00:04:43,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-10-29 00:04:43,137 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:43,137 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:43,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-29 00:04:43,137 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:43,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:43,138 INFO L85 PathProgramCache]: Analyzing trace with hash -618619876, now seen corresponding path program 1 times [2021-10-29 00:04:43,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:43,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228689632] [2021-10-29 00:04:43,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:43,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:43,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:43,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:43,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:43,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-10-29 00:04:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:43,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:43,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:43,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:43,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:43,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-29 00:04:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:43,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-29 00:04:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:43,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:43,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-29 00:04:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:43,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:43,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:43,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-10-29 00:04:43,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:43,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228689632] [2021-10-29 00:04:43,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228689632] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:43,466 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:43,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-29 00:04:43,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932643602] [2021-10-29 00:04:43,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-29 00:04:43,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:43,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-29 00:04:43,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-10-29 00:04:43,468 INFO L87 Difference]: Start difference. First operand 408 states and 540 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2021-10-29 00:04:44,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:44,190 INFO L93 Difference]: Finished difference Result 547 states and 788 transitions. [2021-10-29 00:04:44,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-29 00:04:44,191 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2021-10-29 00:04:44,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:44,193 INFO L225 Difference]: With dead ends: 547 [2021-10-29 00:04:44,194 INFO L226 Difference]: Without dead ends: 547 [2021-10-29 00:04:44,194 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-29 00:04:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-10-29 00:04:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 399. [2021-10-29 00:04:44,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 294 states have (on average 1.248299319727891) internal successors, (367), 301 states have internal predecessors, (367), 71 states have call successors, (71), 32 states have call predecessors, (71), 33 states have return successors, (91), 66 states have call predecessors, (91), 66 states have call successors, (91) [2021-10-29 00:04:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 529 transitions. [2021-10-29 00:04:44,207 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 529 transitions. Word has length 122 [2021-10-29 00:04:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:44,207 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 529 transitions. [2021-10-29 00:04:44,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2021-10-29 00:04:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 529 transitions. [2021-10-29 00:04:44,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-10-29 00:04:44,210 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:44,210 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:44,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-29 00:04:44,210 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:44,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:44,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1613788965, now seen corresponding path program 1 times [2021-10-29 00:04:44,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:44,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821251476] [2021-10-29 00:04:44,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:44,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:44,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:44,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:44,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:44,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-29 00:04:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:44,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-29 00:04:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:44,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:44,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:44,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:44,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:44,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:44,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-10-29 00:04:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:44,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-10-29 00:04:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:44,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-10-29 00:04:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:44,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:44,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-29 00:04:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:44,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:44,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:44,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821251476] [2021-10-29 00:04:44,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821251476] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:44,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:44,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-29 00:04:44,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132772884] [2021-10-29 00:04:44,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-29 00:04:44,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:44,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-29 00:04:44,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-10-29 00:04:44,885 INFO L87 Difference]: Start difference. First operand 399 states and 529 transitions. Second operand has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-10-29 00:04:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:47,650 INFO L93 Difference]: Finished difference Result 800 states and 1072 transitions. [2021-10-29 00:04:47,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-29 00:04:47,651 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 119 [2021-10-29 00:04:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:47,655 INFO L225 Difference]: With dead ends: 800 [2021-10-29 00:04:47,655 INFO L226 Difference]: Without dead ends: 743 [2021-10-29 00:04:47,657 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=377, Invalid=2929, Unknown=0, NotChecked=0, Total=3306 [2021-10-29 00:04:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2021-10-29 00:04:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 724. [2021-10-29 00:04:47,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 536 states have (on average 1.2182835820895523) internal successors, (653), 547 states have internal predecessors, (653), 130 states have call successors, (130), 57 states have call predecessors, (130), 57 states have return successors, (166), 120 states have call predecessors, (166), 122 states have call successors, (166) [2021-10-29 00:04:47,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 949 transitions. [2021-10-29 00:04:47,683 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 949 transitions. Word has length 119 [2021-10-29 00:04:47,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:47,684 INFO L470 AbstractCegarLoop]: Abstraction has 724 states and 949 transitions. [2021-10-29 00:04:47,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-10-29 00:04:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 949 transitions. [2021-10-29 00:04:47,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-10-29 00:04:47,687 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:47,687 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:47,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-29 00:04:47,688 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:47,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:47,688 INFO L85 PathProgramCache]: Analyzing trace with hash 708012953, now seen corresponding path program 1 times [2021-10-29 00:04:47,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:47,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717988329] [2021-10-29 00:04:47,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:47,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:47,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:47,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:47,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:47,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-29 00:04:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:48,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-29 00:04:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:48,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:48,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:48,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:48,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:48,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:48,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-10-29 00:04:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:48,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-10-29 00:04:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:48,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-10-29 00:04:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:48,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:48,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-29 00:04:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 00:04:48,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:48,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717988329] [2021-10-29 00:04:48,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717988329] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:48,359 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:48,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-29 00:04:48,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154098072] [2021-10-29 00:04:48,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-29 00:04:48,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:48,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-29 00:04:48,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-10-29 00:04:48,361 INFO L87 Difference]: Start difference. First operand 724 states and 949 transitions. Second operand has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-10-29 00:04:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:51,493 INFO L93 Difference]: Finished difference Result 741 states and 977 transitions. [2021-10-29 00:04:51,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-29 00:04:51,494 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 119 [2021-10-29 00:04:51,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:51,498 INFO L225 Difference]: With dead ends: 741 [2021-10-29 00:04:51,498 INFO L226 Difference]: Without dead ends: 684 [2021-10-29 00:04:51,500 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=341, Invalid=2209, Unknown=0, NotChecked=0, Total=2550 [2021-10-29 00:04:51,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-10-29 00:04:51,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 341. [2021-10-29 00:04:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 250 states have (on average 1.18) internal successors, (295), 255 states have internal predecessors, (295), 64 states have call successors, (64), 29 states have call predecessors, (64), 26 states have return successors, (77), 56 states have call predecessors, (77), 58 states have call successors, (77) [2021-10-29 00:04:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 436 transitions. [2021-10-29 00:04:51,516 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 436 transitions. Word has length 119 [2021-10-29 00:04:51,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:51,517 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 436 transitions. [2021-10-29 00:04:51,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-10-29 00:04:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 436 transitions. [2021-10-29 00:04:51,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-10-29 00:04:51,520 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:51,520 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:51,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-29 00:04:51,521 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:51,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:51,521 INFO L85 PathProgramCache]: Analyzing trace with hash -292170069, now seen corresponding path program 1 times [2021-10-29 00:04:51,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:51,522 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328800365] [2021-10-29 00:04:51,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:51,522 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-10-29 00:04:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-29 00:04:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-29 00:04:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-29 00:04:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-10-29 00:04:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-10-29 00:04:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-10-29 00:04:51,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:51,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328800365] [2021-10-29 00:04:51,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328800365] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-29 00:04:51,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932732160] [2021-10-29 00:04:51,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:51,962 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-29 00:04:51,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-29 00:04:51,965 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-29 00:04:52,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-29 00:04:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:52,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 1359 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-29 00:04:52,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 00:04:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-10-29 00:04:53,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932732160] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:53,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-29 00:04:53,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 15 [2021-10-29 00:04:53,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841090372] [2021-10-29 00:04:53,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 00:04:53,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:53,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 00:04:53,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-10-29 00:04:53,024 INFO L87 Difference]: Start difference. First operand 341 states and 436 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2021-10-29 00:04:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:53,082 INFO L93 Difference]: Finished difference Result 374 states and 483 transitions. [2021-10-29 00:04:53,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 00:04:53,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 163 [2021-10-29 00:04:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:53,085 INFO L225 Difference]: With dead ends: 374 [2021-10-29 00:04:53,086 INFO L226 Difference]: Without dead ends: 372 [2021-10-29 00:04:53,086 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-10-29 00:04:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-10-29 00:04:53,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 361. [2021-10-29 00:04:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 268 states have (on average 1.1679104477611941) internal successors, (313), 273 states have internal predecessors, (313), 64 states have call successors, (64), 29 states have call predecessors, (64), 28 states have return successors, (88), 58 states have call predecessors, (88), 58 states have call successors, (88) [2021-10-29 00:04:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 465 transitions. [2021-10-29 00:04:53,098 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 465 transitions. Word has length 163 [2021-10-29 00:04:53,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:53,099 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 465 transitions. [2021-10-29 00:04:53,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2021-10-29 00:04:53,099 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 465 transitions. [2021-10-29 00:04:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-10-29 00:04:53,102 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:53,102 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:53,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-29 00:04:53,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-10-29 00:04:53,319 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:53,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1488612663, now seen corresponding path program 1 times [2021-10-29 00:04:53,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:53,320 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383057225] [2021-10-29 00:04:53,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:53,320 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-10-29 00:04:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-29 00:04:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-29 00:04:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-29 00:04:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-29 00:04:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-10-29 00:04:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:53,790 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-10-29 00:04:53,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:53,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383057225] [2021-10-29 00:04:53,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383057225] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:53,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:53,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-29 00:04:53,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762685023] [2021-10-29 00:04:53,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-29 00:04:53,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:53,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-29 00:04:53,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-10-29 00:04:53,793 INFO L87 Difference]: Start difference. First operand 361 states and 465 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2021-10-29 00:04:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:54,600 INFO L93 Difference]: Finished difference Result 388 states and 505 transitions. [2021-10-29 00:04:54,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-29 00:04:54,601 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) Word has length 164 [2021-10-29 00:04:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:54,603 INFO L225 Difference]: With dead ends: 388 [2021-10-29 00:04:54,603 INFO L226 Difference]: Without dead ends: 388 [2021-10-29 00:04:54,603 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-29 00:04:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-10-29 00:04:54,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 363. [2021-10-29 00:04:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 270 states have (on average 1.1666666666666667) internal successors, (315), 275 states have internal predecessors, (315), 64 states have call successors, (64), 29 states have call predecessors, (64), 28 states have return successors, (88), 58 states have call predecessors, (88), 58 states have call successors, (88) [2021-10-29 00:04:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 467 transitions. [2021-10-29 00:04:54,614 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 467 transitions. Word has length 164 [2021-10-29 00:04:54,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:54,615 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 467 transitions. [2021-10-29 00:04:54,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2021-10-29 00:04:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 467 transitions. [2021-10-29 00:04:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-10-29 00:04:54,618 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:54,619 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:54,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-29 00:04:54,619 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:54,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:54,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1456464136, now seen corresponding path program 1 times [2021-10-29 00:04:54,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:54,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491667355] [2021-10-29 00:04:54,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:54,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-10-29 00:04:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-29 00:04:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-29 00:04:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-29 00:04:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-29 00:04:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:54,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-10-29 00:04:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-10-29 00:04:55,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:55,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491667355] [2021-10-29 00:04:55,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491667355] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:55,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:55,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-29 00:04:55,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98752540] [2021-10-29 00:04:55,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-29 00:04:55,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:55,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-29 00:04:55,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-10-29 00:04:55,022 INFO L87 Difference]: Start difference. First operand 363 states and 467 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (19), 11 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-10-29 00:04:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:55,479 INFO L93 Difference]: Finished difference Result 369 states and 477 transitions. [2021-10-29 00:04:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-29 00:04:55,479 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (19), 11 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2021-10-29 00:04:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:55,481 INFO L225 Difference]: With dead ends: 369 [2021-10-29 00:04:55,481 INFO L226 Difference]: Without dead ends: 369 [2021-10-29 00:04:55,482 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2021-10-29 00:04:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-10-29 00:04:55,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 363. [2021-10-29 00:04:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 270 states have (on average 1.1592592592592592) internal successors, (313), 275 states have internal predecessors, (313), 64 states have call successors, (64), 29 states have call predecessors, (64), 28 states have return successors, (88), 58 states have call predecessors, (88), 58 states have call successors, (88) [2021-10-29 00:04:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 465 transitions. [2021-10-29 00:04:55,497 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 465 transitions. Word has length 164 [2021-10-29 00:04:55,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:55,498 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 465 transitions. [2021-10-29 00:04:55,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (19), 11 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-10-29 00:04:55,498 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 465 transitions. [2021-10-29 00:04:55,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-10-29 00:04:55,501 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:55,502 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:55,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-29 00:04:55,505 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:55,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:55,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1734693448, now seen corresponding path program 1 times [2021-10-29 00:04:55,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:55,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196476295] [2021-10-29 00:04:55,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:55,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-10-29 00:04:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-29 00:04:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-29 00:04:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-29 00:04:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-29 00:04:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:55,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-10-29 00:04:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:56,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:56,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:56,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:56,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-10-29 00:04:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:56,027 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-10-29 00:04:56,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:56,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196476295] [2021-10-29 00:04:56,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196476295] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:56,028 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:56,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-29 00:04:56,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80761634] [2021-10-29 00:04:56,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-29 00:04:56,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:56,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-29 00:04:56,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-10-29 00:04:56,030 INFO L87 Difference]: Start difference. First operand 363 states and 465 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (20), 11 states have call predecessors, (20), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-10-29 00:04:56,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:56,731 INFO L93 Difference]: Finished difference Result 428 states and 566 transitions. [2021-10-29 00:04:56,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-29 00:04:56,732 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (20), 11 states have call predecessors, (20), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 172 [2021-10-29 00:04:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:56,735 INFO L225 Difference]: With dead ends: 428 [2021-10-29 00:04:56,735 INFO L226 Difference]: Without dead ends: 428 [2021-10-29 00:04:56,735 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-29 00:04:56,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-10-29 00:04:56,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 345. [2021-10-29 00:04:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 256 states have (on average 1.14453125) internal successors, (293), 260 states have internal predecessors, (293), 60 states have call successors, (60), 29 states have call predecessors, (60), 28 states have return successors, (80), 55 states have call predecessors, (80), 54 states have call successors, (80) [2021-10-29 00:04:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 433 transitions. [2021-10-29 00:04:56,747 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 433 transitions. Word has length 172 [2021-10-29 00:04:56,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:56,748 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 433 transitions. [2021-10-29 00:04:56,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (20), 11 states have call predecessors, (20), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-10-29 00:04:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 433 transitions. [2021-10-29 00:04:56,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-10-29 00:04:56,752 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:56,753 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:56,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-29 00:04:56,753 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:56,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:56,754 INFO L85 PathProgramCache]: Analyzing trace with hash 405901981, now seen corresponding path program 1 times [2021-10-29 00:04:56,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:56,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913506836] [2021-10-29 00:04:56,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:56,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:56,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:56,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:56,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-10-29 00:04:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-29 00:04:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-29 00:04:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-29 00:04:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-29 00:04:57,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-10-29 00:04:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-10-29 00:04:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-10-29 00:04:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2021-10-29 00:04:57,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:57,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913506836] [2021-10-29 00:04:57,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913506836] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:57,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:57,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-29 00:04:57,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352118497] [2021-10-29 00:04:57,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-29 00:04:57,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:57,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-29 00:04:57,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-10-29 00:04:57,276 INFO L87 Difference]: Start difference. First operand 345 states and 433 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2021-10-29 00:04:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:57,737 INFO L93 Difference]: Finished difference Result 354 states and 451 transitions. [2021-10-29 00:04:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-29 00:04:57,738 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) Word has length 204 [2021-10-29 00:04:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:57,740 INFO L225 Difference]: With dead ends: 354 [2021-10-29 00:04:57,740 INFO L226 Difference]: Without dead ends: 354 [2021-10-29 00:04:57,740 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-29 00:04:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-10-29 00:04:57,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 309. [2021-10-29 00:04:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 231 states have (on average 1.1255411255411256) internal successors, (260), 234 states have internal predecessors, (260), 52 states have call successors, (52), 24 states have call predecessors, (52), 25 states have return successors, (73), 50 states have call predecessors, (73), 47 states have call successors, (73) [2021-10-29 00:04:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 385 transitions. [2021-10-29 00:04:57,747 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 385 transitions. Word has length 204 [2021-10-29 00:04:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:57,748 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 385 transitions. [2021-10-29 00:04:57,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2021-10-29 00:04:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 385 transitions. [2021-10-29 00:04:57,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-10-29 00:04:57,751 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 00:04:57,751 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:57,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-29 00:04:57,752 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-29 00:04:57,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 00:04:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2083081796, now seen corresponding path program 1 times [2021-10-29 00:04:57,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-29 00:04:57,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272196027] [2021-10-29 00:04:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 00:04:57,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 00:04:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-29 00:04:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-29 00:04:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-29 00:04:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:57,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-10-29 00:04:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-29 00:04:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:58,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-29 00:04:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-29 00:04:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-29 00:04:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-29 00:04:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-10-29 00:04:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-10-29 00:04:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-10-29 00:04:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-29 00:04:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-29 00:04:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-29 00:04:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 00:04:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2021-10-29 00:04:58,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-29 00:04:58,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272196027] [2021-10-29 00:04:58,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272196027] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 00:04:58,219 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 00:04:58,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-29 00:04:58,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867097796] [2021-10-29 00:04:58,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-29 00:04:58,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-29 00:04:58,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-29 00:04:58,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-10-29 00:04:58,221 INFO L87 Difference]: Start difference. First operand 309 states and 385 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2021-10-29 00:04:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 00:04:59,019 INFO L93 Difference]: Finished difference Result 290 states and 362 transitions. [2021-10-29 00:04:59,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-29 00:04:59,020 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) Word has length 207 [2021-10-29 00:04:59,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 00:04:59,021 INFO L225 Difference]: With dead ends: 290 [2021-10-29 00:04:59,021 INFO L226 Difference]: Without dead ends: 0 [2021-10-29 00:04:59,021 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-29 00:04:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-29 00:04:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-29 00:04:59,022 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) [2021-10-29 00:04:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-29 00:04:59,022 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2021-10-29 00:04:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 00:04:59,022 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 00:04:59,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2021-10-29 00:04:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-29 00:04:59,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-29 00:04:59,025 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-10-29 00:04:59,025 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 00:04:59,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-29 00:04:59,028 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 00:04:59,030 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 00:04:59,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 12:04:59 BoogieIcfgContainer [2021-10-29 00:04:59,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 00:04:59,032 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 00:04:59,032 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 00:04:59,033 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 00:04:59,033 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 12:03:30" (3/4) ... [2021-10-29 00:04:59,036 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-29 00:04:59,042 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-10-29 00:04:59,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2021-10-29 00:04:59,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-10-29 00:04:59,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSyncFilterWithTarget [2021-10-29 00:04:59,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2021-10-29 00:04:59,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2021-10-29 00:04:59,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPower [2021-10-29 00:04:59,044 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2021-10-29 00:04:59,044 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-10-29 00:04:59,044 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2021-10-29 00:04:59,044 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2021-10-29 00:04:59,044 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2021-10-29 00:04:59,044 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSendToNextDriver [2021-10-29 00:04:59,044 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfStartDevice [2021-10-29 00:04:59,045 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2021-10-29 00:04:59,045 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRegisterDevice [2021-10-29 00:04:59,045 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDeviceControl [2021-10-29 00:04:59,045 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-10-29 00:04:59,045 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRemoveDevice [2021-10-29 00:04:59,045 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfCreate [2021-10-29 00:04:59,046 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfUnload [2021-10-29 00:04:59,046 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2021-10-29 00:04:59,046 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-10-29 00:04:59,046 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2021-10-29 00:04:59,046 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPnp [2021-10-29 00:04:59,046 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-10-29 00:04:59,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfShutdownFlush [2021-10-29 00:04:59,075 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 63 nodes and edges [2021-10-29 00:04:59,078 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2021-10-29 00:04:59,081 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-29 00:04:59,084 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-29 00:04:59,308 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-29 00:04:59,308 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 00:04:59,310 INFO L168 Benchmark]: Toolchain (without parser) took 90681.80 ms. Allocated memory was 90.2 MB in the beginning and 293.6 MB in the end (delta: 203.4 MB). Free memory was 68.8 MB in the beginning and 131.1 MB in the end (delta: -62.3 MB). Peak memory consumption was 139.8 MB. Max. memory is 16.1 GB. [2021-10-29 00:04:59,311 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 90.2 MB. Free memory is still 65.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 00:04:59,312 INFO L168 Benchmark]: CACSL2BoogieTranslator took 610.02 ms. Allocated memory is still 90.2 MB. Free memory was 68.6 MB in the beginning and 56.7 MB in the end (delta: 11.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 00:04:59,312 INFO L168 Benchmark]: Boogie Preprocessor took 108.29 ms. Allocated memory is still 90.2 MB. Free memory was 56.7 MB in the beginning and 53.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 00:04:59,312 INFO L168 Benchmark]: RCFGBuilder took 1311.68 ms. Allocated memory was 90.2 MB in the beginning and 111.1 MB in the end (delta: 21.0 MB). Free memory was 53.0 MB in the beginning and 69.5 MB in the end (delta: -16.5 MB). Peak memory consumption was 34.3 MB. Max. memory is 16.1 GB. [2021-10-29 00:04:59,313 INFO L168 Benchmark]: TraceAbstraction took 88368.80 ms. Allocated memory was 111.1 MB in the beginning and 293.6 MB in the end (delta: 182.5 MB). Free memory was 69.5 MB in the beginning and 152.1 MB in the end (delta: -82.6 MB). Peak memory consumption was 98.9 MB. Max. memory is 16.1 GB. [2021-10-29 00:04:59,313 INFO L168 Benchmark]: Witness Printer took 276.05 ms. Allocated memory is still 293.6 MB. Free memory was 151.0 MB in the beginning and 131.1 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-29 00:04:59,315 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.31 ms. Allocated memory is still 90.2 MB. Free memory is still 65.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 610.02 ms. Allocated memory is still 90.2 MB. Free memory was 68.6 MB in the beginning and 56.7 MB in the end (delta: 11.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 108.29 ms. Allocated memory is still 90.2 MB. Free memory was 56.7 MB in the beginning and 53.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1311.68 ms. Allocated memory was 90.2 MB in the beginning and 111.1 MB in the end (delta: 21.0 MB). Free memory was 53.0 MB in the beginning and 69.5 MB in the end (delta: -16.5 MB). Peak memory consumption was 34.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 88368.80 ms. Allocated memory was 111.1 MB in the beginning and 293.6 MB in the end (delta: 182.5 MB). Free memory was 69.5 MB in the beginning and 152.1 MB in the end (delta: -82.6 MB). Peak memory consumption was 98.9 MB. Max. memory is 16.1 GB. * Witness Printer took 276.05 ms. Allocated memory is still 293.6 MB. Free memory was 151.0 MB in the beginning and 131.1 MB in the end (delta: 19.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * 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: 647]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 56]: 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 28 procedures, 299 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 88.3s, OverallIterations: 51, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 66.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 14087 SDtfs, 15533 SDslu, 43658 SDs, 0 SdLazy, 55794 SolverSat, 7490 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 45.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1756 GetRequests, 927 SyntacticMatches, 0 SemanticMatches, 829 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2875 ImplicationChecksByTransitivity, 19.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1085occurred in iteration=8, InterpolantAutomatonStates: 656, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 51 MinimizatonAttempts, 2877 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 4057 NumberOfCodeBlocks, 4057 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 4005 ConstructedInterpolants, 0 QuantifiedInterpolants, 17077 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1359 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 52 InterpolantComputations, 51 PerfectInterpolantSequences, 851/857 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-29 00:04:59,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f7fea64e-a012-414d-ae54-db5ad0c9c37b/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...