./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 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt --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 4df6794b9b3a948996212d63f7c149439c613ff1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 01:18:25,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 01:18:25,369 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 01:18:25,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 01:18:25,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 01:18:25,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 01:18:25,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 01:18:25,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 01:18:25,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 01:18:25,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 01:18:25,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 01:18:25,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 01:18:25,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 01:18:25,474 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 01:18:25,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 01:18:25,484 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 01:18:25,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 01:18:25,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 01:18:25,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 01:18:25,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 01:18:25,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 01:18:25,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 01:18:25,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 01:18:25,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 01:18:25,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 01:18:25,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 01:18:25,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 01:18:25,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 01:18:25,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 01:18:25,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 01:18:25,525 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 01:18:25,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 01:18:25,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 01:18:25,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 01:18:25,532 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 01:18:25,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 01:18:25,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 01:18:25,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 01:18:25,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 01:18:25,536 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 01:18:25,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 01:18:25,538 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-10-13 01:18:25,602 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 01:18:25,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 01:18:25,603 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 01:18:25,603 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 01:18:25,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 01:18:25,610 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 01:18:25,611 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 01:18:25,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 01:18:25,611 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 01:18:25,612 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 01:18:25,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 01:18:25,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 01:18:25,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 01:18:25,614 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 01:18:25,614 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 01:18:25,615 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-13 01:18:25,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 01:18:25,615 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 01:18:25,615 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 01:18:25,616 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 01:18:25,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 01:18:25,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 01:18:25,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 01:18:25,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:18:25,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 01:18:25,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 01:18:25,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 01:18:25,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 01:18:25,619 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 01:18:25,621 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_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/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_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt 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 -> 4df6794b9b3a948996212d63f7c149439c613ff1 [2021-10-13 01:18:25,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 01:18:26,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 01:18:26,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 01:18:26,030 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 01:18:26,031 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 01:18:26,032 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-10-13 01:18:26,130 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/data/f8f718e60/4a84012815f84383b09dc455a5f09505/FLAG8d95ac330 [2021-10-13 01:18:26,843 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 01:18:26,843 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-10-13 01:18:26,860 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/data/f8f718e60/4a84012815f84383b09dc455a5f09505/FLAG8d95ac330 [2021-10-13 01:18:27,136 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/data/f8f718e60/4a84012815f84383b09dc455a5f09505 [2021-10-13 01:18:27,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 01:18:27,140 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-13 01:18:27,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 01:18:27,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 01:18:27,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 01:18:27,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:18:27" (1/1) ... [2021-10-13 01:18:27,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a81f8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:18:27, skipping insertion in model container [2021-10-13 01:18:27,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:18:27" (1/1) ... [2021-10-13 01:18:27,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 01:18:27,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 01:18:27,497 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_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2021-10-13 01:18:27,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:18:27,758 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 01:18:27,802 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_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2021-10-13 01:18:27,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:18:27,925 INFO L208 MainTranslator]: Completed translation [2021-10-13 01:18:27,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:18:27 WrapperNode [2021-10-13 01:18:27,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 01:18:27,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 01:18:27,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 01:18:27,928 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 01:18:27,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:18:27" (1/1) ... [2021-10-13 01:18:27,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:18:27" (1/1) ... [2021-10-13 01:18:27,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:18:27" (1/1) ... [2021-10-13 01:18:27,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:18:27" (1/1) ... [2021-10-13 01:18:27,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:18:27" (1/1) ... [2021-10-13 01:18:28,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:18:27" (1/1) ... [2021-10-13 01:18:28,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:18:27" (1/1) ... [2021-10-13 01:18:28,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 01:18:28,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 01:18:28,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 01:18:28,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 01:18:28,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:18:27" (1/1) ... [2021-10-13 01:18:28,093 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:18:28,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:18:28,148 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 01:18:28,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 01:18:28,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-13 01:18:28,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 01:18:28,227 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-13 01:18:28,228 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-10-13 01:18:28,228 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2021-10-13 01:18:28,229 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2021-10-13 01:18:28,229 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2021-10-13 01:18:28,230 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2021-10-13 01:18:28,230 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2021-10-13 01:18:28,231 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2021-10-13 01:18:28,231 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2021-10-13 01:18:28,231 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2021-10-13 01:18:28,231 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2021-10-13 01:18:28,232 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2021-10-13 01:18:28,232 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2021-10-13 01:18:28,232 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2021-10-13 01:18:28,232 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2021-10-13 01:18:28,232 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2021-10-13 01:18:28,233 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2021-10-13 01:18:28,233 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2021-10-13 01:18:28,233 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-13 01:18:28,233 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2021-10-13 01:18:28,233 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-10-13 01:18:28,234 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-10-13 01:18:28,234 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-10-13 01:18:28,234 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2021-10-13 01:18:28,234 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-10-13 01:18:28,234 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2021-10-13 01:18:28,234 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-13 01:18:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-13 01:18:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-13 01:18:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 01:18:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-10-13 01:18:28,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-13 01:18:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2021-10-13 01:18:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2021-10-13 01:18:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2021-10-13 01:18:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2021-10-13 01:18:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2021-10-13 01:18:28,236 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2021-10-13 01:18:28,237 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2021-10-13 01:18:28,237 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2021-10-13 01:18:28,237 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2021-10-13 01:18:28,237 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2021-10-13 01:18:28,237 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2021-10-13 01:18:28,238 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2021-10-13 01:18:28,238 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2021-10-13 01:18:28,238 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2021-10-13 01:18:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-10-13 01:18:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2021-10-13 01:18:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-10-13 01:18:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2021-10-13 01:18:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-10-13 01:18:28,240 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-10-13 01:18:28,240 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2021-10-13 01:18:28,240 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2021-10-13 01:18:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2021-10-13 01:18:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2021-10-13 01:18:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-13 01:18:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-10-13 01:18:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-13 01:18:28,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 01:18:28,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 01:18:28,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 01:18:28,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 01:18:28,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 01:18:28,703 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 01:18:28,895 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-10-13 01:18:28,897 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-10-13 01:18:28,914 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 01:18:28,976 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2021-10-13 01:18:28,976 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2021-10-13 01:18:29,013 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 01:18:29,036 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-10-13 01:18:29,037 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-10-13 01:18:29,048 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 01:18:29,073 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-13 01:18:29,073 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-13 01:18:29,298 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 01:18:29,344 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-10-13 01:18:29,344 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-10-13 01:18:29,420 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-13 01:18:29,500 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2021-10-13 01:18:29,500 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2021-10-13 01:18:29,578 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 01:18:29,578 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-10-13 01:18:29,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:18:29 BoogieIcfgContainer [2021-10-13 01:18:29,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 01:18:29,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 01:18:29,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 01:18:29,589 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 01:18:29,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:18:27" (1/3) ... [2021-10-13 01:18:29,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230c7952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:18:29, skipping insertion in model container [2021-10-13 01:18:29,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:18:27" (2/3) ... [2021-10-13 01:18:29,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230c7952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:18:29, skipping insertion in model container [2021-10-13 01:18:29,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:18:29" (3/3) ... [2021-10-13 01:18:29,593 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2021-10-13 01:18:29,600 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 01:18:29,600 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-13 01:18:29,649 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 01:18:29,657 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, mConcurrency=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-13 01:18:29,657 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-13 01:18:29,690 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-13 01:18:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 01:18:29,700 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:29,700 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 01:18:29,701 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:29,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:29,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1560408711, now seen corresponding path program 1 times [2021-10-13 01:18:29,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:29,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716930166] [2021-10-13 01:18:29,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:29,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:30,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:30,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:30,269 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-13 01:18:30,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:18:30,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716930166] [2021-10-13 01:18:30,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716930166] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:18:30,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:18:30,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:18:30,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731732401] [2021-10-13 01:18:30,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:18:30,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:18:30,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:18:30,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:18:30,302 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-13 01:18:31,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:18:31,403 INFO L93 Difference]: Finished difference Result 332 states and 459 transitions. [2021-10-13 01:18:31,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:18:31,407 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-13 01:18:31,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:18:31,435 INFO L225 Difference]: With dead ends: 332 [2021-10-13 01:18:31,436 INFO L226 Difference]: Without dead ends: 326 [2021-10-13 01:18:31,447 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 162.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:18:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-10-13 01:18:31,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2021-10-13 01:18:31,585 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-13 01:18:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 384 transitions. [2021-10-13 01:18:31,591 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 384 transitions. Word has length 15 [2021-10-13 01:18:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:18:31,592 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 384 transitions. [2021-10-13 01:18:31,592 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-13 01:18:31,592 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 384 transitions. [2021-10-13 01:18:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 01:18:31,593 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:31,593 INFO L512 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-13 01:18:31,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 01:18:31,594 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:31,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:31,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1302515818, now seen corresponding path program 1 times [2021-10-13 01:18:31,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:31,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847136251] [2021-10-13 01:18:31,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:31,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:31,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:31,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:31,892 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-13 01:18:31,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:18:31,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847136251] [2021-10-13 01:18:31,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847136251] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:18:31,897 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:18:31,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 01:18:31,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991997185] [2021-10-13 01:18:31,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:18:31,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:18:31,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:18:31,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:18:31,905 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-13 01:18:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:18:33,208 INFO L93 Difference]: Finished difference Result 331 states and 451 transitions. [2021-10-13 01:18:33,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:18:33,209 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-13 01:18:33,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:18:33,220 INFO L225 Difference]: With dead ends: 331 [2021-10-13 01:18:33,221 INFO L226 Difference]: Without dead ends: 326 [2021-10-13 01:18:33,222 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 227.4ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:18:33,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-10-13 01:18:33,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2021-10-13 01:18:33,257 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-13 01:18:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2021-10-13 01:18:33,261 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2021-10-13 01:18:33,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:18:33,262 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2021-10-13 01:18:33,262 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-13 01:18:33,262 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2021-10-13 01:18:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 01:18:33,263 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:33,264 INFO L512 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-13 01:18:33,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 01:18:33,264 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:33,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:33,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1551281276, now seen corresponding path program 1 times [2021-10-13 01:18:33,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:33,266 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489307703] [2021-10-13 01:18:33,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:33,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:33,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:33,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:33,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:18:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:33,675 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-13 01:18:33,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:18:33,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489307703] [2021-10-13 01:18:33,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489307703] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:18:33,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:18:33,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 01:18:33,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764939720] [2021-10-13 01:18:33,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:18:33,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:18:33,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:18:33,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:18:33,681 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-13 01:18:35,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:18:35,794 INFO L93 Difference]: Finished difference Result 508 states and 702 transitions. [2021-10-13 01:18:35,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:18:35,795 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-13 01:18:35,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:18:35,802 INFO L225 Difference]: With dead ends: 508 [2021-10-13 01:18:35,802 INFO L226 Difference]: Without dead ends: 507 [2021-10-13 01:18:35,802 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 327.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:18:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-10-13 01:18:35,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 440. [2021-10-13 01:18:35,834 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-13 01:18:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 608 transitions. [2021-10-13 01:18:35,841 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 608 transitions. Word has length 25 [2021-10-13 01:18:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:18:35,841 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 608 transitions. [2021-10-13 01:18:35,842 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-13 01:18:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 608 transitions. [2021-10-13 01:18:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-13 01:18:35,845 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:35,845 INFO L512 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-13 01:18:35,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 01:18:35,846 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:35,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:35,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1085614475, now seen corresponding path program 1 times [2021-10-13 01:18:35,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:35,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724977874] [2021-10-13 01:18:35,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:35,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:36,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:36,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:36,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:18:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:36,130 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-13 01:18:36,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:18:36,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724977874] [2021-10-13 01:18:36,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724977874] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:18:36,131 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:18:36,131 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 01:18:36,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954563230] [2021-10-13 01:18:36,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:18:36,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:18:36,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:18:36,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:18:36,134 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-13 01:18:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:18:38,093 INFO L93 Difference]: Finished difference Result 690 states and 979 transitions. [2021-10-13 01:18:38,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:18:38,094 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-13 01:18:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:18:38,102 INFO L225 Difference]: With dead ends: 690 [2021-10-13 01:18:38,102 INFO L226 Difference]: Without dead ends: 690 [2021-10-13 01:18:38,102 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 237.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:18:38,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-10-13 01:18:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 618. [2021-10-13 01:18:38,143 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-13 01:18:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 888 transitions. [2021-10-13 01:18:38,152 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 888 transitions. Word has length 31 [2021-10-13 01:18:38,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:18:38,152 INFO L470 AbstractCegarLoop]: Abstraction has 618 states and 888 transitions. [2021-10-13 01:18:38,153 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-13 01:18:38,153 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 888 transitions. [2021-10-13 01:18:38,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-13 01:18:38,156 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:38,157 INFO L512 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-13 01:18:38,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 01:18:38,157 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:38,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:38,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1025634350, now seen corresponding path program 1 times [2021-10-13 01:18:38,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:38,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743291282] [2021-10-13 01:18:38,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:38,160 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:38,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:38,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:38,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:18:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:38,433 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-13 01:18:38,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:18:38,433 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743291282] [2021-10-13 01:18:38,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743291282] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:18:38,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:18:38,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 01:18:38,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562720017] [2021-10-13 01:18:38,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:18:38,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:18:38,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:18:38,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:18:38,437 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-13 01:18:39,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:18:39,548 INFO L93 Difference]: Finished difference Result 661 states and 947 transitions. [2021-10-13 01:18:39,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:18:39,549 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-13 01:18:39,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:18:39,555 INFO L225 Difference]: With dead ends: 661 [2021-10-13 01:18:39,556 INFO L226 Difference]: Without dead ends: 661 [2021-10-13 01:18:39,556 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 257.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:18:39,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2021-10-13 01:18:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2021-10-13 01:18:39,607 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-13 01:18:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 901 transitions. [2021-10-13 01:18:39,619 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 901 transitions. Word has length 36 [2021-10-13 01:18:39,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:18:39,620 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 901 transitions. [2021-10-13 01:18:39,620 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-13 01:18:39,621 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 901 transitions. [2021-10-13 01:18:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 01:18:39,628 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:39,628 INFO L512 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-13 01:18:39,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 01:18:39,629 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:39,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:39,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1273733766, now seen corresponding path program 1 times [2021-10-13 01:18:39,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:39,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348447294] [2021-10-13 01:18:39,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:39,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:39,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:39,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:39,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:18:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:39,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-13 01:18:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:18:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:40,056 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-13 01:18:40,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:18:40,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348447294] [2021-10-13 01:18:40,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348447294] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:18:40,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:18:40,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-13 01:18:40,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353424758] [2021-10-13 01:18:40,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 01:18:40,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:18:40,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 01:18:40,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:18:40,060 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-13 01:18:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:18:41,816 INFO L93 Difference]: Finished difference Result 705 states and 1000 transitions. [2021-10-13 01:18:41,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 01:18:41,818 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-13 01:18:41,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:18:41,827 INFO L225 Difference]: With dead ends: 705 [2021-10-13 01:18:41,827 INFO L226 Difference]: Without dead ends: 705 [2021-10-13 01:18:41,828 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 614.5ms TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-10-13 01:18:41,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-10-13 01:18:41,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2021-10-13 01:18:41,865 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-13 01:18:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 936 transitions. [2021-10-13 01:18:41,873 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 936 transitions. Word has length 39 [2021-10-13 01:18:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:18:41,874 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 936 transitions. [2021-10-13 01:18:41,875 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-13 01:18:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 936 transitions. [2021-10-13 01:18:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 01:18:41,879 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:41,880 INFO L512 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-13 01:18:41,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 01:18:41,880 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:41,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:41,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1267590478, now seen corresponding path program 1 times [2021-10-13 01:18:41,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:41,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183938570] [2021-10-13 01:18:41,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:41,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:42,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:42,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:42,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:18:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:42,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-13 01:18:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:42,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:18:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:42,317 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-13 01:18:42,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:18:42,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183938570] [2021-10-13 01:18:42,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183938570] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:18:42,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:18:42,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-13 01:18:42,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572879765] [2021-10-13 01:18:42,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 01:18:42,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:18:42,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 01:18:42,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:18:42,321 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-13 01:18:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:18:44,621 INFO L93 Difference]: Finished difference Result 705 states and 999 transitions. [2021-10-13 01:18:44,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 01:18:44,622 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-13 01:18:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:18:44,629 INFO L225 Difference]: With dead ends: 705 [2021-10-13 01:18:44,630 INFO L226 Difference]: Without dead ends: 705 [2021-10-13 01:18:44,631 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 615.7ms TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-10-13 01:18:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-10-13 01:18:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2021-10-13 01:18:44,661 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-13 01:18:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 935 transitions. [2021-10-13 01:18:44,671 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 935 transitions. Word has length 40 [2021-10-13 01:18:44,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:18:44,673 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 935 transitions. [2021-10-13 01:18:44,673 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-13 01:18:44,674 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 935 transitions. [2021-10-13 01:18:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-13 01:18:44,675 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:44,676 INFO L512 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-13 01:18:44,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 01:18:44,676 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:44,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:44,677 INFO L82 PathProgramCache]: Analyzing trace with hash -908144207, now seen corresponding path program 1 times [2021-10-13 01:18:44,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:44,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577541317] [2021-10-13 01:18:44,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:44,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:44,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:44,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:44,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:18:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:44,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-13 01:18:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:44,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:18:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:44,919 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-13 01:18:44,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:18:44,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577541317] [2021-10-13 01:18:44,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577541317] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:18:44,921 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:18:44,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 01:18:44,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704465043] [2021-10-13 01:18:44,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 01:18:44,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:18:44,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 01:18:44,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:18:44,923 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-13 01:18:46,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:18:46,447 INFO L93 Difference]: Finished difference Result 1186 states and 1741 transitions. [2021-10-13 01:18:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 01:18:46,448 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-13 01:18:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:18:46,460 INFO L225 Difference]: With dead ends: 1186 [2021-10-13 01:18:46,460 INFO L226 Difference]: Without dead ends: 1186 [2021-10-13 01:18:46,461 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 261.3ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:18:46,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2021-10-13 01:18:46,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1085. [2021-10-13 01:18:46,509 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-13 01:18:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1602 transitions. [2021-10-13 01:18:46,522 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1602 transitions. Word has length 41 [2021-10-13 01:18:46,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:18:46,524 INFO L470 AbstractCegarLoop]: Abstraction has 1085 states and 1602 transitions. [2021-10-13 01:18:46,525 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-13 01:18:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1602 transitions. [2021-10-13 01:18:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-13 01:18:46,528 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:46,528 INFO L512 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-13 01:18:46,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 01:18:46,529 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:46,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:46,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1920333946, now seen corresponding path program 1 times [2021-10-13 01:18:46,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:46,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480162002] [2021-10-13 01:18:46,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:46,531 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:46,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:46,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:18:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:46,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-13 01:18:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:46,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:18:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:46,802 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-13 01:18:46,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:18:46,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480162002] [2021-10-13 01:18:46,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480162002] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:18:46,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:18:46,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 01:18:46,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249330675] [2021-10-13 01:18:46,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 01:18:46,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:18:46,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 01:18:46,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-13 01:18:46,814 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-13 01:18:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:18:48,365 INFO L93 Difference]: Finished difference Result 1167 states and 1721 transitions. [2021-10-13 01:18:48,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 01:18:48,366 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-13 01:18:48,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:18:48,379 INFO L225 Difference]: With dead ends: 1167 [2021-10-13 01:18:48,379 INFO L226 Difference]: Without dead ends: 1148 [2021-10-13 01:18:48,380 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 161.7ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-13 01:18:48,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2021-10-13 01:18:48,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1078. [2021-10-13 01:18:48,429 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-13 01:18:48,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1593 transitions. [2021-10-13 01:18:48,441 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1593 transitions. Word has length 42 [2021-10-13 01:18:48,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:18:48,441 INFO L470 AbstractCegarLoop]: Abstraction has 1078 states and 1593 transitions. [2021-10-13 01:18:48,442 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-13 01:18:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1593 transitions. [2021-10-13 01:18:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-13 01:18:48,444 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:48,445 INFO L512 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-13 01:18:48,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 01:18:48,445 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:48,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:48,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1961075502, now seen corresponding path program 1 times [2021-10-13 01:18:48,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:48,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556187640] [2021-10-13 01:18:48,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:48,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:48,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:48,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:48,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:18:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:48,685 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-13 01:18:48,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:18:48,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556187640] [2021-10-13 01:18:48,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556187640] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:18:48,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:18:48,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 01:18:48,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881242670] [2021-10-13 01:18:48,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:18:48,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:18:48,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:18:48,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:18:48,710 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-13 01:18:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:18:49,805 INFO L93 Difference]: Finished difference Result 599 states and 851 transitions. [2021-10-13 01:18:49,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:18:49,806 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-13 01:18:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:18:49,811 INFO L225 Difference]: With dead ends: 599 [2021-10-13 01:18:49,812 INFO L226 Difference]: Without dead ends: 599 [2021-10-13 01:18:49,812 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 261.7ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:18:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-10-13 01:18:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 598. [2021-10-13 01:18:49,840 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-13 01:18:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 850 transitions. [2021-10-13 01:18:49,846 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 850 transitions. Word has length 45 [2021-10-13 01:18:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:18:49,846 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 850 transitions. [2021-10-13 01:18:49,847 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-13 01:18:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 850 transitions. [2021-10-13 01:18:49,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-13 01:18:49,848 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:49,849 INFO L512 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-13 01:18:49,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 01:18:49,850 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:49,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:49,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1047559429, now seen corresponding path program 1 times [2021-10-13 01:18:49,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:49,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481970300] [2021-10-13 01:18:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:49,854 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:50,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:50,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:50,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:18:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:50,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-13 01:18:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:50,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:18:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:50,164 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-13 01:18:50,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:18:50,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481970300] [2021-10-13 01:18:50,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481970300] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:18:50,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:18:50,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 01:18:50,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381989662] [2021-10-13 01:18:50,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 01:18:50,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:18:50,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 01:18:50,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-13 01:18:50,167 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-13 01:18:51,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:18:51,067 INFO L93 Difference]: Finished difference Result 625 states and 884 transitions. [2021-10-13 01:18:51,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 01:18:51,068 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-13 01:18:51,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:18:51,074 INFO L225 Difference]: With dead ends: 625 [2021-10-13 01:18:51,074 INFO L226 Difference]: Without dead ends: 608 [2021-10-13 01:18:51,074 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 169.3ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-13 01:18:51,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-10-13 01:18:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 596. [2021-10-13 01:18:51,099 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-13 01:18:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 846 transitions. [2021-10-13 01:18:51,104 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 846 transitions. Word has length 46 [2021-10-13 01:18:51,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:18:51,105 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 846 transitions. [2021-10-13 01:18:51,105 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-13 01:18:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 846 transitions. [2021-10-13 01:18:51,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-13 01:18:51,107 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:51,107 INFO L512 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-13 01:18:51,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 01:18:51,108 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:51,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:51,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1630521075, now seen corresponding path program 1 times [2021-10-13 01:18:51,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:51,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971664184] [2021-10-13 01:18:51,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:51,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:51,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:51,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:51,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:18:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:51,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-13 01:18:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:51,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:18:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:51,394 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-13 01:18:51,394 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:18:51,394 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971664184] [2021-10-13 01:18:51,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971664184] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:18:51,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:18:51,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 01:18:51,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172752264] [2021-10-13 01:18:51,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 01:18:51,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:18:51,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 01:18:51,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:18:51,397 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-13 01:18:52,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:18:52,810 INFO L93 Difference]: Finished difference Result 626 states and 884 transitions. [2021-10-13 01:18:52,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 01:18:52,811 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-13 01:18:52,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:18:52,816 INFO L225 Difference]: With dead ends: 626 [2021-10-13 01:18:52,817 INFO L226 Difference]: Without dead ends: 608 [2021-10-13 01:18:52,817 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 315.6ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-13 01:18:52,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-10-13 01:18:52,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 596. [2021-10-13 01:18:52,839 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-13 01:18:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 845 transitions. [2021-10-13 01:18:52,844 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 845 transitions. Word has length 46 [2021-10-13 01:18:52,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:18:52,845 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 845 transitions. [2021-10-13 01:18:52,845 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-13 01:18:52,846 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 845 transitions. [2021-10-13 01:18:52,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-13 01:18:52,847 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:52,847 INFO L512 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-13 01:18:52,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 01:18:52,848 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:52,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:52,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1014081090, now seen corresponding path program 1 times [2021-10-13 01:18:52,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:52,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962292701] [2021-10-13 01:18:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:52,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:53,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:53,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:53,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:18:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:53,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-13 01:18:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:53,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:18:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:53,162 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-13 01:18:53,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:18:53,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962292701] [2021-10-13 01:18:53,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962292701] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:18:53,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:18:53,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 01:18:53,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395637493] [2021-10-13 01:18:53,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 01:18:53,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:18:53,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 01:18:53,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:18:53,166 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-13 01:18:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:18:55,020 INFO L93 Difference]: Finished difference Result 826 states and 1225 transitions. [2021-10-13 01:18:55,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 01:18:55,021 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-13 01:18:55,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:18:55,030 INFO L225 Difference]: With dead ends: 826 [2021-10-13 01:18:55,030 INFO L226 Difference]: Without dead ends: 826 [2021-10-13 01:18:55,031 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 279.5ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-10-13 01:18:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2021-10-13 01:18:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 665. [2021-10-13 01:18:55,063 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-13 01:18:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 948 transitions. [2021-10-13 01:18:55,077 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 948 transitions. Word has length 46 [2021-10-13 01:18:55,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:18:55,078 INFO L470 AbstractCegarLoop]: Abstraction has 665 states and 948 transitions. [2021-10-13 01:18:55,078 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-13 01:18:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 948 transitions. [2021-10-13 01:18:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-13 01:18:55,080 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:55,080 INFO L512 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-13 01:18:55,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 01:18:55,081 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:55,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:55,082 INFO L82 PathProgramCache]: Analyzing trace with hash -74200962, now seen corresponding path program 1 times [2021-10-13 01:18:55,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:55,082 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594026606] [2021-10-13 01:18:55,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:55,082 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:55,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:55,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:55,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:18:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:55,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-10-13 01:18:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:55,307 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-13 01:18:55,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:18:55,307 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594026606] [2021-10-13 01:18:55,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594026606] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:18:55,308 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:18:55,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 01:18:55,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403246266] [2021-10-13 01:18:55,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 01:18:55,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:18:55,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 01:18:55,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:18:55,310 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-13 01:18:56,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:18:56,757 INFO L93 Difference]: Finished difference Result 462 states and 599 transitions. [2021-10-13 01:18:56,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 01:18:56,758 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-13 01:18:56,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:18:56,762 INFO L225 Difference]: With dead ends: 462 [2021-10-13 01:18:56,762 INFO L226 Difference]: Without dead ends: 462 [2021-10-13 01:18:56,763 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 329.7ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:18:56,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-10-13 01:18:56,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 441. [2021-10-13 01:18:56,778 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-13 01:18:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 578 transitions. [2021-10-13 01:18:56,781 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 578 transitions. Word has length 49 [2021-10-13 01:18:56,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:18:56,782 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 578 transitions. [2021-10-13 01:18:56,783 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-13 01:18:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 578 transitions. [2021-10-13 01:18:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 01:18:56,784 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:56,784 INFO L512 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-13 01:18:56,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 01:18:56,785 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:56,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:56,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1824745018, now seen corresponding path program 1 times [2021-10-13 01:18:56,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:56,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056573993] [2021-10-13 01:18:56,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:56,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:56,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:56,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:57,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:18:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:57,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-13 01:18:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:57,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:18:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:57,131 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-13 01:18:57,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:18:57,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056573993] [2021-10-13 01:18:57,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056573993] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:18:57,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:18:57,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 01:18:57,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257973861] [2021-10-13 01:18:57,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 01:18:57,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:18:57,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 01:18:57,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-13 01:18:57,135 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-13 01:18:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:18:58,385 INFO L93 Difference]: Finished difference Result 454 states and 594 transitions. [2021-10-13 01:18:58,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 01:18:58,386 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-13 01:18:58,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:18:58,390 INFO L225 Difference]: With dead ends: 454 [2021-10-13 01:18:58,390 INFO L226 Difference]: Without dead ends: 453 [2021-10-13 01:18:58,391 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 239.9ms TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-10-13 01:18:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-10-13 01:18:58,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2021-10-13 01:18:58,409 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-13 01:18:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2021-10-13 01:18:58,411 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2021-10-13 01:18:58,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:18:58,412 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2021-10-13 01:18:58,412 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-13 01:18:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2021-10-13 01:18:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 01:18:58,415 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:58,415 INFO L512 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-13 01:18:58,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 01:18:58,415 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:58,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:58,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1824468188, now seen corresponding path program 1 times [2021-10-13 01:18:58,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:58,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956537887] [2021-10-13 01:18:58,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:58,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:58,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:58,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:58,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:18:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:58,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-13 01:18:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:58,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:18:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:58,773 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-13 01:18:58,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:18:58,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956537887] [2021-10-13 01:18:58,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956537887] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:18:58,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:18:58,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 01:18:58,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125555153] [2021-10-13 01:18:58,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 01:18:58,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:18:58,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 01:18:58,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-13 01:18:58,780 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-13 01:18:59,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:18:59,700 INFO L93 Difference]: Finished difference Result 487 states and 652 transitions. [2021-10-13 01:18:59,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 01:18:59,701 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-13 01:18:59,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:18:59,704 INFO L225 Difference]: With dead ends: 487 [2021-10-13 01:18:59,705 INFO L226 Difference]: Without dead ends: 472 [2021-10-13 01:18:59,705 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 324.2ms TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-10-13 01:18:59,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-10-13 01:18:59,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 459. [2021-10-13 01:18:59,729 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-13 01:18:59,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 604 transitions. [2021-10-13 01:18:59,732 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 604 transitions. Word has length 47 [2021-10-13 01:18:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:18:59,732 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 604 transitions. [2021-10-13 01:18:59,733 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-13 01:18:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2021-10-13 01:18:59,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-13 01:18:59,734 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:18:59,735 INFO L512 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-13 01:18:59,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 01:18:59,735 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:18:59,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:18:59,736 INFO L82 PathProgramCache]: Analyzing trace with hash 463036434, now seen corresponding path program 1 times [2021-10-13 01:18:59,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:18:59,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359268420] [2021-10-13 01:18:59,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:18:59,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:18:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:59,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:18:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:59,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:18:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:59,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:18:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:18:59,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-13 01:18:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:00,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:19:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:00,035 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-13 01:19:00,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:00,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359268420] [2021-10-13 01:19:00,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359268420] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:00,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:00,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-13 01:19:00,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226290122] [2021-10-13 01:19:00,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-13 01:19:00,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:00,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-13 01:19:00,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-13 01:19:00,038 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-13 01:19:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:02,415 INFO L93 Difference]: Finished difference Result 590 states and 807 transitions. [2021-10-13 01:19:02,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-13 01:19:02,416 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-13 01:19:02,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:02,420 INFO L225 Difference]: With dead ends: 590 [2021-10-13 01:19:02,421 INFO L226 Difference]: Without dead ends: 575 [2021-10-13 01:19:02,421 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 768.6ms TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2021-10-13 01:19:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-10-13 01:19:02,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 444. [2021-10-13 01:19:02,438 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-13 01:19:02,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 583 transitions. [2021-10-13 01:19:02,441 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 583 transitions. Word has length 48 [2021-10-13 01:19:02,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:02,441 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 583 transitions. [2021-10-13 01:19:02,441 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-13 01:19:02,442 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 583 transitions. [2021-10-13 01:19:02,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-13 01:19:02,443 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:02,443 INFO L512 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-13 01:19:02,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 01:19:02,444 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:02,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:02,444 INFO L82 PathProgramCache]: Analyzing trace with hash -97212758, now seen corresponding path program 1 times [2021-10-13 01:19:02,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:02,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236914100] [2021-10-13 01:19:02,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:02,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:02,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:02,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:02,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:02,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-10-13 01:19:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:02,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:02,711 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-13 01:19:02,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:02,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236914100] [2021-10-13 01:19:02,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236914100] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:02,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:02,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-13 01:19:02,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237742602] [2021-10-13 01:19:02,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 01:19:02,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:02,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 01:19:02,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:19:02,717 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-13 01:19:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:04,032 INFO L93 Difference]: Finished difference Result 455 states and 596 transitions. [2021-10-13 01:19:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 01:19:04,033 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-13 01:19:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:04,036 INFO L225 Difference]: With dead ends: 455 [2021-10-13 01:19:04,036 INFO L226 Difference]: Without dead ends: 427 [2021-10-13 01:19:04,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 183.3ms TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-13 01:19:04,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-10-13 01:19:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2021-10-13 01:19:04,052 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-13 01:19:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 562 transitions. [2021-10-13 01:19:04,054 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 562 transitions. Word has length 49 [2021-10-13 01:19:04,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:04,055 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 562 transitions. [2021-10-13 01:19:04,055 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-13 01:19:04,055 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 562 transitions. [2021-10-13 01:19:04,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-13 01:19:04,056 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:04,057 INFO L512 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-13 01:19:04,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 01:19:04,057 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:04,058 INFO L82 PathProgramCache]: Analyzing trace with hash 193438818, now seen corresponding path program 1 times [2021-10-13 01:19:04,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:04,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867833455] [2021-10-13 01:19:04,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:04,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:04,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:04,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:04,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:04,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-13 01:19:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:04,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-13 01:19:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:04,409 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-13 01:19:04,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:04,409 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867833455] [2021-10-13 01:19:04,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867833455] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:04,410 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:04,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 01:19:04,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925583567] [2021-10-13 01:19:04,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 01:19:04,412 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:04,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 01:19:04,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:19:04,414 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-13 01:19:05,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:05,509 INFO L93 Difference]: Finished difference Result 453 states and 597 transitions. [2021-10-13 01:19:05,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 01:19:05,510 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-13 01:19:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:05,514 INFO L225 Difference]: With dead ends: 453 [2021-10-13 01:19:05,514 INFO L226 Difference]: Without dead ends: 423 [2021-10-13 01:19:05,514 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 350.2ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-13 01:19:05,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-10-13 01:19:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 409. [2021-10-13 01:19:05,528 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-13 01:19:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 542 transitions. [2021-10-13 01:19:05,531 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 542 transitions. Word has length 50 [2021-10-13 01:19:05,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:05,532 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 542 transitions. [2021-10-13 01:19:05,532 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-13 01:19:05,533 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 542 transitions. [2021-10-13 01:19:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-13 01:19:05,534 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:05,534 INFO L512 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-13 01:19:05,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 01:19:05,535 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:05,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:05,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1006860761, now seen corresponding path program 1 times [2021-10-13 01:19:05,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:05,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381420338] [2021-10-13 01:19:05,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:05,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:05,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:05,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:05,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:05,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-13 01:19:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:05,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:05,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-13 01:19:05,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:05,833 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381420338] [2021-10-13 01:19:05,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381420338] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:05,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:05,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 01:19:05,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81225443] [2021-10-13 01:19:05,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 01:19:05,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:05,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 01:19:05,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:19:05,837 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-13 01:19:08,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:08,349 INFO L93 Difference]: Finished difference Result 600 states and 867 transitions. [2021-10-13 01:19:08,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-13 01:19:08,350 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-13 01:19:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:08,355 INFO L225 Difference]: With dead ends: 600 [2021-10-13 01:19:08,355 INFO L226 Difference]: Without dead ends: 600 [2021-10-13 01:19:08,355 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 727.3ms TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2021-10-13 01:19:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-10-13 01:19:08,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 534. [2021-10-13 01:19:08,379 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-13 01:19:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 769 transitions. [2021-10-13 01:19:08,382 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 769 transitions. Word has length 50 [2021-10-13 01:19:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:08,383 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 769 transitions. [2021-10-13 01:19:08,383 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-13 01:19:08,383 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 769 transitions. [2021-10-13 01:19:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-13 01:19:08,387 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:08,388 INFO L512 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-13 01:19:08,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 01:19:08,388 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:08,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:08,389 INFO L82 PathProgramCache]: Analyzing trace with hash 645881872, now seen corresponding path program 1 times [2021-10-13 01:19:08,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:08,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453549951] [2021-10-13 01:19:08,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:08,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:08,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:08,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:08,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:08,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-13 01:19:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:08,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:08,646 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-13 01:19:08,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:08,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453549951] [2021-10-13 01:19:08,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453549951] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:08,647 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:08,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 01:19:08,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150982251] [2021-10-13 01:19:08,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 01:19:08,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:08,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 01:19:08,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:19:08,652 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-13 01:19:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:09,794 INFO L93 Difference]: Finished difference Result 740 states and 1128 transitions. [2021-10-13 01:19:09,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 01:19:09,794 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-13 01:19:09,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:09,802 INFO L225 Difference]: With dead ends: 740 [2021-10-13 01:19:09,803 INFO L226 Difference]: Without dead ends: 740 [2021-10-13 01:19:09,803 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 250.0ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:19:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-10-13 01:19:09,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 561. [2021-10-13 01:19:09,830 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-13 01:19:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 797 transitions. [2021-10-13 01:19:09,833 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 797 transitions. Word has length 51 [2021-10-13 01:19:09,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:09,834 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 797 transitions. [2021-10-13 01:19:09,834 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-13 01:19:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 797 transitions. [2021-10-13 01:19:09,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-13 01:19:09,835 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:09,835 INFO L512 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-13 01:19:09,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-13 01:19:09,836 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:09,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:09,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1801633520, now seen corresponding path program 1 times [2021-10-13 01:19:09,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:09,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070416192] [2021-10-13 01:19:09,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:09,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:09,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:09,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:09,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:10,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-13 01:19:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:10,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:10,051 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-13 01:19:10,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:10,051 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070416192] [2021-10-13 01:19:10,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070416192] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:10,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:10,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 01:19:10,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444996481] [2021-10-13 01:19:10,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 01:19:10,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:10,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 01:19:10,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:19:10,054 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-13 01:19:10,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:10,780 INFO L93 Difference]: Finished difference Result 579 states and 821 transitions. [2021-10-13 01:19:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 01:19:10,781 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-13 01:19:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:10,786 INFO L225 Difference]: With dead ends: 579 [2021-10-13 01:19:10,786 INFO L226 Difference]: Without dead ends: 579 [2021-10-13 01:19:10,787 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 304.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:19:10,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-10-13 01:19:10,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 564. [2021-10-13 01:19:10,809 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-13 01:19:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 801 transitions. [2021-10-13 01:19:10,812 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 801 transitions. Word has length 51 [2021-10-13 01:19:10,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:10,813 INFO L470 AbstractCegarLoop]: Abstraction has 564 states and 801 transitions. [2021-10-13 01:19:10,813 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-13 01:19:10,813 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 801 transitions. [2021-10-13 01:19:10,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-13 01:19:10,815 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:10,816 INFO L512 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-13 01:19:10,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-13 01:19:10,816 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:10,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:10,817 INFO L82 PathProgramCache]: Analyzing trace with hash 499189070, now seen corresponding path program 1 times [2021-10-13 01:19:10,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:10,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868750915] [2021-10-13 01:19:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:10,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:10,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:10,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:10,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:11,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:11,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-13 01:19:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:11,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:11,107 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-13 01:19:11,107 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:11,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868750915] [2021-10-13 01:19:11,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868750915] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:11,108 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:11,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-13 01:19:11,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065930294] [2021-10-13 01:19:11,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-13 01:19:11,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:11,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-13 01:19:11,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-10-13 01:19:11,110 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-13 01:19:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:12,765 INFO L93 Difference]: Finished difference Result 619 states and 929 transitions. [2021-10-13 01:19:12,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 01:19:12,766 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-13 01:19:12,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:12,771 INFO L225 Difference]: With dead ends: 619 [2021-10-13 01:19:12,771 INFO L226 Difference]: Without dead ends: 619 [2021-10-13 01:19:12,771 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 624.6ms TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2021-10-13 01:19:12,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-10-13 01:19:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 524. [2021-10-13 01:19:12,793 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-13 01:19:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 751 transitions. [2021-10-13 01:19:12,797 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 751 transitions. Word has length 51 [2021-10-13 01:19:12,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:12,797 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 751 transitions. [2021-10-13 01:19:12,797 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-13 01:19:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 751 transitions. [2021-10-13 01:19:12,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-13 01:19:12,799 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:12,799 INFO L512 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-13 01:19:12,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-13 01:19:12,800 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:12,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:12,800 INFO L82 PathProgramCache]: Analyzing trace with hash -999496148, now seen corresponding path program 1 times [2021-10-13 01:19:12,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:12,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544182833] [2021-10-13 01:19:12,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:12,801 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:12,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:12,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:12,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:13,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-13 01:19:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:13,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:13,072 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-13 01:19:13,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:13,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544182833] [2021-10-13 01:19:13,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544182833] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:13,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:13,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-13 01:19:13,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629343133] [2021-10-13 01:19:13,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 01:19:13,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:13,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 01:19:13,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:19:13,075 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-13 01:19:14,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:14,078 INFO L93 Difference]: Finished difference Result 544 states and 778 transitions. [2021-10-13 01:19:14,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 01:19:14,079 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-13 01:19:14,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:14,084 INFO L225 Difference]: With dead ends: 544 [2021-10-13 01:19:14,084 INFO L226 Difference]: Without dead ends: 543 [2021-10-13 01:19:14,086 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 185.1ms TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-13 01:19:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-10-13 01:19:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 531. [2021-10-13 01:19:14,109 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-13 01:19:14,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 760 transitions. [2021-10-13 01:19:14,112 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 760 transitions. Word has length 52 [2021-10-13 01:19:14,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:14,113 INFO L470 AbstractCegarLoop]: Abstraction has 531 states and 760 transitions. [2021-10-13 01:19:14,113 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-13 01:19:14,113 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 760 transitions. [2021-10-13 01:19:14,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-13 01:19:14,114 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:14,115 INFO L512 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-13 01:19:14,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-13 01:19:14,115 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:14,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:14,116 INFO L82 PathProgramCache]: Analyzing trace with hash -999772978, now seen corresponding path program 1 times [2021-10-13 01:19:14,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:14,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59704909] [2021-10-13 01:19:14,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:14,117 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:14,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:14,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:14,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-13 01:19:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:14,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:14,434 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-13 01:19:14,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:14,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59704909] [2021-10-13 01:19:14,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59704909] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:14,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:14,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-13 01:19:14,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207101959] [2021-10-13 01:19:14,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 01:19:14,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:14,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 01:19:14,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:19:14,437 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-13 01:19:15,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:15,327 INFO L93 Difference]: Finished difference Result 559 states and 794 transitions. [2021-10-13 01:19:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-13 01:19:15,327 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-13 01:19:15,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:15,331 INFO L225 Difference]: With dead ends: 559 [2021-10-13 01:19:15,332 INFO L226 Difference]: Without dead ends: 538 [2021-10-13 01:19:15,332 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 296.0ms TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-10-13 01:19:15,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-10-13 01:19:15,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 530. [2021-10-13 01:19:15,351 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-13 01:19:15,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 758 transitions. [2021-10-13 01:19:15,355 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 758 transitions. Word has length 52 [2021-10-13 01:19:15,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:15,355 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 758 transitions. [2021-10-13 01:19:15,356 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-13 01:19:15,356 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 758 transitions. [2021-10-13 01:19:15,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-13 01:19:15,357 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:15,357 INFO L512 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-13 01:19:15,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-13 01:19:15,358 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:15,359 INFO L82 PathProgramCache]: Analyzing trace with hash -639415020, now seen corresponding path program 1 times [2021-10-13 01:19:15,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:15,359 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225496516] [2021-10-13 01:19:15,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:15,359 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:15,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:15,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:15,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:15,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-13 01:19:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:15,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:15,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-10-13 01:19:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:15,588 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-13 01:19:15,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:15,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225496516] [2021-10-13 01:19:15,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225496516] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:15,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:15,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-13 01:19:15,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385412524] [2021-10-13 01:19:15,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 01:19:15,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:15,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 01:19:15,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 01:19:15,591 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-13 01:19:16,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:16,195 INFO L93 Difference]: Finished difference Result 549 states and 800 transitions. [2021-10-13 01:19:16,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 01:19:16,196 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-13 01:19:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:16,205 INFO L225 Difference]: With dead ends: 549 [2021-10-13 01:19:16,205 INFO L226 Difference]: Without dead ends: 549 [2021-10-13 01:19:16,206 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 246.8ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:19:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-10-13 01:19:16,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 529. [2021-10-13 01:19:16,225 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-13 01:19:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 754 transitions. [2021-10-13 01:19:16,228 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 754 transitions. Word has length 58 [2021-10-13 01:19:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:16,229 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 754 transitions. [2021-10-13 01:19:16,229 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-13 01:19:16,229 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 754 transitions. [2021-10-13 01:19:16,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-13 01:19:16,230 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:16,230 INFO L512 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-13 01:19:16,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-13 01:19:16,231 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:16,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:16,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1490997952, now seen corresponding path program 1 times [2021-10-13 01:19:16,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:16,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546071017] [2021-10-13 01:19:16,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:16,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:16,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:16,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:16,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:16,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-13 01:19:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:16,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:16,502 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-13 01:19:16,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:16,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546071017] [2021-10-13 01:19:16,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546071017] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:16,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:16,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 01:19:16,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414838353] [2021-10-13 01:19:16,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 01:19:16,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:16,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 01:19:16,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:19:16,505 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-13 01:19:18,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:18,144 INFO L93 Difference]: Finished difference Result 671 states and 995 transitions. [2021-10-13 01:19:18,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 01:19:18,145 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-13 01:19:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:18,149 INFO L225 Difference]: With dead ends: 671 [2021-10-13 01:19:18,150 INFO L226 Difference]: Without dead ends: 639 [2021-10-13 01:19:18,150 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 541.9ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-10-13 01:19:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-10-13 01:19:18,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 560. [2021-10-13 01:19:18,172 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-13 01:19:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 824 transitions. [2021-10-13 01:19:18,175 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 824 transitions. Word has length 53 [2021-10-13 01:19:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:18,176 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 824 transitions. [2021-10-13 01:19:18,176 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-13 01:19:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 824 transitions. [2021-10-13 01:19:18,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-13 01:19:18,177 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:18,177 INFO L512 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-13 01:19:18,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-13 01:19:18,178 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:18,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:18,179 INFO L82 PathProgramCache]: Analyzing trace with hash -538464897, now seen corresponding path program 1 times [2021-10-13 01:19:18,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:18,179 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570932161] [2021-10-13 01:19:18,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:18,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:18,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:18,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:18,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:18,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-10-13 01:19:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:18,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:18,599 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-13 01:19:18,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:18,600 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570932161] [2021-10-13 01:19:18,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570932161] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:18,600 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:18,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 01:19:18,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967616531] [2021-10-13 01:19:18,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 01:19:18,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:18,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 01:19:18,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-10-13 01:19:18,604 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-13 01:19:19,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:19,317 INFO L93 Difference]: Finished difference Result 390 states and 522 transitions. [2021-10-13 01:19:19,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 01:19:19,317 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-13 01:19:19,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:19,320 INFO L225 Difference]: With dead ends: 390 [2021-10-13 01:19:19,320 INFO L226 Difference]: Without dead ends: 390 [2021-10-13 01:19:19,320 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 235.4ms TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-10-13 01:19:19,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-10-13 01:19:19,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 338. [2021-10-13 01:19:19,332 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-13 01:19:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2021-10-13 01:19:19,334 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 63 [2021-10-13 01:19:19,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:19,335 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2021-10-13 01:19:19,335 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-13 01:19:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2021-10-13 01:19:19,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-13 01:19:19,336 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:19,336 INFO L512 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-13 01:19:19,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-13 01:19:19,337 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:19,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:19,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1094959805, now seen corresponding path program 1 times [2021-10-13 01:19:19,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:19,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110100286] [2021-10-13 01:19:19,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:19,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:19,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:19,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:19,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:19,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-13 01:19:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:19,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:19,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:19,664 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-13 01:19:19,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:19,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110100286] [2021-10-13 01:19:19,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110100286] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:19,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:19,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-13 01:19:19,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047224556] [2021-10-13 01:19:19,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 01:19:19,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:19,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 01:19:19,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-10-13 01:19:19,667 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-13 01:19:20,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:20,617 INFO L93 Difference]: Finished difference Result 343 states and 451 transitions. [2021-10-13 01:19:20,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 01:19:20,618 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-13 01:19:20,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:20,620 INFO L225 Difference]: With dead ends: 343 [2021-10-13 01:19:20,620 INFO L226 Difference]: Without dead ends: 304 [2021-10-13 01:19:20,621 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 239.2ms TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-10-13 01:19:20,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-10-13 01:19:20,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2021-10-13 01:19:20,631 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-13 01:19:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 398 transitions. [2021-10-13 01:19:20,633 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 398 transitions. Word has length 58 [2021-10-13 01:19:20,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:20,633 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 398 transitions. [2021-10-13 01:19:20,633 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-13 01:19:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 398 transitions. [2021-10-13 01:19:20,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-10-13 01:19:20,635 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:20,635 INFO L512 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-13 01:19:20,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-13 01:19:20,636 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:20,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:20,636 INFO L82 PathProgramCache]: Analyzing trace with hash -703797032, now seen corresponding path program 1 times [2021-10-13 01:19:20,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:20,637 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343478166] [2021-10-13 01:19:20,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:20,637 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:20,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:20,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:20,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:20,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-10-13 01:19:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:20,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:20,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:20,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:20,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:20,982 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-13 01:19:20,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:20,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343478166] [2021-10-13 01:19:20,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343478166] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:20,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:20,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-13 01:19:20,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869722233] [2021-10-13 01:19:20,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 01:19:20,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:20,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 01:19:20,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:19:20,985 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-13 01:19:21,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:21,813 INFO L93 Difference]: Finished difference Result 316 states and 429 transitions. [2021-10-13 01:19:21,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 01:19:21,814 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-13 01:19:21,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:21,816 INFO L225 Difference]: With dead ends: 316 [2021-10-13 01:19:21,816 INFO L226 Difference]: Without dead ends: 316 [2021-10-13 01:19:21,816 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 433.2ms TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2021-10-13 01:19:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-10-13 01:19:21,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 298. [2021-10-13 01:19:21,827 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-13 01:19:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 396 transitions. [2021-10-13 01:19:21,829 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 396 transitions. Word has length 67 [2021-10-13 01:19:21,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:21,830 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 396 transitions. [2021-10-13 01:19:21,830 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-13 01:19:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 396 transitions. [2021-10-13 01:19:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-13 01:19:21,831 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:21,832 INFO L512 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-13 01:19:21,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-13 01:19:21,832 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:21,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:21,833 INFO L82 PathProgramCache]: Analyzing trace with hash -194321691, now seen corresponding path program 1 times [2021-10-13 01:19:21,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:21,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278032896] [2021-10-13 01:19:21,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:21,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:21,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:22,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:22,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:22,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-10-13 01:19:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:22,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:22,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:22,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:22,146 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-13 01:19:22,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:22,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278032896] [2021-10-13 01:19:22,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278032896] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:22,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:22,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-13 01:19:22,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576580384] [2021-10-13 01:19:22,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 01:19:22,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:22,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 01:19:22,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:19:22,149 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-13 01:19:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:22,691 INFO L93 Difference]: Finished difference Result 330 states and 453 transitions. [2021-10-13 01:19:22,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 01:19:22,692 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-13 01:19:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:22,695 INFO L225 Difference]: With dead ends: 330 [2021-10-13 01:19:22,695 INFO L226 Difference]: Without dead ends: 330 [2021-10-13 01:19:22,695 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 227.1ms TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-10-13 01:19:22,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-10-13 01:19:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 303. [2021-10-13 01:19:22,706 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-13 01:19:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 409 transitions. [2021-10-13 01:19:22,708 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 409 transitions. Word has length 68 [2021-10-13 01:19:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:22,709 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 409 transitions. [2021-10-13 01:19:22,709 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-13 01:19:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 409 transitions. [2021-10-13 01:19:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-10-13 01:19:22,710 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:22,710 INFO L512 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-13 01:19:22,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-13 01:19:22,711 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:22,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:22,712 INFO L82 PathProgramCache]: Analyzing trace with hash -198191505, now seen corresponding path program 1 times [2021-10-13 01:19:22,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:22,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310553206] [2021-10-13 01:19:22,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:22,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:22,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:22,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:22,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:22,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-10-13 01:19:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:22,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:22,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:22,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:22,945 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-13 01:19:22,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:22,946 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310553206] [2021-10-13 01:19:22,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310553206] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:22,946 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:22,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 01:19:22,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172009423] [2021-10-13 01:19:22,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 01:19:22,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:22,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 01:19:22,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:19:22,948 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-13 01:19:23,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:23,653 INFO L93 Difference]: Finished difference Result 474 states and 674 transitions. [2021-10-13 01:19:23,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 01:19:23,654 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-13 01:19:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:23,659 INFO L225 Difference]: With dead ends: 474 [2021-10-13 01:19:23,659 INFO L226 Difference]: Without dead ends: 474 [2021-10-13 01:19:23,659 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 247.5ms TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:19:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-10-13 01:19:23,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 307. [2021-10-13 01:19:23,675 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-13 01:19:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 415 transitions. [2021-10-13 01:19:23,677 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 415 transitions. Word has length 69 [2021-10-13 01:19:23,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:23,678 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 415 transitions. [2021-10-13 01:19:23,678 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-13 01:19:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 415 transitions. [2021-10-13 01:19:23,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-13 01:19:23,679 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:23,680 INFO L512 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-13 01:19:23,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-13 01:19:23,680 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:23,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:23,681 INFO L82 PathProgramCache]: Analyzing trace with hash 392199007, now seen corresponding path program 1 times [2021-10-13 01:19:23,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:23,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556810149] [2021-10-13 01:19:23,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:23,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:23,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:23,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:23,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:23,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-10-13 01:19:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:23,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:23,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:23,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:23,950 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-13 01:19:23,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:23,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556810149] [2021-10-13 01:19:23,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556810149] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:23,951 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:23,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-13 01:19:23,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839201166] [2021-10-13 01:19:23,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 01:19:23,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:23,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 01:19:23,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:19:23,953 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-13 01:19:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:24,888 INFO L93 Difference]: Finished difference Result 529 states and 764 transitions. [2021-10-13 01:19:24,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 01:19:24,892 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-13 01:19:24,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:24,897 INFO L225 Difference]: With dead ends: 529 [2021-10-13 01:19:24,897 INFO L226 Difference]: Without dead ends: 529 [2021-10-13 01:19:24,900 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 290.2ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-10-13 01:19:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-10-13 01:19:24,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 490. [2021-10-13 01:19:24,919 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-13 01:19:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 703 transitions. [2021-10-13 01:19:24,922 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 703 transitions. Word has length 71 [2021-10-13 01:19:24,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:24,923 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 703 transitions. [2021-10-13 01:19:24,924 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-13 01:19:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 703 transitions. [2021-10-13 01:19:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-10-13 01:19:24,925 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:24,925 INFO L512 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-13 01:19:24,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-13 01:19:24,927 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:24,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:24,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1252090646, now seen corresponding path program 1 times [2021-10-13 01:19:24,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:24,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105250202] [2021-10-13 01:19:24,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:24,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:25,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:25,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:25,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:25,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-10-13 01:19:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:25,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:25,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:25,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:25,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:25,347 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-13 01:19:25,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:25,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105250202] [2021-10-13 01:19:25,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105250202] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:25,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:25,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-13 01:19:25,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36139822] [2021-10-13 01:19:25,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 01:19:25,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:25,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 01:19:25,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-10-13 01:19:25,350 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-13 01:19:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:25,948 INFO L93 Difference]: Finished difference Result 493 states and 705 transitions. [2021-10-13 01:19:25,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 01:19:25,949 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-13 01:19:25,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:25,956 INFO L225 Difference]: With dead ends: 493 [2021-10-13 01:19:25,956 INFO L226 Difference]: Without dead ends: 493 [2021-10-13 01:19:25,957 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 239.2ms TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-10-13 01:19:25,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-10-13 01:19:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 484. [2021-10-13 01:19:25,973 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-13 01:19:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 687 transitions. [2021-10-13 01:19:25,976 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 687 transitions. Word has length 72 [2021-10-13 01:19:25,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:25,977 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 687 transitions. [2021-10-13 01:19:25,977 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-13 01:19:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 687 transitions. [2021-10-13 01:19:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-13 01:19:25,979 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:25,979 INFO L512 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-13 01:19:25,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-13 01:19:25,980 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:25,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1761504416, now seen corresponding path program 1 times [2021-10-13 01:19:25,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:25,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601771770] [2021-10-13 01:19:25,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:25,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:26,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:26,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:26,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:26,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-10-13 01:19:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:26,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:26,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:26,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:26,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:26,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-10-13 01:19:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:26,338 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-13 01:19:26,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:26,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601771770] [2021-10-13 01:19:26,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601771770] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:26,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:26,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-13 01:19:26,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740143070] [2021-10-13 01:19:26,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 01:19:26,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:26,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 01:19:26,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:19:26,342 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-13 01:19:27,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:27,431 INFO L93 Difference]: Finished difference Result 450 states and 629 transitions. [2021-10-13 01:19:27,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 01:19:27,433 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-13 01:19:27,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:27,437 INFO L225 Difference]: With dead ends: 450 [2021-10-13 01:19:27,437 INFO L226 Difference]: Without dead ends: 450 [2021-10-13 01:19:27,438 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 420.0ms TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2021-10-13 01:19:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-10-13 01:19:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 436. [2021-10-13 01:19:27,452 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-13 01:19:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 604 transitions. [2021-10-13 01:19:27,455 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 604 transitions. Word has length 83 [2021-10-13 01:19:27,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:27,455 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 604 transitions. [2021-10-13 01:19:27,455 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-13 01:19:27,456 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 604 transitions. [2021-10-13 01:19:27,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-13 01:19:27,457 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:27,458 INFO L512 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-13 01:19:27,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-13 01:19:27,458 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:27,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:27,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1176411851, now seen corresponding path program 1 times [2021-10-13 01:19:27,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:27,459 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972632166] [2021-10-13 01:19:27,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:27,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:27,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:27,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:27,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:27,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-13 01:19:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:27,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:27,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:27,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:28,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:28,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:28,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:28,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:28,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-10-13 01:19:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:28,101 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-13 01:19:28,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:28,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972632166] [2021-10-13 01:19:28,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972632166] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:28,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:28,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-10-13 01:19:28,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177400732] [2021-10-13 01:19:28,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-13 01:19:28,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:28,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-13 01:19:28,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2021-10-13 01:19:28,104 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-13 01:19:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:29,064 INFO L93 Difference]: Finished difference Result 483 states and 678 transitions. [2021-10-13 01:19:29,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-13 01:19:29,065 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-13 01:19:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:29,067 INFO L225 Difference]: With dead ends: 483 [2021-10-13 01:19:29,068 INFO L226 Difference]: Without dead ends: 461 [2021-10-13 01:19:29,068 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 467.4ms TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2021-10-13 01:19:29,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-10-13 01:19:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2021-10-13 01:19:29,083 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-13 01:19:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 619 transitions. [2021-10-13 01:19:29,085 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 619 transitions. Word has length 92 [2021-10-13 01:19:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:29,086 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 619 transitions. [2021-10-13 01:19:29,086 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-13 01:19:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 619 transitions. [2021-10-13 01:19:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-13 01:19:29,089 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:29,089 INFO L512 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-13 01:19:29,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-13 01:19:29,089 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:29,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:29,090 INFO L82 PathProgramCache]: Analyzing trace with hash 702793907, now seen corresponding path program 1 times [2021-10-13 01:19:29,090 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:29,090 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112293951] [2021-10-13 01:19:29,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:29,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:29,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:29,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:29,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:29,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-13 01:19:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:29,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:29,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:29,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:29,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:29,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:29,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:29,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-10-13 01:19:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:29,754 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-13 01:19:29,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:29,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112293951] [2021-10-13 01:19:29,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112293951] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:29,755 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:29,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-10-13 01:19:29,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804634810] [2021-10-13 01:19:29,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-13 01:19:29,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:29,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-13 01:19:29,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2021-10-13 01:19:29,761 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-13 01:19:30,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:30,874 INFO L93 Difference]: Finished difference Result 481 states and 674 transitions. [2021-10-13 01:19:30,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-13 01:19:30,874 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-13 01:19:30,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:30,878 INFO L225 Difference]: With dead ends: 481 [2021-10-13 01:19:30,878 INFO L226 Difference]: Without dead ends: 459 [2021-10-13 01:19:30,879 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 506.8ms TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2021-10-13 01:19:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-10-13 01:19:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 434. [2021-10-13 01:19:30,894 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-13 01:19:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 600 transitions. [2021-10-13 01:19:30,897 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 600 transitions. Word has length 93 [2021-10-13 01:19:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:30,898 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 600 transitions. [2021-10-13 01:19:30,898 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-13 01:19:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 600 transitions. [2021-10-13 01:19:30,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-13 01:19:30,900 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:30,900 INFO L512 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-13 01:19:30,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-13 01:19:30,901 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:30,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:30,902 INFO L82 PathProgramCache]: Analyzing trace with hash 940384513, now seen corresponding path program 1 times [2021-10-13 01:19:30,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:30,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672509589] [2021-10-13 01:19:30,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:30,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:30,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:31,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:31,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:31,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:31,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-13 01:19:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:31,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:31,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:31,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:31,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:31,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:31,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-10-13 01:19:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:31,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-10-13 01:19:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:31,601 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-13 01:19:31,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:31,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672509589] [2021-10-13 01:19:31,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672509589] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:31,602 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:31,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-10-13 01:19:31,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131147035] [2021-10-13 01:19:31,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-13 01:19:31,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:31,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-13 01:19:31,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-10-13 01:19:31,606 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-13 01:19:34,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:34,419 INFO L93 Difference]: Finished difference Result 860 states and 1205 transitions. [2021-10-13 01:19:34,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-13 01:19:34,419 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-13 01:19:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:34,425 INFO L225 Difference]: With dead ends: 860 [2021-10-13 01:19:34,426 INFO L226 Difference]: Without dead ends: 827 [2021-10-13 01:19:34,427 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1015.6ms TimeCoverageRelationStatistics Valid=289, Invalid=2261, Unknown=0, NotChecked=0, Total=2550 [2021-10-13 01:19:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2021-10-13 01:19:34,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 805. [2021-10-13 01:19:34,463 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-13 01:19:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1133 transitions. [2021-10-13 01:19:34,468 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1133 transitions. Word has length 103 [2021-10-13 01:19:34,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:34,469 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 1133 transitions. [2021-10-13 01:19:34,469 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-13 01:19:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1133 transitions. [2021-10-13 01:19:34,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-10-13 01:19:34,472 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:34,472 INFO L512 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-13 01:19:34,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-13 01:19:34,473 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:34,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:34,474 INFO L82 PathProgramCache]: Analyzing trace with hash 911884223, now seen corresponding path program 1 times [2021-10-13 01:19:34,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:34,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620316175] [2021-10-13 01:19:34,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:34,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:34,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:34,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:34,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:34,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-13 01:19:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:34,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:34,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:34,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:35,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:35,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:35,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:35,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-10-13 01:19:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:35,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-10-13 01:19:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:35,096 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-13 01:19:35,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:35,097 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620316175] [2021-10-13 01:19:35,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620316175] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:35,097 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:35,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-10-13 01:19:35,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589363955] [2021-10-13 01:19:35,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-10-13 01:19:35,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:35,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-10-13 01:19:35,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-10-13 01:19:35,100 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-13 01:19:38,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:38,622 INFO L93 Difference]: Finished difference Result 847 states and 1189 transitions. [2021-10-13 01:19:38,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-13 01:19:38,623 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-13 01:19:38,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:38,630 INFO L225 Difference]: With dead ends: 847 [2021-10-13 01:19:38,630 INFO L226 Difference]: Without dead ends: 814 [2021-10-13 01:19:38,632 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 906.0ms TimeCoverageRelationStatistics Valid=257, Invalid=1723, Unknown=0, NotChecked=0, Total=1980 [2021-10-13 01:19:38,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-10-13 01:19:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 424. [2021-10-13 01:19:38,651 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-13 01:19:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 587 transitions. [2021-10-13 01:19:38,653 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 587 transitions. Word has length 103 [2021-10-13 01:19:38,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:38,654 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 587 transitions. [2021-10-13 01:19:38,654 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-13 01:19:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 587 transitions. [2021-10-13 01:19:38,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-10-13 01:19:38,656 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:38,656 INFO L512 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-13 01:19:38,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-13 01:19:38,657 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:38,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:38,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1426002147, now seen corresponding path program 1 times [2021-10-13 01:19:38,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:38,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495244484] [2021-10-13 01:19:38,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:38,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:38,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:38,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:38,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:38,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-13 01:19:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:38,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:19:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:39,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:39,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:39,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:39,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:39,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:39,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-10-13 01:19:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-10-13 01:19:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:39,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:39,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-10-13 01:19:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:39,347 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-13 01:19:39,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:39,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495244484] [2021-10-13 01:19:39,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495244484] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:39,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:39,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-13 01:19:39,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437491755] [2021-10-13 01:19:39,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-13 01:19:39,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:39,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-13 01:19:39,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2021-10-13 01:19:39,351 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-13 01:19:40,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:40,424 INFO L93 Difference]: Finished difference Result 478 states and 676 transitions. [2021-10-13 01:19:40,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-13 01:19:40,425 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-13 01:19:40,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:40,428 INFO L225 Difference]: With dead ends: 478 [2021-10-13 01:19:40,428 INFO L226 Difference]: Without dead ends: 454 [2021-10-13 01:19:40,429 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 639.8ms TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2021-10-13 01:19:40,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-10-13 01:19:40,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2021-10-13 01:19:40,440 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-13 01:19:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 610 transitions. [2021-10-13 01:19:40,443 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 610 transitions. Word has length 108 [2021-10-13 01:19:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:40,444 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 610 transitions. [2021-10-13 01:19:40,444 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-13 01:19:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 610 transitions. [2021-10-13 01:19:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-10-13 01:19:40,446 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:40,446 INFO L512 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-13 01:19:40,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-13 01:19:40,447 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:40,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:40,447 INFO L82 PathProgramCache]: Analyzing trace with hash 986627049, now seen corresponding path program 1 times [2021-10-13 01:19:40,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:40,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395646939] [2021-10-13 01:19:40,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:40,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:40,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:40,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:40,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:40,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-13 01:19:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:40,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:19:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:40,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:40,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:40,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:40,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:41,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:41,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-10-13 01:19:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:41,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-10-13 01:19:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:41,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:41,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-10-13 01:19:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:41,099 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-13 01:19:41,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:41,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395646939] [2021-10-13 01:19:41,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395646939] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:41,101 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:41,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-13 01:19:41,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698709105] [2021-10-13 01:19:41,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-13 01:19:41,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:41,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-13 01:19:41,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2021-10-13 01:19:41,103 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-13 01:19:42,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:42,492 INFO L93 Difference]: Finished difference Result 480 states and 674 transitions. [2021-10-13 01:19:42,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-13 01:19:42,493 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-13 01:19:42,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:42,497 INFO L225 Difference]: With dead ends: 480 [2021-10-13 01:19:42,497 INFO L226 Difference]: Without dead ends: 443 [2021-10-13 01:19:42,500 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 633.0ms TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2021-10-13 01:19:42,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-10-13 01:19:42,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 413. [2021-10-13 01:19:42,514 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-13 01:19:42,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 557 transitions. [2021-10-13 01:19:42,516 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 557 transitions. Word has length 109 [2021-10-13 01:19:42,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:42,517 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 557 transitions. [2021-10-13 01:19:42,517 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-13 01:19:42,517 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 557 transitions. [2021-10-13 01:19:42,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-10-13 01:19:42,519 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:42,520 INFO L512 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-13 01:19:42,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-13 01:19:42,520 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:42,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:42,521 INFO L82 PathProgramCache]: Analyzing trace with hash 358552163, now seen corresponding path program 1 times [2021-10-13 01:19:42,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:42,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36976843] [2021-10-13 01:19:42,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:42,522 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:42,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:42,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:42,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:42,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-10-13 01:19:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:42,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:42,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:42,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:42,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:42,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-13 01:19:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:42,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-13 01:19:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:42,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:42,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-13 01:19:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:42,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:42,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:42,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:42,926 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-13 01:19:42,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:42,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36976843] [2021-10-13 01:19:42,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36976843] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:42,927 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:42,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-13 01:19:42,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943943680] [2021-10-13 01:19:42,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 01:19:42,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:42,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 01:19:42,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-10-13 01:19:42,930 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-13 01:19:43,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:43,761 INFO L93 Difference]: Finished difference Result 420 states and 559 transitions. [2021-10-13 01:19:43,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 01:19:43,761 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-13 01:19:43,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:43,765 INFO L225 Difference]: With dead ends: 420 [2021-10-13 01:19:43,765 INFO L226 Difference]: Without dead ends: 420 [2021-10-13 01:19:43,765 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 272.2ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-13 01:19:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-10-13 01:19:43,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 408. [2021-10-13 01:19:43,777 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-13 01:19:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 540 transitions. [2021-10-13 01:19:43,779 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 540 transitions. Word has length 121 [2021-10-13 01:19:43,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:43,780 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 540 transitions. [2021-10-13 01:19:43,780 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-13 01:19:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 540 transitions. [2021-10-13 01:19:43,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-10-13 01:19:43,782 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:43,783 INFO L512 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-13 01:19:43,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-13 01:19:43,783 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:43,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:43,784 INFO L82 PathProgramCache]: Analyzing trace with hash -618619876, now seen corresponding path program 1 times [2021-10-13 01:19:43,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:43,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974877237] [2021-10-13 01:19:43,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:43,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:43,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:43,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:43,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:43,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-10-13 01:19:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:44,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:44,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:44,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:44,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:44,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-13 01:19:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:44,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-13 01:19:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:44,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:44,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-13 01:19:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:44,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:44,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:44,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:44,208 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-13 01:19:44,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:44,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974877237] [2021-10-13 01:19:44,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974877237] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:44,211 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:44,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-13 01:19:44,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650666767] [2021-10-13 01:19:44,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 01:19:44,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:44,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 01:19:44,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-10-13 01:19:44,214 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-13 01:19:45,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:45,158 INFO L93 Difference]: Finished difference Result 547 states and 788 transitions. [2021-10-13 01:19:45,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 01:19:45,158 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-13 01:19:45,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:45,163 INFO L225 Difference]: With dead ends: 547 [2021-10-13 01:19:45,163 INFO L226 Difference]: Without dead ends: 547 [2021-10-13 01:19:45,163 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 304.2ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-13 01:19:45,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-10-13 01:19:45,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 399. [2021-10-13 01:19:45,178 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-13 01:19:45,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 529 transitions. [2021-10-13 01:19:45,180 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 529 transitions. Word has length 122 [2021-10-13 01:19:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:45,183 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 529 transitions. [2021-10-13 01:19:45,183 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-13 01:19:45,184 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 529 transitions. [2021-10-13 01:19:45,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-10-13 01:19:45,185 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:45,185 INFO L512 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-13 01:19:45,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-13 01:19:45,186 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:45,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:45,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1613788965, now seen corresponding path program 1 times [2021-10-13 01:19:45,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:45,187 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6244252] [2021-10-13 01:19:45,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:45,188 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:45,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:45,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:45,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:45,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-13 01:19:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:45,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:19:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:45,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:45,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:45,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:45,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:45,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:45,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-10-13 01:19:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:45,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-10-13 01:19:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:45,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-10-13 01:19:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:45,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:45,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-13 01:19:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:45,876 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-13 01:19:45,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:45,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6244252] [2021-10-13 01:19:45,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6244252] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:45,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:45,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-13 01:19:45,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98811631] [2021-10-13 01:19:45,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-13 01:19:45,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:45,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-13 01:19:45,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-10-13 01:19:45,879 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-13 01:19:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:48,671 INFO L93 Difference]: Finished difference Result 800 states and 1072 transitions. [2021-10-13 01:19:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-13 01:19:48,672 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-13 01:19:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:48,676 INFO L225 Difference]: With dead ends: 800 [2021-10-13 01:19:48,676 INFO L226 Difference]: Without dead ends: 743 [2021-10-13 01:19:48,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1083.9ms TimeCoverageRelationStatistics Valid=377, Invalid=2929, Unknown=0, NotChecked=0, Total=3306 [2021-10-13 01:19:48,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2021-10-13 01:19:48,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 724. [2021-10-13 01:19:48,701 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-13 01:19:48,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 949 transitions. [2021-10-13 01:19:48,704 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 949 transitions. Word has length 119 [2021-10-13 01:19:48,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:48,705 INFO L470 AbstractCegarLoop]: Abstraction has 724 states and 949 transitions. [2021-10-13 01:19:48,705 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-13 01:19:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 949 transitions. [2021-10-13 01:19:48,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-10-13 01:19:48,708 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:48,708 INFO L512 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-13 01:19:48,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-13 01:19:48,708 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:48,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:48,709 INFO L82 PathProgramCache]: Analyzing trace with hash 708012953, now seen corresponding path program 1 times [2021-10-13 01:19:48,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:48,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802931858] [2021-10-13 01:19:48,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:48,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:48,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:48,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:48,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:48,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-13 01:19:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:49,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-13 01:19:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:49,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:49,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:49,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:49,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:49,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:49,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-10-13 01:19:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:49,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-10-13 01:19:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:49,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-10-13 01:19:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:49,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:49,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-13 01:19:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:49,345 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-13 01:19:49,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:49,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802931858] [2021-10-13 01:19:49,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802931858] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:49,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:49,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-13 01:19:49,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224278238] [2021-10-13 01:19:49,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-13 01:19:49,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:49,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-13 01:19:49,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-10-13 01:19:49,349 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-13 01:19:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:52,418 INFO L93 Difference]: Finished difference Result 741 states and 977 transitions. [2021-10-13 01:19:52,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-10-13 01:19:52,418 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-13 01:19:52,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:52,422 INFO L225 Difference]: With dead ends: 741 [2021-10-13 01:19:52,423 INFO L226 Difference]: Without dead ends: 684 [2021-10-13 01:19:52,424 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 948.4ms TimeCoverageRelationStatistics Valid=341, Invalid=2209, Unknown=0, NotChecked=0, Total=2550 [2021-10-13 01:19:52,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-10-13 01:19:52,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 341. [2021-10-13 01:19:52,437 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-13 01:19:52,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 436 transitions. [2021-10-13 01:19:52,439 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 436 transitions. Word has length 119 [2021-10-13 01:19:52,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:52,439 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 436 transitions. [2021-10-13 01:19:52,440 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-13 01:19:52,440 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 436 transitions. [2021-10-13 01:19:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-10-13 01:19:52,442 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:52,443 INFO L512 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-13 01:19:52,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-13 01:19:52,443 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:52,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:52,444 INFO L82 PathProgramCache]: Analyzing trace with hash -292170069, now seen corresponding path program 1 times [2021-10-13 01:19:52,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:52,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724022098] [2021-10-13 01:19:52,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:52,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-10-13 01:19:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-13 01:19:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-13 01:19:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-13 01:19:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-10-13 01:19:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-10-13 01:19:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:52,841 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-13 01:19:52,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:52,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724022098] [2021-10-13 01:19:52,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724022098] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:19:52,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006051245] [2021-10-13 01:19:52,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:52,843 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:19:52,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:19:52,852 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:19:52,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 01:19:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:53,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 1359 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 01:19:53,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:19:53,933 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-13 01:19:53,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006051245] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:53,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-10-13 01:19:53,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 15 [2021-10-13 01:19:53,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897726592] [2021-10-13 01:19:53,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:19:53,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:53,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:19:53,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-10-13 01:19:53,937 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-13 01:19:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:53,997 INFO L93 Difference]: Finished difference Result 374 states and 483 transitions. [2021-10-13 01:19:53,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:19:53,998 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-13 01:19:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:54,010 INFO L225 Difference]: With dead ends: 374 [2021-10-13 01:19:54,010 INFO L226 Difference]: Without dead ends: 372 [2021-10-13 01:19:54,011 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 220.7ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-10-13 01:19:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-10-13 01:19:54,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 361. [2021-10-13 01:19:54,028 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-13 01:19:54,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 465 transitions. [2021-10-13 01:19:54,030 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 465 transitions. Word has length 163 [2021-10-13 01:19:54,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:54,031 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 465 transitions. [2021-10-13 01:19:54,031 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-13 01:19:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 465 transitions. [2021-10-13 01:19:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-10-13 01:19:54,034 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:54,035 INFO L512 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-13 01:19:54,085 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 01:19:54,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:19:54,249 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:54,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:54,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1488612663, now seen corresponding path program 1 times [2021-10-13 01:19:54,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:54,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343928151] [2021-10-13 01:19:54,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:54,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-10-13 01:19:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-13 01:19:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-13 01:19:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-13 01:19:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-13 01:19:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-10-13 01:19:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:54,680 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-13 01:19:54,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:54,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343928151] [2021-10-13 01:19:54,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343928151] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:54,681 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:54,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-13 01:19:54,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176479223] [2021-10-13 01:19:54,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 01:19:54,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:54,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 01:19:54,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-10-13 01:19:54,683 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-13 01:19:55,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:55,547 INFO L93 Difference]: Finished difference Result 388 states and 505 transitions. [2021-10-13 01:19:55,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 01:19:55,548 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-13 01:19:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:55,550 INFO L225 Difference]: With dead ends: 388 [2021-10-13 01:19:55,550 INFO L226 Difference]: Without dead ends: 388 [2021-10-13 01:19:55,550 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 280.9ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-13 01:19:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-10-13 01:19:55,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 363. [2021-10-13 01:19:55,556 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-13 01:19:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 467 transitions. [2021-10-13 01:19:55,558 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 467 transitions. Word has length 164 [2021-10-13 01:19:55,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:55,558 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 467 transitions. [2021-10-13 01:19:55,558 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-13 01:19:55,558 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 467 transitions. [2021-10-13 01:19:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-10-13 01:19:55,561 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:55,561 INFO L512 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-13 01:19:55,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-13 01:19:55,562 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:55,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:55,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1456464136, now seen corresponding path program 1 times [2021-10-13 01:19:55,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:55,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991422384] [2021-10-13 01:19:55,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:55,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-10-13 01:19:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:55,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-13 01:19:55,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-13 01:19:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-13 01:19:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-13 01:19:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-10-13 01:19:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:55,967 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-13 01:19:55,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:55,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991422384] [2021-10-13 01:19:55,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991422384] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:55,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:55,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-13 01:19:55,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472786676] [2021-10-13 01:19:55,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-13 01:19:55,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:55,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-13 01:19:55,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-10-13 01:19:55,971 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-13 01:19:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:56,403 INFO L93 Difference]: Finished difference Result 369 states and 477 transitions. [2021-10-13 01:19:56,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 01:19:56,404 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-13 01:19:56,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:56,407 INFO L225 Difference]: With dead ends: 369 [2021-10-13 01:19:56,407 INFO L226 Difference]: Without dead ends: 369 [2021-10-13 01:19:56,407 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 236.2ms TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2021-10-13 01:19:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-10-13 01:19:56,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 363. [2021-10-13 01:19:56,416 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-13 01:19:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 465 transitions. [2021-10-13 01:19:56,418 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 465 transitions. Word has length 164 [2021-10-13 01:19:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:56,419 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 465 transitions. [2021-10-13 01:19:56,419 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-13 01:19:56,419 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 465 transitions. [2021-10-13 01:19:56,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-10-13 01:19:56,422 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:56,422 INFO L512 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-13 01:19:56,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-13 01:19:56,426 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:56,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:56,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1734693448, now seen corresponding path program 1 times [2021-10-13 01:19:56,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:56,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609404263] [2021-10-13 01:19:56,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:56,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-10-13 01:19:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:56,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-13 01:19:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-13 01:19:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-13 01:19:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-13 01:19:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-10-13 01:19:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-10-13 01:19:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:56,870 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-13 01:19:56,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:56,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609404263] [2021-10-13 01:19:56,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609404263] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:56,871 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:56,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-13 01:19:56,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204929578] [2021-10-13 01:19:56,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 01:19:56,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:56,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 01:19:56,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-10-13 01:19:56,873 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-13 01:19:57,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:57,401 INFO L93 Difference]: Finished difference Result 428 states and 566 transitions. [2021-10-13 01:19:57,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 01:19:57,402 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-13 01:19:57,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:57,404 INFO L225 Difference]: With dead ends: 428 [2021-10-13 01:19:57,405 INFO L226 Difference]: Without dead ends: 428 [2021-10-13 01:19:57,405 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 275.2ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-13 01:19:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-10-13 01:19:57,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 345. [2021-10-13 01:19:57,415 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-13 01:19:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 433 transitions. [2021-10-13 01:19:57,416 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 433 transitions. Word has length 172 [2021-10-13 01:19:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:57,417 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 433 transitions. [2021-10-13 01:19:57,417 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-13 01:19:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 433 transitions. [2021-10-13 01:19:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-10-13 01:19:57,421 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:57,421 INFO L512 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-13 01:19:57,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-13 01:19:57,422 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:57,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:57,422 INFO L82 PathProgramCache]: Analyzing trace with hash 405901981, now seen corresponding path program 1 times [2021-10-13 01:19:57,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:57,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111680898] [2021-10-13 01:19:57,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:57,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-10-13 01:19:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-13 01:19:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-13 01:19:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-13 01:19:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-13 01:19:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-10-13 01:19:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-10-13 01:19:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-10-13 01:19:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:57,875 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-13 01:19:57,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:57,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111680898] [2021-10-13 01:19:57,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111680898] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:57,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:57,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-13 01:19:57,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085525242] [2021-10-13 01:19:57,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 01:19:57,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:57,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 01:19:57,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-10-13 01:19:57,879 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-13 01:19:58,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:58,279 INFO L93 Difference]: Finished difference Result 354 states and 451 transitions. [2021-10-13 01:19:58,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 01:19:58,279 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-13 01:19:58,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:58,287 INFO L225 Difference]: With dead ends: 354 [2021-10-13 01:19:58,292 INFO L226 Difference]: Without dead ends: 354 [2021-10-13 01:19:58,293 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 253.5ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-13 01:19:58,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-10-13 01:19:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 309. [2021-10-13 01:19:58,299 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-13 01:19:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 385 transitions. [2021-10-13 01:19:58,300 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 385 transitions. Word has length 204 [2021-10-13 01:19:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:58,301 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 385 transitions. [2021-10-13 01:19:58,301 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-13 01:19:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 385 transitions. [2021-10-13 01:19:58,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-10-13 01:19:58,304 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:19:58,305 INFO L512 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-13 01:19:58,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-13 01:19:58,305 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-13 01:19:58,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:19:58,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2083081796, now seen corresponding path program 1 times [2021-10-13 01:19:58,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:19:58,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057032296] [2021-10-13 01:19:58,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:19:58,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:19:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-13 01:19:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-13 01:19:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-13 01:19:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-10-13 01:19:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-13 01:19:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-13 01:19:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-10-13 01:19:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-13 01:19:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-13 01:19:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-10-13 01:19:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-10-13 01:19:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-10-13 01:19:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-13 01:19:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-13 01:19:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-13 01:19:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:19:58,696 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-13 01:19:58,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:19:58,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057032296] [2021-10-13 01:19:58,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057032296] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:19:58,697 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:19:58,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-13 01:19:58,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515270083] [2021-10-13 01:19:58,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-13 01:19:58,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:19:58,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-13 01:19:58,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-10-13 01:19:58,700 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-13 01:19:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:19:59,402 INFO L93 Difference]: Finished difference Result 290 states and 362 transitions. [2021-10-13 01:19:59,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 01:19:59,403 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-13 01:19:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:19:59,404 INFO L225 Difference]: With dead ends: 290 [2021-10-13 01:19:59,404 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 01:19:59,404 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 231.2ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-10-13 01:19:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 01:19:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 01:19:59,405 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-13 01:19:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 01:19:59,405 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2021-10-13 01:19:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:19:59,405 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 01:19:59,405 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-13 01:19:59,405 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 01:19:59,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 01:19:59,407 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-10-13 01:19:59,408 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 01:19:59,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-13 01:19:59,413 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 01:19:59,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:19:59 BoogieIcfgContainer [2021-10-13 01:19:59,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 01:19:59,416 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 01:19:59,416 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 01:19:59,416 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 01:19:59,417 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:18:29" (3/4) ... [2021-10-13 01:19:59,420 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 01:19:59,427 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-10-13 01:19:59,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2021-10-13 01:19:59,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-10-13 01:19:59,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSyncFilterWithTarget [2021-10-13 01:19:59,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2021-10-13 01:19:59,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2021-10-13 01:19:59,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPower [2021-10-13 01:19:59,428 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2021-10-13 01:19:59,429 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-10-13 01:19:59,429 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2021-10-13 01:19:59,429 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2021-10-13 01:19:59,429 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2021-10-13 01:19:59,429 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSendToNextDriver [2021-10-13 01:19:59,429 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfStartDevice [2021-10-13 01:19:59,429 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2021-10-13 01:19:59,429 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRegisterDevice [2021-10-13 01:19:59,430 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDeviceControl [2021-10-13 01:19:59,430 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-10-13 01:19:59,430 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRemoveDevice [2021-10-13 01:19:59,430 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfCreate [2021-10-13 01:19:59,430 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfUnload [2021-10-13 01:19:59,430 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2021-10-13 01:19:59,430 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-10-13 01:19:59,430 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2021-10-13 01:19:59,431 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPnp [2021-10-13 01:19:59,431 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-10-13 01:19:59,431 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfShutdownFlush [2021-10-13 01:19:59,452 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 63 nodes and edges [2021-10-13 01:19:59,455 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2021-10-13 01:19:59,457 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-13 01:19:59,459 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-13 01:19:59,650 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 01:19:59,650 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 01:19:59,652 INFO L168 Benchmark]: Toolchain (without parser) took 92510.86 ms. Allocated memory was 86.0 MB in the beginning and 302.0 MB in the end (delta: 216.0 MB). Free memory was 46.9 MB in the beginning and 212.1 MB in the end (delta: -165.2 MB). Peak memory consumption was 51.8 MB. Max. memory is 16.1 GB. [2021-10-13 01:19:59,653 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 86.0 MB. Free memory is still 64.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:19:59,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.20 ms. Allocated memory was 86.0 MB in the beginning and 115.3 MB in the end (delta: 29.4 MB). Free memory was 46.7 MB in the beginning and 79.8 MB in the end (delta: -33.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 01:19:59,654 INFO L168 Benchmark]: Boogie Preprocessor took 113.83 ms. Allocated memory is still 115.3 MB. Free memory was 79.8 MB in the beginning and 76.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 01:19:59,654 INFO L168 Benchmark]: RCFGBuilder took 1540.23 ms. Allocated memory is still 115.3 MB. Free memory was 76.2 MB in the beginning and 84.6 MB in the end (delta: -8.3 MB). Peak memory consumption was 42.8 MB. Max. memory is 16.1 GB. [2021-10-13 01:19:59,655 INFO L168 Benchmark]: TraceAbstraction took 89831.42 ms. Allocated memory was 115.3 MB in the beginning and 302.0 MB in the end (delta: 186.6 MB). Free memory was 84.6 MB in the beginning and 232.0 MB in the end (delta: -147.5 MB). Peak memory consumption was 38.3 MB. Max. memory is 16.1 GB. [2021-10-13 01:19:59,655 INFO L168 Benchmark]: Witness Printer took 234.45 ms. Allocated memory is still 302.0 MB. Free memory was 232.0 MB in the beginning and 212.1 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-13 01:19:59,657 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.32 ms. Allocated memory is still 86.0 MB. Free memory is still 64.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 774.20 ms. Allocated memory was 86.0 MB in the beginning and 115.3 MB in the end (delta: 29.4 MB). Free memory was 46.7 MB in the beginning and 79.8 MB in the end (delta: -33.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 113.83 ms. Allocated memory is still 115.3 MB. Free memory was 79.8 MB in the beginning and 76.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1540.23 ms. Allocated memory is still 115.3 MB. Free memory was 76.2 MB in the beginning and 84.6 MB in the end (delta: -8.3 MB). Peak memory consumption was 42.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 89831.42 ms. Allocated memory was 115.3 MB in the beginning and 302.0 MB in the end (delta: 186.6 MB). Free memory was 84.6 MB in the beginning and 232.0 MB in the end (delta: -147.5 MB). Peak memory consumption was 38.3 MB. Max. memory is 16.1 GB. * Witness Printer took 234.45 ms. Allocated memory is still 302.0 MB. Free memory was 232.0 MB in the beginning and 212.1 MB in the end (delta: 19.9 MB). Peak memory consumption was 21.0 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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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: 89765.8ms, OverallIterations: 51, TraceHistogramMax: 4, EmptinessCheckTime: 115.6ms, AutomataDifference: 66915.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 25.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 14077 SDtfs, 15533 SDslu, 43568 SDs, 0 SdLazy, 55785 SolverSat, 7497 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 46442.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1756 GetRequests, 927 SyntacticMatches, 0 SemanticMatches, 829 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2875 ImplicationChecksByTransitivity, 19873.8ms Time, 0.0ms 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.0ms DumpTime, AutomataMinimizationStatistics: 1352.2ms AutomataMinimizationTime, 51 MinimizatonAttempts, 2877 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 392.7ms SsaConstructionTime, 1250.4ms SatisfiabilityAnalysisTime, 18588.6ms 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-13 01:19:59,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_241cf0b6-5f38-4912-ad18-8ad1f5f5178e/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...